./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:08:20,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:08:20,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:08:20,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:08:20,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:08:20,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:08:20,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:08:20,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:08:20,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:08:20,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:08:20,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:08:20,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:08:20,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:08:20,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:08:20,259 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:08:20,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:08:20,259 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:08:20,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:08:20,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:08:20,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:08:20,259 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:08:20,260 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:08:20,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:08:20,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:08:20,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:08:20,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:08:20,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:08:20,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:08:20,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:08:20,261 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-03-04 10:08:20,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:08:20,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:08:20,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:08:20,485 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:08:20,485 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:08:20,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-03-04 10:08:21,610 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5343e617b/f74e080763d34215b42cd2a43ee46c50/FLAG34513cca8 [2025-03-04 10:08:21,849 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:08:21,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-03-04 10:08:21,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5343e617b/f74e080763d34215b42cd2a43ee46c50/FLAG34513cca8 [2025-03-04 10:08:22,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5343e617b/f74e080763d34215b42cd2a43ee46c50 [2025-03-04 10:08:22,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:08:22,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:08:22,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:08:22,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:08:22,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:08:22,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ea8090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22, skipping insertion in model container [2025-03-04 10:08:22,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:08:22,361 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:08:22,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:08:22,372 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:08:22,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:08:22,413 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:08:22,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22 WrapperNode [2025-03-04 10:08:22,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:08:22,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:08:22,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:08:22,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:08:22,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,445 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 158 [2025-03-04 10:08:22,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:08:22,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:08:22,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:08:22,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:08:22,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,482 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 10:08:22,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:08:22,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:08:22,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:08:22,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:08:22,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (1/1) ... [2025-03-04 10:08:22,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:08:22,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:22,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:08:22,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:08:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:08:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:08:22,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:08:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:08:22,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:08:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:08:22,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:08:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:08:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:08:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:08:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:08:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:08:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:08:22,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:08:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:08:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:08:22,545 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:08:22,640 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:08:22,642 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:08:23,096 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:08:23,096 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:08:23,330 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:08:23,331 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:08:23,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:08:23 BoogieIcfgContainer [2025-03-04 10:08:23,331 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:08:23,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:08:23,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:08:23,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:08:23,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:08:22" (1/3) ... [2025-03-04 10:08:23,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438feefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:08:23, skipping insertion in model container [2025-03-04 10:08:23,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:22" (2/3) ... [2025-03-04 10:08:23,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438feefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:08:23, skipping insertion in model container [2025-03-04 10:08:23,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:08:23" (3/3) ... [2025-03-04 10:08:23,340 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-03-04 10:08:23,352 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:08:23,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 85 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-04 10:08:23,354 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:08:23,431 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:08:23,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 96 transitions, 213 flow [2025-03-04 10:08:23,497 INFO L124 PetriNetUnfolderBase]: 12/93 cut-off events. [2025-03-04 10:08:23,498 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:08:23,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 93 events. 12/93 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 307 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-03-04 10:08:23,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 96 transitions, 213 flow [2025-03-04 10:08:23,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 92 transitions, 202 flow [2025-03-04 10:08:23,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:08:23,529 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=None, 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;@24c9b819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:08:23,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-04 10:08:23,533 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:08:23,533 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:08:23,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:08:23,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:23,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:08:23,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:23,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:23,539 INFO L85 PathProgramCache]: Analyzing trace with hash 664455, now seen corresponding path program 1 times [2025-03-04 10:08:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285225929] [2025-03-04 10:08:23,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:23,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:08:23,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:08:23,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:23,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:23,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:23,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285225929] [2025-03-04 10:08:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285225929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:23,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:08:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676499638] [2025-03-04 10:08:23,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:23,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:08:23,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:23,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:08:23,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:08:23,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-04 10:08:23,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:23,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:23,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-04 10:08:23,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:24,305 INFO L124 PetriNetUnfolderBase]: 2426/4409 cut-off events. [2025-03-04 10:08:24,306 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-03-04 10:08:24,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7761 conditions, 4409 events. 2426/4409 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29899 event pairs, 1460 based on Foata normal form. 1/2907 useless extension candidates. Maximal degree in co-relation 7303. Up to 3188 conditions per place. [2025-03-04 10:08:24,336 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 42 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-03-04 10:08:24,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 280 flow [2025-03-04 10:08:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:08:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:08:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-03-04 10:08:24,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-04 10:08:24,346 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 202 flow. Second operand 3 states and 189 transitions. [2025-03-04 10:08:24,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 280 flow [2025-03-04 10:08:24,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 268 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:08:24,358 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 184 flow [2025-03-04 10:08:24,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2025-03-04 10:08:24,363 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -9 predicate places. [2025-03-04 10:08:24,364 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 184 flow [2025-03-04 10:08:24,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:24,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:24,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:08:24,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:08:24,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:24,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:24,366 INFO L85 PathProgramCache]: Analyzing trace with hash 664456, now seen corresponding path program 1 times [2025-03-04 10:08:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:24,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737421442] [2025-03-04 10:08:24,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:24,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:24,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:08:24,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:08:24,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:24,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:24,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:24,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737421442] [2025-03-04 10:08:24,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737421442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:24,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:24,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:08:24,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414201679] [2025-03-04 10:08:24,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:24,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:24,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:24,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:24,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:08:24,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-04 10:08:24,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:24,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:24,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-04 10:08:24,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:25,124 INFO L124 PetriNetUnfolderBase]: 2427/4412 cut-off events. [2025-03-04 10:08:25,125 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:08:25,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 4412 events. 2427/4412 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29867 event pairs, 1460 based on Foata normal form. 0/2906 useless extension candidates. Maximal degree in co-relation 7632. Up to 3201 conditions per place. [2025-03-04 10:08:25,154 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 46 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-03-04 10:08:25,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 290 flow [2025-03-04 10:08:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-04 10:08:25,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6223958333333334 [2025-03-04 10:08:25,156 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 184 flow. Second operand 4 states and 239 transitions. [2025-03-04 10:08:25,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 290 flow [2025-03-04 10:08:25,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:25,158 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 207 flow [2025-03-04 10:08:25,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2025-03-04 10:08:25,159 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-03-04 10:08:25,159 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 207 flow [2025-03-04 10:08:25,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:25,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:25,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:08:25,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:08:25,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:25,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash 20600014, now seen corresponding path program 1 times [2025-03-04 10:08:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:25,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939162127] [2025-03-04 10:08:25,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:25,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:08:25,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:08:25,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:25,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:25,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:25,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939162127] [2025-03-04 10:08:25,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939162127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:25,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:25,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:08:25,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277005924] [2025-03-04 10:08:25,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:25,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:25,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:25,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:25,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-04 10:08:25,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:25,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:25,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-04 10:08:25,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:25,871 INFO L124 PetriNetUnfolderBase]: 2428/4415 cut-off events. [2025-03-04 10:08:25,871 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:08:25,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7686 conditions, 4415 events. 2428/4415 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29905 event pairs, 1460 based on Foata normal form. 0/2908 useless extension candidates. Maximal degree in co-relation 7661. Up to 3200 conditions per place. [2025-03-04 10:08:25,891 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 46 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-03-04 10:08:25,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 93 transitions, 319 flow [2025-03-04 10:08:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-03-04 10:08:25,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020833333333333 [2025-03-04 10:08:25,894 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 207 flow. Second operand 5 states and 289 transitions. [2025-03-04 10:08:25,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 93 transitions, 319 flow [2025-03-04 10:08:25,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 93 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:25,895 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 241 flow [2025-03-04 10:08:25,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2025-03-04 10:08:25,896 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -1 predicate places. [2025-03-04 10:08:25,896 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 241 flow [2025-03-04 10:08:25,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:25,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:25,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:08:25,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:08:25,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:25,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash 638604615, now seen corresponding path program 1 times [2025-03-04 10:08:25,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:25,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292700442] [2025-03-04 10:08:25,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:25,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:25,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:08:25,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:08:25,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:25,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:26,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292700442] [2025-03-04 10:08:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292700442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:26,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:08:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127416041] [2025-03-04 10:08:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:26,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:26,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:26,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:26,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-04 10:08:26,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 93 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:26,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:26,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-04 10:08:26,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:26,534 INFO L124 PetriNetUnfolderBase]: 2429/4418 cut-off events. [2025-03-04 10:08:26,534 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 10:08:26,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7708 conditions, 4418 events. 2429/4418 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29882 event pairs, 1460 based on Foata normal form. 0/2912 useless extension candidates. Maximal degree in co-relation 7677. Up to 3203 conditions per place. [2025-03-04 10:08:26,553 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 47 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2025-03-04 10:08:26,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 359 flow [2025-03-04 10:08:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-03-04 10:08:26,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020833333333333 [2025-03-04 10:08:26,555 INFO L175 Difference]: Start difference. First operand has 89 places, 93 transitions, 241 flow. Second operand 5 states and 289 transitions. [2025-03-04 10:08:26,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 359 flow [2025-03-04 10:08:26,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:26,556 INFO L231 Difference]: Finished difference. Result has 94 places, 96 transitions, 283 flow [2025-03-04 10:08:26,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=94, PETRI_TRANSITIONS=96} [2025-03-04 10:08:26,557 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-03-04 10:08:26,557 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 96 transitions, 283 flow [2025-03-04 10:08:26,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:26,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:26,557 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:08:26,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:08:26,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:26,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash 638563763, now seen corresponding path program 1 times [2025-03-04 10:08:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:26,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360362822] [2025-03-04 10:08:26,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:26,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:26,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:08:26,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:08:26,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:26,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:26,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:26,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360362822] [2025-03-04 10:08:26,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360362822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:26,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684738572] [2025-03-04 10:08:26,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:26,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:26,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:26,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:26,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:08:26,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:08:26,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:08:26,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:26,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:26,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:08:26,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:26,828 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 8 treesize of output 1 [2025-03-04 10:08:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:26,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:27,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684738572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:27,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:27,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:08:27,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527877512] [2025-03-04 10:08:27,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:27,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:08:27,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:27,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:08:27,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:08:27,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-04 10:08:27,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 96 transitions, 283 flow. Second operand has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:27,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:27,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-04 10:08:27,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:27,903 INFO L124 PetriNetUnfolderBase]: 2429/4417 cut-off events. [2025-03-04 10:08:27,903 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 10:08:27,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7726 conditions, 4417 events. 2429/4417 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29881 event pairs, 1460 based on Foata normal form. 0/2914 useless extension candidates. Maximal degree in co-relation 7692. Up to 3203 conditions per place. [2025-03-04 10:08:27,926 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 48 selfloop transitions, 7 changer transitions 0/95 dead transitions. [2025-03-04 10:08:27,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 95 transitions, 389 flow [2025-03-04 10:08:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:08:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:08:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 332 transitions. [2025-03-04 10:08:27,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2025-03-04 10:08:27,928 INFO L175 Difference]: Start difference. First operand has 94 places, 96 transitions, 283 flow. Second operand 6 states and 332 transitions. [2025-03-04 10:08:27,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 95 transitions, 389 flow [2025-03-04 10:08:27,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 95 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:27,933 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 286 flow [2025-03-04 10:08:27,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2025-03-04 10:08:27,934 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places. [2025-03-04 10:08:27,934 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 286 flow [2025-03-04 10:08:27,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:27,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:27,934 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:08:27,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:08:28,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:28,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:28,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:28,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1678202827, now seen corresponding path program 1 times [2025-03-04 10:08:28,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:28,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452428443] [2025-03-04 10:08:28,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:28,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:08:28,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:08:28,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:28,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:28,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:28,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452428443] [2025-03-04 10:08:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452428443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:28,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96440956] [2025-03-04 10:08:28,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:28,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:28,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:28,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:28,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:08:28,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:08:28,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:08:28,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:28,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:28,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:08:28,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:28,355 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 10 treesize of output 9 [2025-03-04 10:08:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:28,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:28,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96440956] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:28,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:28,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:08:28,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612067200] [2025-03-04 10:08:28,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:28,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:08:28,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:28,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:08:28,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:08:29,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-04 10:08:29,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 286 flow. Second operand has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:29,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:29,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-04 10:08:29,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:29,923 INFO L124 PetriNetUnfolderBase]: 2431/4422 cut-off events. [2025-03-04 10:08:29,923 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 10:08:29,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7749 conditions, 4422 events. 2431/4422 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29914 event pairs, 1460 based on Foata normal form. 0/2920 useless extension candidates. Maximal degree in co-relation 7698. Up to 3196 conditions per place. [2025-03-04 10:08:29,939 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 42 selfloop transitions, 18 changer transitions 0/100 dead transitions. [2025-03-04 10:08:29,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 100 transitions, 437 flow [2025-03-04 10:08:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 482 transitions. [2025-03-04 10:08:29,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5578703703703703 [2025-03-04 10:08:29,943 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 286 flow. Second operand 9 states and 482 transitions. [2025-03-04 10:08:29,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 100 transitions, 437 flow [2025-03-04 10:08:29,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 100 transitions, 390 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 10:08:29,945 INFO L231 Difference]: Finished difference. Result has 95 places, 100 transitions, 306 flow [2025-03-04 10:08:29,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=306, PETRI_PLACES=95, PETRI_TRANSITIONS=100} [2025-03-04 10:08:29,948 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-03-04 10:08:29,948 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 100 transitions, 306 flow [2025-03-04 10:08:29,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:29,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:29,948 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:08:29,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:08:30,149 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,SelfDestructingSolverStorable5 [2025-03-04 10:08:30,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:30,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:30,149 INFO L85 PathProgramCache]: Analyzing trace with hash -481266276, now seen corresponding path program 1 times [2025-03-04 10:08:30,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:30,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831113902] [2025-03-04 10:08:30,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:30,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:30,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:08:30,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:08:30,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:30,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:30,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831113902] [2025-03-04 10:08:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831113902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065726819] [2025-03-04 10:08:30,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:30,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:30,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:30,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:30,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:08:30,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:08:30,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:08:30,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:30,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:30,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:08:30,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:30,441 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 10 treesize of output 9 [2025-03-04 10:08:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:30,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:30,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065726819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:30,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:30,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:08:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54590061] [2025-03-04 10:08:30,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:30,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:08:30,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:30,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:08:30,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:08:31,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-04 10:08:31,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 100 transitions, 306 flow. Second operand has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:31,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:31,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-04 10:08:31,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:31,784 INFO L124 PetriNetUnfolderBase]: 2432/4424 cut-off events. [2025-03-04 10:08:31,784 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-04 10:08:31,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7747 conditions, 4424 events. 2432/4424 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29902 event pairs, 1460 based on Foata normal form. 0/2922 useless extension candidates. Maximal degree in co-relation 7683. Up to 3198 conditions per place. [2025-03-04 10:08:31,805 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 40 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2025-03-04 10:08:31,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 102 transitions, 438 flow [2025-03-04 10:08:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 481 transitions. [2025-03-04 10:08:31,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5567129629629629 [2025-03-04 10:08:31,808 INFO L175 Difference]: Start difference. First operand has 95 places, 100 transitions, 306 flow. Second operand 9 states and 481 transitions. [2025-03-04 10:08:31,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 102 transitions, 438 flow [2025-03-04 10:08:31,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 102 transitions, 405 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-04 10:08:31,810 INFO L231 Difference]: Finished difference. Result has 97 places, 102 transitions, 325 flow [2025-03-04 10:08:31,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=325, PETRI_PLACES=97, PETRI_TRANSITIONS=102} [2025-03-04 10:08:31,810 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-03-04 10:08:31,810 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 102 transitions, 325 flow [2025-03-04 10:08:31,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:31,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:31,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:31,818 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-04 10:08:32,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:32,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:32,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1525198720, now seen corresponding path program 1 times [2025-03-04 10:08:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518750633] [2025-03-04 10:08:32,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:32,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:08:32,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:08:32,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:32,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:32,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518750633] [2025-03-04 10:08:32,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518750633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:32,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:32,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:08:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835033581] [2025-03-04 10:08:32,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:32,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:32,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:32,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:32,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-04 10:08:32,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 102 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:32,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:32,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-04 10:08:32,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:32,549 INFO L124 PetriNetUnfolderBase]: 4331/8288 cut-off events. [2025-03-04 10:08:32,549 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-04 10:08:32,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14256 conditions, 8288 events. 4331/8288 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 65191 event pairs, 2464 based on Foata normal form. 114/5641 useless extension candidates. Maximal degree in co-relation 8793. Up to 3549 conditions per place. [2025-03-04 10:08:32,580 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 128 selfloop transitions, 5 changer transitions 0/172 dead transitions. [2025-03-04 10:08:32,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 172 transitions, 807 flow [2025-03-04 10:08:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 352 transitions. [2025-03-04 10:08:32,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-04 10:08:32,581 INFO L175 Difference]: Start difference. First operand has 97 places, 102 transitions, 325 flow. Second operand 5 states and 352 transitions. [2025-03-04 10:08:32,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 172 transitions, 807 flow [2025-03-04 10:08:32,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 172 transitions, 729 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-04 10:08:32,584 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 304 flow [2025-03-04 10:08:32,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2025-03-04 10:08:32,584 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-03-04 10:08:32,584 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 304 flow [2025-03-04 10:08:32,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:32,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:32,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:32,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:08:32,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:32,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:32,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1503966571, now seen corresponding path program 1 times [2025-03-04 10:08:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:32,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876976885] [2025-03-04 10:08:32,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:32,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:08:32,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:08:32,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:32,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:32,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:32,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876976885] [2025-03-04 10:08:32,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876976885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:32,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:32,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:08:32,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075713039] [2025-03-04 10:08:32,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:32,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:32,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:32,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:32,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:32,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-04 10:08:32,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:32,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:32,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-04 10:08:32,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:33,243 INFO L124 PetriNetUnfolderBase]: 7592/14556 cut-off events. [2025-03-04 10:08:33,243 INFO L125 PetriNetUnfolderBase]: For 1981/1981 co-relation queries the response was YES. [2025-03-04 10:08:33,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26403 conditions, 14556 events. 7592/14556 cut-off events. For 1981/1981 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 125874 event pairs, 4318 based on Foata normal form. 114/10236 useless extension candidates. Maximal degree in co-relation 18890. Up to 5738 conditions per place. [2025-03-04 10:08:33,294 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 117 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2025-03-04 10:08:33,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 167 transitions, 721 flow [2025-03-04 10:08:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:08:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:08:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 401 transitions. [2025-03-04 10:08:33,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6961805555555556 [2025-03-04 10:08:33,296 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 304 flow. Second operand 6 states and 401 transitions. [2025-03-04 10:08:33,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 167 transitions, 721 flow [2025-03-04 10:08:33,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 167 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:33,299 INFO L231 Difference]: Finished difference. Result has 103 places, 110 transitions, 375 flow [2025-03-04 10:08:33,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=103, PETRI_TRANSITIONS=110} [2025-03-04 10:08:33,300 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 13 predicate places. [2025-03-04 10:08:33,300 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 110 transitions, 375 flow [2025-03-04 10:08:33,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:33,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:33,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:33,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:08:33,300 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:33,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash 331048766, now seen corresponding path program 1 times [2025-03-04 10:08:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:33,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436405277] [2025-03-04 10:08:33,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:33,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:33,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:08:33,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:08:33,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:33,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:33,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:33,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436405277] [2025-03-04 10:08:33,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436405277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:33,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:08:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723398295] [2025-03-04 10:08:33,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:33,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:33,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:33,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:33,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:33,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-04 10:08:33,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 110 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:33,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:33,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-04 10:08:33,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:33,949 INFO L124 PetriNetUnfolderBase]: 6629/13414 cut-off events. [2025-03-04 10:08:33,949 INFO L125 PetriNetUnfolderBase]: For 4665/4837 co-relation queries the response was YES. [2025-03-04 10:08:33,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25052 conditions, 13414 events. 6629/13414 cut-off events. For 4665/4837 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 118738 event pairs, 3961 based on Foata normal form. 174/9435 useless extension candidates. Maximal degree in co-relation 18372. Up to 5982 conditions per place. [2025-03-04 10:08:33,991 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 114 selfloop transitions, 9 changer transitions 0/162 dead transitions. [2025-03-04 10:08:33,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 162 transitions, 773 flow [2025-03-04 10:08:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:08:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:08:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-03-04 10:08:33,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6840277777777778 [2025-03-04 10:08:33,993 INFO L175 Difference]: Start difference. First operand has 103 places, 110 transitions, 375 flow. Second operand 6 states and 394 transitions. [2025-03-04 10:08:33,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 162 transitions, 773 flow [2025-03-04 10:08:33,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 162 transitions, 769 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:33,998 INFO L231 Difference]: Finished difference. Result has 109 places, 112 transitions, 405 flow [2025-03-04 10:08:33,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=405, PETRI_PLACES=109, PETRI_TRANSITIONS=112} [2025-03-04 10:08:33,998 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 19 predicate places. [2025-03-04 10:08:33,998 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 112 transitions, 405 flow [2025-03-04 10:08:33,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:33,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:33,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:33,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:08:33,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:33,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1415758327, now seen corresponding path program 1 times [2025-03-04 10:08:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:33,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942324304] [2025-03-04 10:08:34,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:34,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:08:34,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:08:34,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:34,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:34,047 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-04 10:08:34,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:34,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942324304] [2025-03-04 10:08:34,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942324304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:34,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:34,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:08:34,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415026212] [2025-03-04 10:08:34,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:34,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:34,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:34,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:34,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-04 10:08:34,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 112 transitions, 405 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:34,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:34,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-04 10:08:34,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:35,204 INFO L124 PetriNetUnfolderBase]: 11399/23039 cut-off events. [2025-03-04 10:08:35,204 INFO L125 PetriNetUnfolderBase]: For 11366/11594 co-relation queries the response was YES. [2025-03-04 10:08:35,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45650 conditions, 23039 events. 11399/23039 cut-off events. For 11366/11594 co-relation queries the response was YES. Maximal size of possible extension queue 1251. Compared 222850 event pairs, 6735 based on Foata normal form. 206/17107 useless extension candidates. Maximal degree in co-relation 33337. Up to 8952 conditions per place. [2025-03-04 10:08:35,319 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 127 selfloop transitions, 11 changer transitions 0/177 dead transitions. [2025-03-04 10:08:35,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 177 transitions, 927 flow [2025-03-04 10:08:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2025-03-04 10:08:35,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-04 10:08:35,320 INFO L175 Difference]: Start difference. First operand has 109 places, 112 transitions, 405 flow. Second operand 5 states and 345 transitions. [2025-03-04 10:08:35,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 177 transitions, 927 flow [2025-03-04 10:08:35,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 177 transitions, 915 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:08:35,335 INFO L231 Difference]: Finished difference. Result has 112 places, 116 transitions, 455 flow [2025-03-04 10:08:35,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=112, PETRI_TRANSITIONS=116} [2025-03-04 10:08:35,335 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 22 predicate places. [2025-03-04 10:08:35,335 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 116 transitions, 455 flow [2025-03-04 10:08:35,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:35,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:35,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:35,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:08:35,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:35,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1488690084, now seen corresponding path program 1 times [2025-03-04 10:08:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:35,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087990171] [2025-03-04 10:08:35,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:35,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:08:35,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:08:35,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:35,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:08:35,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:35,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087990171] [2025-03-04 10:08:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087990171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:35,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:35,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:08:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318597183] [2025-03-04 10:08:35,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:35,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:35,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:35,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:35,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:08:35,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 96 [2025-03-04 10:08:35,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 116 transitions, 455 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:35,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:35,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 96 [2025-03-04 10:08:35,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:36,768 INFO L124 PetriNetUnfolderBase]: 14632/27312 cut-off events. [2025-03-04 10:08:36,768 INFO L125 PetriNetUnfolderBase]: For 21916/22344 co-relation queries the response was YES. [2025-03-04 10:08:36,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59094 conditions, 27312 events. 14632/27312 cut-off events. For 21916/22344 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 243464 event pairs, 10066 based on Foata normal form. 0/21956 useless extension candidates. Maximal degree in co-relation 41502. Up to 19934 conditions per place. [2025-03-04 10:08:36,876 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 72 selfloop transitions, 8 changer transitions 0/112 dead transitions. [2025-03-04 10:08:36,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 607 flow [2025-03-04 10:08:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2025-03-04 10:08:36,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5145833333333333 [2025-03-04 10:08:36,877 INFO L175 Difference]: Start difference. First operand has 112 places, 116 transitions, 455 flow. Second operand 5 states and 247 transitions. [2025-03-04 10:08:36,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 607 flow [2025-03-04 10:08:36,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 112 transitions, 602 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:36,902 INFO L231 Difference]: Finished difference. Result has 111 places, 112 transitions, 458 flow [2025-03-04 10:08:36,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=458, PETRI_PLACES=111, PETRI_TRANSITIONS=112} [2025-03-04 10:08:36,903 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 21 predicate places. [2025-03-04 10:08:36,903 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 112 transitions, 458 flow [2025-03-04 10:08:36,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:36,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:36,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:36,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:08:36,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:36,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1488690085, now seen corresponding path program 1 times [2025-03-04 10:08:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:36,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139744140] [2025-03-04 10:08:36,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:36,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:36,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:08:36,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:08:36,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:36,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:08:37,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139744140] [2025-03-04 10:08:37,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139744140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649222867] [2025-03-04 10:08:37,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:37,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:37,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:37,078 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-04 10:08:37,080 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-04 10:08:37,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:08:37,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:08:37,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:37,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:37,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:08:37,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:37,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:08:37,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:37,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:08:37,201 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:08:37,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 10:08:37,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:37,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:08:37,243 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:08:37,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:08:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:08:37,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:37,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2025-03-04 10:08:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:08:37,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649222867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:37,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:37,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-04 10:08:37,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299220791] [2025-03-04 10:08:37,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:37,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:08:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:37,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:08:37,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:08:42,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:08:42,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 96 [2025-03-04 10:08:42,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 458 flow. Second operand has 16 states, 16 states have (on average 39.0625) internal successors, (625), 16 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:42,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:42,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 96 [2025-03-04 10:08:42,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:44,968 INFO L124 PetriNetUnfolderBase]: 18893/34312 cut-off events. [2025-03-04 10:08:44,968 INFO L125 PetriNetUnfolderBase]: For 25185/26045 co-relation queries the response was YES. [2025-03-04 10:08:45,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74169 conditions, 34312 events. 18893/34312 cut-off events. For 25185/26045 co-relation queries the response was YES. Maximal size of possible extension queue 1289. Compared 302809 event pairs, 8535 based on Foata normal form. 0/27594 useless extension candidates. Maximal degree in co-relation 52808. Up to 9059 conditions per place. [2025-03-04 10:08:45,199 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 169 selfloop transitions, 30 changer transitions 0/229 dead transitions. [2025-03-04 10:08:45,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 229 transitions, 1302 flow [2025-03-04 10:08:45,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 492 transitions. [2025-03-04 10:08:45,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2025-03-04 10:08:45,201 INFO L175 Difference]: Start difference. First operand has 111 places, 112 transitions, 458 flow. Second operand 9 states and 492 transitions. [2025-03-04 10:08:45,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 229 transitions, 1302 flow [2025-03-04 10:08:45,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 229 transitions, 1286 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:08:45,257 INFO L231 Difference]: Finished difference. Result has 117 places, 124 transitions, 608 flow [2025-03-04 10:08:45,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=608, PETRI_PLACES=117, PETRI_TRANSITIONS=124} [2025-03-04 10:08:45,258 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 27 predicate places. [2025-03-04 10:08:45,258 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 124 transitions, 608 flow [2025-03-04 10:08:45,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 39.0625) internal successors, (625), 16 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:45,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:45,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:45,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:08:45,459 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-04 10:08:45,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:45,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1593442606, now seen corresponding path program 1 times [2025-03-04 10:08:45,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:45,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610970031] [2025-03-04 10:08:45,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:45,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:08:45,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:08:45,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:45,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:45,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:45,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610970031] [2025-03-04 10:08:45,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610970031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:45,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:45,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:08:45,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965474811] [2025-03-04 10:08:45,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:45,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:45,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:45,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:45,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-04 10:08:45,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 124 transitions, 608 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:45,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:45,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-04 10:08:45,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:46,856 INFO L124 PetriNetUnfolderBase]: 12208/22466 cut-off events. [2025-03-04 10:08:46,856 INFO L125 PetriNetUnfolderBase]: For 27843/29021 co-relation queries the response was YES. [2025-03-04 10:08:46,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52190 conditions, 22466 events. 12208/22466 cut-off events. For 27843/29021 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 190237 event pairs, 7684 based on Foata normal form. 392/18563 useless extension candidates. Maximal degree in co-relation 37287. Up to 11677 conditions per place. [2025-03-04 10:08:46,957 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 151 selfloop transitions, 5 changer transitions 0/191 dead transitions. [2025-03-04 10:08:46,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 191 transitions, 1213 flow [2025-03-04 10:08:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 344 transitions. [2025-03-04 10:08:46,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-03-04 10:08:46,959 INFO L175 Difference]: Start difference. First operand has 117 places, 124 transitions, 608 flow. Second operand 5 states and 344 transitions. [2025-03-04 10:08:46,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 191 transitions, 1213 flow [2025-03-04 10:08:46,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 191 transitions, 1191 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:46,989 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 615 flow [2025-03-04 10:08:46,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=615, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2025-03-04 10:08:46,990 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 31 predicate places. [2025-03-04 10:08:46,990 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 615 flow [2025-03-04 10:08:46,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:46,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:46,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:46,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:08:46,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:46,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247004, now seen corresponding path program 1 times [2025-03-04 10:08:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128091995] [2025-03-04 10:08:46,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:46,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:08:47,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:47,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:47,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:47,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128091995] [2025-03-04 10:08:47,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128091995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:47,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:47,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:08:47,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846175826] [2025-03-04 10:08:47,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:47,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:47,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:47,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:47,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:08:47,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 96 [2025-03-04 10:08:47,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 615 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:47,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:47,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 96 [2025-03-04 10:08:47,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:48,202 INFO L124 PetriNetUnfolderBase]: 13985/24953 cut-off events. [2025-03-04 10:08:48,202 INFO L125 PetriNetUnfolderBase]: For 25679/26627 co-relation queries the response was YES. [2025-03-04 10:08:48,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59499 conditions, 24953 events. 13985/24953 cut-off events. For 25679/26627 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 204696 event pairs, 9481 based on Foata normal form. 42/22404 useless extension candidates. Maximal degree in co-relation 43320. Up to 18967 conditions per place. [2025-03-04 10:08:48,342 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 79 selfloop transitions, 14 changer transitions 0/122 dead transitions. [2025-03-04 10:08:48,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 793 flow [2025-03-04 10:08:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-03-04 10:08:48,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229166666666667 [2025-03-04 10:08:48,345 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 615 flow. Second operand 5 states and 251 transitions. [2025-03-04 10:08:48,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 793 flow [2025-03-04 10:08:48,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 122 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:48,382 INFO L231 Difference]: Finished difference. Result has 119 places, 122 transitions, 630 flow [2025-03-04 10:08:48,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=630, PETRI_PLACES=119, PETRI_TRANSITIONS=122} [2025-03-04 10:08:48,382 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 29 predicate places. [2025-03-04 10:08:48,382 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 122 transitions, 630 flow [2025-03-04 10:08:48,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:48,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:48,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:48,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:08:48,383 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:48,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247003, now seen corresponding path program 1 times [2025-03-04 10:08:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330886409] [2025-03-04 10:08:48,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:48,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:48,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:08:48,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:48,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:48,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:48,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:48,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330886409] [2025-03-04 10:08:48,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330886409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:48,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721384264] [2025-03-04 10:08:48,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:48,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:48,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:48,514 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-04 10:08:48,515 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-04 10:08:48,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:08:48,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:48,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:48,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:48,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:08:48,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:48,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:08:48,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:48,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:08:48,632 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:08:48,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:08:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:48,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:48,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 10:08:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:48,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721384264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:48,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:48,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:08:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330842269] [2025-03-04 10:08:48,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:48,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:08:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:48,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:08:48,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:08:49,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 96 [2025-03-04 10:08:49,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 122 transitions, 630 flow. Second operand has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:49,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:49,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 96 [2025-03-04 10:08:49,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:51,589 INFO L124 PetriNetUnfolderBase]: 12790/22284 cut-off events. [2025-03-04 10:08:51,589 INFO L125 PetriNetUnfolderBase]: For 23400/24320 co-relation queries the response was YES. [2025-03-04 10:08:51,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53618 conditions, 22284 events. 12790/22284 cut-off events. For 23400/24320 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 176243 event pairs, 5906 based on Foata normal form. 126/19767 useless extension candidates. Maximal degree in co-relation 38920. Up to 6970 conditions per place. [2025-03-04 10:08:51,735 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 144 selfloop transitions, 34 changer transitions 0/207 dead transitions. [2025-03-04 10:08:51,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 207 transitions, 1268 flow [2025-03-04 10:08:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 536 transitions. [2025-03-04 10:08:51,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2025-03-04 10:08:51,736 INFO L175 Difference]: Start difference. First operand has 119 places, 122 transitions, 630 flow. Second operand 9 states and 536 transitions. [2025-03-04 10:08:51,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 207 transitions, 1268 flow [2025-03-04 10:08:51,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 207 transitions, 1244 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:08:51,786 INFO L231 Difference]: Finished difference. Result has 125 places, 126 transitions, 729 flow [2025-03-04 10:08:51,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=729, PETRI_PLACES=125, PETRI_TRANSITIONS=126} [2025-03-04 10:08:51,787 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 35 predicate places. [2025-03-04 10:08:51,787 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 126 transitions, 729 flow [2025-03-04 10:08:51,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:51,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:51,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:51,793 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-04 10:08:51,993 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,SelfDestructingSolverStorable15 [2025-03-04 10:08:51,993 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:51,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 891754301, now seen corresponding path program 1 times [2025-03-04 10:08:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633212525] [2025-03-04 10:08:51,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:52,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:08:52,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:52,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:52,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:52,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:52,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633212525] [2025-03-04 10:08:52,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633212525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:52,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:52,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:08:52,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756716954] [2025-03-04 10:08:52,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:52,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:52,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:52,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:52,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:52,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-04 10:08:52,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 126 transitions, 729 flow. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:52,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:52,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-04 10:08:52,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:53,414 INFO L124 PetriNetUnfolderBase]: 11025/18815 cut-off events. [2025-03-04 10:08:53,414 INFO L125 PetriNetUnfolderBase]: For 32811/33693 co-relation queries the response was YES. [2025-03-04 10:08:53,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49546 conditions, 18815 events. 11025/18815 cut-off events. For 32811/33693 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 139041 event pairs, 6940 based on Foata normal form. 204/16780 useless extension candidates. Maximal degree in co-relation 36853. Up to 9383 conditions per place. [2025-03-04 10:08:53,506 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 142 selfloop transitions, 17 changer transitions 0/190 dead transitions. [2025-03-04 10:08:53,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 190 transitions, 1419 flow [2025-03-04 10:08:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2025-03-04 10:08:53,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7041666666666667 [2025-03-04 10:08:53,507 INFO L175 Difference]: Start difference. First operand has 125 places, 126 transitions, 729 flow. Second operand 5 states and 338 transitions. [2025-03-04 10:08:53,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 190 transitions, 1419 flow [2025-03-04 10:08:53,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 190 transitions, 1341 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-04 10:08:53,533 INFO L231 Difference]: Finished difference. Result has 125 places, 130 transitions, 747 flow [2025-03-04 10:08:53,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=125, PETRI_TRANSITIONS=130} [2025-03-04 10:08:53,533 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 35 predicate places. [2025-03-04 10:08:53,533 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 130 transitions, 747 flow [2025-03-04 10:08:53,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:53,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:53,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:53,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:08:53,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:53,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash -317668275, now seen corresponding path program 1 times [2025-03-04 10:08:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:53,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636550306] [2025-03-04 10:08:53,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:53,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:53,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:08:53,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:53,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:53,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:53,652 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-04 10:08:53,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:53,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636550306] [2025-03-04 10:08:53,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636550306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:53,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257290297] [2025-03-04 10:08:53,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:53,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:53,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:53,655 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-04 10:08:53,656 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-04 10:08:53,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:08:53,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:53,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:53,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:53,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:08:53,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:53,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:08:53,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:53,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:08:53,758 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:08:53,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:08:53,802 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-04 10:08:53,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:53,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 10:08:53,923 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-04 10:08:53,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257290297] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:53,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:08:53,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612213521] [2025-03-04 10:08:53,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:53,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:08:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:53,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:08:53,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:08:54,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 96 [2025-03-04 10:08:54,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 130 transitions, 747 flow. Second operand has 13 states, 13 states have (on average 45.53846153846154) internal successors, (592), 13 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:54,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:54,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 96 [2025-03-04 10:08:54,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:56,047 INFO L124 PetriNetUnfolderBase]: 15968/26971 cut-off events. [2025-03-04 10:08:56,047 INFO L125 PetriNetUnfolderBase]: For 48524/51383 co-relation queries the response was YES. [2025-03-04 10:08:56,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71226 conditions, 26971 events. 15968/26971 cut-off events. For 48524/51383 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 207528 event pairs, 6623 based on Foata normal form. 216/23754 useless extension candidates. Maximal degree in co-relation 52878. Up to 8613 conditions per place. [2025-03-04 10:08:56,218 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 167 selfloop transitions, 34 changer transitions 0/229 dead transitions. [2025-03-04 10:08:56,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 229 transitions, 1611 flow [2025-03-04 10:08:56,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 527 transitions. [2025-03-04 10:08:56,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6099537037037037 [2025-03-04 10:08:56,220 INFO L175 Difference]: Start difference. First operand has 125 places, 130 transitions, 747 flow. Second operand 9 states and 527 transitions. [2025-03-04 10:08:56,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 229 transitions, 1611 flow [2025-03-04 10:08:56,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 229 transitions, 1589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:56,259 INFO L231 Difference]: Finished difference. Result has 132 places, 133 transitions, 832 flow [2025-03-04 10:08:56,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=832, PETRI_PLACES=132, PETRI_TRANSITIONS=133} [2025-03-04 10:08:56,260 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 42 predicate places. [2025-03-04 10:08:56,260 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 133 transitions, 832 flow [2025-03-04 10:08:56,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.53846153846154) internal successors, (592), 13 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:56,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:56,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:56,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:08:56,461 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,SelfDestructingSolverStorable17 [2025-03-04 10:08:56,461 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:56,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1257781295, now seen corresponding path program 1 times [2025-03-04 10:08:56,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:56,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606325637] [2025-03-04 10:08:56,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:56,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:08:56,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:08:56,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:56,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:08:56,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606325637] [2025-03-04 10:08:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606325637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:56,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:56,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:08:56,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360412602] [2025-03-04 10:08:56,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:56,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:56,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:56,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:56,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:08:56,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 96 [2025-03-04 10:08:56,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 133 transitions, 832 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:56,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:56,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 96 [2025-03-04 10:08:56,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:58,300 INFO L124 PetriNetUnfolderBase]: 15009/25728 cut-off events. [2025-03-04 10:08:58,300 INFO L125 PetriNetUnfolderBase]: For 55108/57270 co-relation queries the response was YES. [2025-03-04 10:08:58,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72045 conditions, 25728 events. 15009/25728 cut-off events. For 55108/57270 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 197628 event pairs, 10109 based on Foata normal form. 155/24586 useless extension candidates. Maximal degree in co-relation 51257. Up to 20259 conditions per place. [2025-03-04 10:08:58,495 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 90 selfloop transitions, 13 changer transitions 0/129 dead transitions. [2025-03-04 10:08:58,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 129 transitions, 1030 flow [2025-03-04 10:08:58,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-03-04 10:08:58,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5572916666666666 [2025-03-04 10:08:58,496 INFO L175 Difference]: Start difference. First operand has 132 places, 133 transitions, 832 flow. Second operand 4 states and 214 transitions. [2025-03-04 10:08:58,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 129 transitions, 1030 flow [2025-03-04 10:08:58,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 129 transitions, 968 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 10:08:58,550 INFO L231 Difference]: Finished difference. Result has 125 places, 129 transitions, 788 flow [2025-03-04 10:08:58,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=788, PETRI_PLACES=125, PETRI_TRANSITIONS=129} [2025-03-04 10:08:58,551 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 35 predicate places. [2025-03-04 10:08:58,551 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 129 transitions, 788 flow [2025-03-04 10:08:58,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:58,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:58,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:58,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:08:58,551 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:08:58,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:58,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1257781294, now seen corresponding path program 1 times [2025-03-04 10:08:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:58,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852433967] [2025-03-04 10:08:58,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:58,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:58,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:08:58,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:08:58,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:58,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:58,671 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-04 10:08:58,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:58,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852433967] [2025-03-04 10:08:58,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852433967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:58,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175196238] [2025-03-04 10:08:58,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:58,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:58,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:58,674 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-04 10:08:58,676 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-04 10:08:58,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:08:58,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:08:58,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:58,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:58,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:08:58,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:58,815 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-04 10:08:58,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:58,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:08:58,866 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-04 10:08:58,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175196238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:58,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:58,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:08:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035294019] [2025-03-04 10:08:58,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:58,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:08:58,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:58,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:08:58,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:08:59,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-04 10:08:59,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 129 transitions, 788 flow. Second operand has 11 states, 11 states have (on average 49.36363636363637) internal successors, (543), 11 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:59,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:59,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-04 10:08:59,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:00,832 INFO L124 PetriNetUnfolderBase]: 14581/23731 cut-off events. [2025-03-04 10:09:00,832 INFO L125 PetriNetUnfolderBase]: For 48519/50567 co-relation queries the response was YES. [2025-03-04 10:09:00,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67027 conditions, 23731 events. 14581/23731 cut-off events. For 48519/50567 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 169156 event pairs, 6597 based on Foata normal form. 163/22444 useless extension candidates. Maximal degree in co-relation 50256. Up to 7800 conditions per place. [2025-03-04 10:09:00,954 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 163 selfloop transitions, 34 changer transitions 0/222 dead transitions. [2025-03-04 10:09:00,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 222 transitions, 1654 flow [2025-03-04 10:09:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:09:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:09:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 461 transitions. [2025-03-04 10:09:00,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6860119047619048 [2025-03-04 10:09:00,956 INFO L175 Difference]: Start difference. First operand has 125 places, 129 transitions, 788 flow. Second operand 7 states and 461 transitions. [2025-03-04 10:09:00,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 222 transitions, 1654 flow [2025-03-04 10:09:00,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 222 transitions, 1640 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:00,993 INFO L231 Difference]: Finished difference. Result has 130 places, 129 transitions, 867 flow [2025-03-04 10:09:00,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=867, PETRI_PLACES=130, PETRI_TRANSITIONS=129} [2025-03-04 10:09:00,994 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 40 predicate places. [2025-03-04 10:09:00,994 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 129 transitions, 867 flow [2025-03-04 10:09:00,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.36363636363637) internal successors, (543), 11 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:00,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:00,994 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:01,000 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-04 10:09:01,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:01,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:09:01,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash 363698667, now seen corresponding path program 1 times [2025-03-04 10:09:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:01,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593731325] [2025-03-04 10:09:01,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:01,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:09:01,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:09:01,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:01,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:01,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:01,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593731325] [2025-03-04 10:09:01,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593731325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:01,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359849661] [2025-03-04 10:09:01,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:01,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:01,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:01,256 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-04 10:09:01,257 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-04 10:09:01,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:09:01,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:09:01,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:01,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:01,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:09:01,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:01,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:01,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359849661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:01,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:01,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-04 10:09:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719204927] [2025-03-04 10:09:01,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:01,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:09:01,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:01,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:09:01,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:09:01,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-04 10:09:01,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 129 transitions, 867 flow. Second operand has 16 states, 16 states have (on average 51.25) internal successors, (820), 16 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:01,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:01,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-04 10:09:01,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:05,015 INFO L124 PetriNetUnfolderBase]: 35078/59918 cut-off events. [2025-03-04 10:09:05,015 INFO L125 PetriNetUnfolderBase]: For 157946/161909 co-relation queries the response was YES. [2025-03-04 10:09:05,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175864 conditions, 59918 events. 35078/59918 cut-off events. For 157946/161909 co-relation queries the response was YES. Maximal size of possible extension queue 1805. Compared 523247 event pairs, 15893 based on Foata normal form. 853/57091 useless extension candidates. Maximal degree in co-relation 133529. Up to 10460 conditions per place. [2025-03-04 10:09:05,554 INFO L140 encePairwiseOnDemand]: 82/96 looper letters, 399 selfloop transitions, 80 changer transitions 0/506 dead transitions. [2025-03-04 10:09:05,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 506 transitions, 4065 flow [2025-03-04 10:09:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 10:09:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 10:09:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1750 transitions. [2025-03-04 10:09:05,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285919540229885 [2025-03-04 10:09:05,556 INFO L175 Difference]: Start difference. First operand has 130 places, 129 transitions, 867 flow. Second operand 29 states and 1750 transitions. [2025-03-04 10:09:05,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 506 transitions, 4065 flow [2025-03-04 10:09:05,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 506 transitions, 3899 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-04 10:09:05,782 INFO L231 Difference]: Finished difference. Result has 161 places, 186 transitions, 1488 flow [2025-03-04 10:09:05,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1488, PETRI_PLACES=161, PETRI_TRANSITIONS=186} [2025-03-04 10:09:05,783 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 71 predicate places. [2025-03-04 10:09:05,783 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 186 transitions, 1488 flow [2025-03-04 10:09:05,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.25) internal successors, (820), 16 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:05,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:05,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:05,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:05,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:09:05,987 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:09:05,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash -149183534, now seen corresponding path program 1 times [2025-03-04 10:09:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252216258] [2025-03-04 10:09:05,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:05,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:09:05,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:09:05,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:05,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:06,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252216258] [2025-03-04 10:09:06,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252216258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822698684] [2025-03-04 10:09:06,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:06,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:06,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:06,145 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:06,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:09:06,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:09:06,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:09:06,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:06,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:06,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:06,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:06,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:09:06,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:09:06,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:09:06,244 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:09:06,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:09:06,261 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:09:06,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 13 [2025-03-04 10:09:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:06,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:06,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-04 10:09:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:06,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822698684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:06,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:06,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2025-03-04 10:09:06,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396366476] [2025-03-04 10:09:06,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:06,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:09:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:06,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:09:06,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:09:07,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 96 [2025-03-04 10:09:07,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 186 transitions, 1488 flow. Second operand has 14 states, 14 states have (on average 40.714285714285715) internal successors, (570), 14 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:07,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:07,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 96 [2025-03-04 10:09:07,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:14,411 INFO L124 PetriNetUnfolderBase]: 64053/102049 cut-off events. [2025-03-04 10:09:14,411 INFO L125 PetriNetUnfolderBase]: For 322753/337073 co-relation queries the response was YES. [2025-03-04 10:09:14,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312316 conditions, 102049 events. 64053/102049 cut-off events. For 322753/337073 co-relation queries the response was YES. Maximal size of possible extension queue 2541. Compared 855445 event pairs, 24969 based on Foata normal form. 782/96657 useless extension candidates. Maximal degree in co-relation 245132. Up to 29850 conditions per place. [2025-03-04 10:09:15,479 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 289 selfloop transitions, 46 changer transitions 0/356 dead transitions. [2025-03-04 10:09:15,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 356 transitions, 3448 flow [2025-03-04 10:09:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:09:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:09:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 535 transitions. [2025-03-04 10:09:15,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5572916666666666 [2025-03-04 10:09:15,480 INFO L175 Difference]: Start difference. First operand has 161 places, 186 transitions, 1488 flow. Second operand 10 states and 535 transitions. [2025-03-04 10:09:15,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 356 transitions, 3448 flow [2025-03-04 10:09:15,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 356 transitions, 3355 flow, removed 36 selfloop flow, removed 3 redundant places. [2025-03-04 10:09:15,766 INFO L231 Difference]: Finished difference. Result has 168 places, 189 transitions, 1575 flow [2025-03-04 10:09:15,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1575, PETRI_PLACES=168, PETRI_TRANSITIONS=189} [2025-03-04 10:09:15,766 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 78 predicate places. [2025-03-04 10:09:15,766 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 189 transitions, 1575 flow [2025-03-04 10:09:15,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.714285714285715) internal successors, (570), 14 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:15,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:15,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:15,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:15,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:15,968 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:09:15,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash -329721598, now seen corresponding path program 1 times [2025-03-04 10:09:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802714897] [2025-03-04 10:09:15,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:15,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:09:15,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:09:15,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:15,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:16,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:16,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802714897] [2025-03-04 10:09:16,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802714897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:16,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576875880] [2025-03-04 10:09:16,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:16,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:16,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:16,057 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:16,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:09:16,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:09:16,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:09:16,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:16,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:16,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:09:16,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:16,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:16,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:09:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576875880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:16,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:16,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:09:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692391689] [2025-03-04 10:09:16,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:16,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:09:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:16,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:09:16,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:09:16,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-04 10:09:16,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 189 transitions, 1575 flow. Second operand has 11 states, 11 states have (on average 49.72727272727273) internal successors, (547), 11 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:16,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:16,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-04 10:09:16,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:22,444 INFO L124 PetriNetUnfolderBase]: 48370/78588 cut-off events. [2025-03-04 10:09:22,445 INFO L125 PetriNetUnfolderBase]: For 280622/293728 co-relation queries the response was YES. [2025-03-04 10:09:22,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252399 conditions, 78588 events. 48370/78588 cut-off events. For 280622/293728 co-relation queries the response was YES. Maximal size of possible extension queue 2145. Compared 660873 event pairs, 19961 based on Foata normal form. 930/77497 useless extension candidates. Maximal degree in co-relation 203784. Up to 28853 conditions per place. [2025-03-04 10:09:23,067 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 261 selfloop transitions, 46 changer transitions 0/332 dead transitions. [2025-03-04 10:09:23,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 332 transitions, 3335 flow [2025-03-04 10:09:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:09:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:09:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 459 transitions. [2025-03-04 10:09:23,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6830357142857143 [2025-03-04 10:09:23,068 INFO L175 Difference]: Start difference. First operand has 168 places, 189 transitions, 1575 flow. Second operand 7 states and 459 transitions. [2025-03-04 10:09:23,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 332 transitions, 3335 flow [2025-03-04 10:09:23,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 332 transitions, 3256 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 10:09:23,383 INFO L231 Difference]: Finished difference. Result has 170 places, 189 transitions, 1614 flow [2025-03-04 10:09:23,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1614, PETRI_PLACES=170, PETRI_TRANSITIONS=189} [2025-03-04 10:09:23,384 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 80 predicate places. [2025-03-04 10:09:23,384 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 189 transitions, 1614 flow [2025-03-04 10:09:23,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.72727272727273) internal successors, (547), 11 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:23,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:23,384 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:23,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:09:23,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:09:23,585 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:09:23,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1267201100, now seen corresponding path program 1 times [2025-03-04 10:09:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069362370] [2025-03-04 10:09:23,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:23,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:09:23,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:09:23,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:23,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:23,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069362370] [2025-03-04 10:09:23,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069362370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:23,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507121177] [2025-03-04 10:09:23,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:23,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:23,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:23,647 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:23,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:09:23,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:09:23,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:09:23,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:23,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:23,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:09:23,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:23,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:23,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507121177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:23,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:23,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-04 10:09:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4138420] [2025-03-04 10:09:23,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:23,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:09:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:23,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:09:23,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:09:24,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-04 10:09:24,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 189 transitions, 1614 flow. Second operand has 16 states, 16 states have (on average 51.4375) internal successors, (823), 16 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:24,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:24,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-04 10:09:24,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand