./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-simple-array-sum.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/popl20-simple-array-sum.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 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:16:04,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:16:04,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:16:04,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:16:04,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:16:04,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:16:04,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:16:04,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:16:04,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:16:04,982 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:16:04,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:16:04,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:16:04,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:16:04,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:16:04,983 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:16:04,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:16:04,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:16:04,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:16:04,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:16:04,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:16:04,983 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:16:04,983 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:16:04,984 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:16:04,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:16:04,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:16:04,984 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:16:04,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:16:04,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:16:04,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:16:04,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:16:04,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:16:04,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:16:04,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:16:04,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:16:04,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:16:04,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:16:04,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:16:04,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:16:04,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:16:04,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:16:04,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:16:04,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:16:04,986 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 -> 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 [2025-03-04 10:16:05,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:16:05,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:16:05,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:16:05,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:16:05,246 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:16:05,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-03-04 10:16:06,449 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8adf60e81/6a97a59f27ee457798535162ac7193bc/FLAGd0688b322 [2025-03-04 10:16:06,677 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:16:06,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-03-04 10:16:06,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8adf60e81/6a97a59f27ee457798535162ac7193bc/FLAGd0688b322 [2025-03-04 10:16:06,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8adf60e81/6a97a59f27ee457798535162ac7193bc [2025-03-04 10:16:06,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:16:06,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:16:06,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:16:06,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:16:06,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:16:06,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4481a9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06, skipping insertion in model container [2025-03-04 10:16:06,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:16:06,895 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:16:06,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:16:06,904 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:16:06,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:16:06,927 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:16:06,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06 WrapperNode [2025-03-04 10:16:06,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:16:06,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:16:06,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:16:06,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:16:06,933 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:16:06" (1/1) ... [2025-03-04 10:16:06,940 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:16:06" (1/1) ... [2025-03-04 10:16:06,952 INFO L138 Inliner]: procedures = 23, calls = 21, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 105 [2025-03-04 10:16:06,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:16:06,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:16:06,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:16:06,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:16:06,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,979 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 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:16:06,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:06,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:16:06,996 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:16:06,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:16:06,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:16:06,997 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (1/1) ... [2025-03-04 10:16:07,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:16:07,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:07,028 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:16:07,031 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:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:16:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:16:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:16:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:16:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:16:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:16:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:16:07,049 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:16:07,127 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:16:07,128 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:16:07,379 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:16:07,379 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:16:07,534 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:16:07,535 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:16:07,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:16:07 BoogieIcfgContainer [2025-03-04 10:16:07,535 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:16:07,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:16:07,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:16:07,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:16:07,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:16:06" (1/3) ... [2025-03-04 10:16:07,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366281fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:16:07, skipping insertion in model container [2025-03-04 10:16:07,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:16:06" (2/3) ... [2025-03-04 10:16:07,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366281fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:16:07, skipping insertion in model container [2025-03-04 10:16:07,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:16:07" (3/3) ... [2025-03-04 10:16:07,545 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-03-04 10:16:07,558 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:16:07,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-array-sum.wvr.c that has 4 procedures, 52 locations, 1 initial locations, 5 loop locations, and 14 error locations. [2025-03-04 10:16:07,560 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:16:07,618 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:16:07,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 57 transitions, 135 flow [2025-03-04 10:16:07,669 INFO L124 PetriNetUnfolderBase]: 6/54 cut-off events. [2025-03-04 10:16:07,670 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:16:07,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 54 events. 6/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 121 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 38. Up to 3 conditions per place. [2025-03-04 10:16:07,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 57 transitions, 135 flow [2025-03-04 10:16:07,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 53 transitions, 124 flow [2025-03-04 10:16:07,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:16:07,697 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;@153e9181, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:16:07,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 10:16:07,701 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:16:07,701 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:16:07,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:16:07,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:07,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:16:07,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:07,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash 440642, now seen corresponding path program 1 times [2025-03-04 10:16:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:07,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730119621] [2025-03-04 10:16:07,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:07,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:07,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:16:07,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:16:07,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:07,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:07,905 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:16:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730119621] [2025-03-04 10:16:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730119621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:07,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:07,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:16:07,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693041876] [2025-03-04 10:16:07,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:07,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:16:07,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:07,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:16:07,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:16:07,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2025-03-04 10:16:07,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:16:07,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:07,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2025-03-04 10:16:07,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:08,429 INFO L124 PetriNetUnfolderBase]: 2574/3856 cut-off events. [2025-03-04 10:16:08,430 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2025-03-04 10:16:08,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7631 conditions, 3856 events. 2574/3856 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 21833 event pairs, 2104 based on Foata normal form. 1/2721 useless extension candidates. Maximal degree in co-relation 7075. Up to 3553 conditions per place. [2025-03-04 10:16:08,464 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 38 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-03-04 10:16:08,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 196 flow [2025-03-04 10:16:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:16:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:16:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-04 10:16:08,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47953216374269003 [2025-03-04 10:16:08,480 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 124 flow. Second operand 3 states and 82 transitions. [2025-03-04 10:16:08,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 196 flow [2025-03-04 10:16:08,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:16:08,493 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 108 flow [2025-03-04 10:16:08,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-03-04 10:16:08,498 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2025-03-04 10:16:08,499 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 108 flow [2025-03-04 10:16:08,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:16:08,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:08,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:16:08,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:16:08,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:08,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash 440643, now seen corresponding path program 1 times [2025-03-04 10:16:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978299170] [2025-03-04 10:16:08,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:08,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:16:08,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:16:08,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:08,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:08,735 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:16:08,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:08,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978299170] [2025-03-04 10:16:08,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978299170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:08,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:08,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:16:08,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896045933] [2025-03-04 10:16:08,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:08,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:16:08,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:08,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:16:08,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:16:08,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2025-03-04 10:16:08,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:16:08,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:08,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2025-03-04 10:16:08,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:09,041 INFO L124 PetriNetUnfolderBase]: 2575/3859 cut-off events. [2025-03-04 10:16:09,041 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 10:16:09,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7494 conditions, 3859 events. 2575/3859 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 21809 event pairs, 2104 based on Foata normal form. 0/2721 useless extension candidates. Maximal degree in co-relation 7465. Up to 3562 conditions per place. [2025-03-04 10:16:09,066 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 41 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2025-03-04 10:16:09,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 204 flow [2025-03-04 10:16:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:16:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:16:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-04 10:16:09,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2025-03-04 10:16:09,071 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 108 flow. Second operand 4 states and 98 transitions. [2025-03-04 10:16:09,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 204 flow [2025-03-04 10:16:09,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:16:09,074 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 131 flow [2025-03-04 10:16:09,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2025-03-04 10:16:09,075 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2025-03-04 10:16:09,075 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 131 flow [2025-03-04 10:16:09,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:16:09,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:09,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:16:09,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:16:09,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:09,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash 13660567, now seen corresponding path program 1 times [2025-03-04 10:16:09,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:09,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872369020] [2025-03-04 10:16:09,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:09,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:16:09,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:16:09,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:09,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:09,195 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:16:09,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:09,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872369020] [2025-03-04 10:16:09,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872369020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:09,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:09,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:16:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842565881] [2025-03-04 10:16:09,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:09,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:16:09,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:09,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:16:09,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:16:09,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 10:16:09,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:09,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:09,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 10:16:09,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:09,507 INFO L124 PetriNetUnfolderBase]: 2576/3864 cut-off events. [2025-03-04 10:16:09,508 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 10:16:09,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7512 conditions, 3864 events. 2576/3864 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 21830 event pairs, 2104 based on Foata normal form. 0/2727 useless extension candidates. Maximal degree in co-relation 7474. Up to 3561 conditions per place. [2025-03-04 10:16:09,530 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 40 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-03-04 10:16:09,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 233 flow [2025-03-04 10:16:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:16:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:16:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-04 10:16:09,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-03-04 10:16:09,533 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 131 flow. Second operand 4 states and 108 transitions. [2025-03-04 10:16:09,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 233 flow [2025-03-04 10:16:09,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:16:09,535 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 162 flow [2025-03-04 10:16:09,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-03-04 10:16:09,536 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2025-03-04 10:16:09,536 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 162 flow [2025-03-04 10:16:09,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:09,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:09,536 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:16:09,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:16:09,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:09,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash 423471882, now seen corresponding path program 1 times [2025-03-04 10:16:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:09,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255563802] [2025-03-04 10:16:09,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:09,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:16:09,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:16:09,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:09,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:09,742 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:16:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255563802] [2025-03-04 10:16:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255563802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798168324] [2025-03-04 10:16:09,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:09,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:09,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:09,745 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:16:09,746 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:16:09,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:16:09,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:16:09,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:09,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:09,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:16:09,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:09,865 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:16:10,057 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:16:10,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:10,136 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:16:10,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798168324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:10,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:10,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:16:10,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049416199] [2025-03-04 10:16:10,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:10,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:16:10,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:10,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:16:10,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:16:10,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2025-03-04 10:16:10,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 162 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 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:16:10,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:10,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2025-03-04 10:16:10,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:10,524 INFO L124 PetriNetUnfolderBase]: 2577/3866 cut-off events. [2025-03-04 10:16:10,525 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 10:16:10,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7538 conditions, 3866 events. 2577/3866 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 21876 event pairs, 2104 based on Foata normal form. 0/2732 useless extension candidates. Maximal degree in co-relation 7478. Up to 3562 conditions per place. [2025-03-04 10:16:10,551 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 39 selfloop transitions, 11 changer transitions 0/57 dead transitions. [2025-03-04 10:16:10,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 273 flow [2025-03-04 10:16:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:16:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:16:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2025-03-04 10:16:10,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3235867446393762 [2025-03-04 10:16:10,554 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 162 flow. Second operand 9 states and 166 transitions. [2025-03-04 10:16:10,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 273 flow [2025-03-04 10:16:10,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:16:10,556 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 195 flow [2025-03-04 10:16:10,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=195, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-03-04 10:16:10,557 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2025-03-04 10:16:10,558 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 195 flow [2025-03-04 10:16:10,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 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:16:10,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:10,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:16:10,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:10,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:10,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:10,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:10,762 INFO L85 PathProgramCache]: Analyzing trace with hash 242727088, now seen corresponding path program 1 times [2025-03-04 10:16:10,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:10,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626884636] [2025-03-04 10:16:10,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:10,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:16:10,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:16:10,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:10,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:10,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:10,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626884636] [2025-03-04 10:16:10,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626884636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:10,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744411117] [2025-03-04 10:16:10,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:10,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:10,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:10,940 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:16:10,941 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:16:10,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:16:10,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:16:10,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:10,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:10,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:16:10,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:11,000 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:16:11,085 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:16:11,085 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 32 treesize of output 27 [2025-03-04 10:16:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:11,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:11,168 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:16:11,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744411117] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:11,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:16:11,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-03-04 10:16:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236734919] [2025-03-04 10:16:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:11,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:11,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:11,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:11,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:16:11,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2025-03-04 10:16:11,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:16:11,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:11,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2025-03-04 10:16:11,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:11,621 INFO L124 PetriNetUnfolderBase]: 5148/7712 cut-off events. [2025-03-04 10:16:11,622 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-03-04 10:16:11,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15013 conditions, 7712 events. 5148/7712 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 48446 event pairs, 4208 based on Foata normal form. 1/5467 useless extension candidates. Maximal degree in co-relation 7511. Up to 3562 conditions per place. [2025-03-04 10:16:11,649 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 77 selfloop transitions, 7 changer transitions 0/91 dead transitions. [2025-03-04 10:16:11,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 439 flow [2025-03-04 10:16:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:16:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:16:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-03-04 10:16:11,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5157894736842106 [2025-03-04 10:16:11,651 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 195 flow. Second operand 5 states and 147 transitions. [2025-03-04 10:16:11,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 439 flow [2025-03-04 10:16:11,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 396 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-04 10:16:11,653 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 172 flow [2025-03-04 10:16:11,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-03-04 10:16:11,653 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2025-03-04 10:16:11,653 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 172 flow [2025-03-04 10:16:11,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:16:11,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:11,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:11,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:11,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:11,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:11,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1057525552, now seen corresponding path program 1 times [2025-03-04 10:16:11,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:11,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961845936] [2025-03-04 10:16:11,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:11,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:11,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:16:11,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:16:11,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:11,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:11,915 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:16:11,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:11,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961845936] [2025-03-04 10:16:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961845936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:11,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:16:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855994142] [2025-03-04 10:16:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:11,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:11,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:11,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:16:11,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:11,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:16:11,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:11,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:11,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:12,317 INFO L124 PetriNetUnfolderBase]: 5351/8119 cut-off events. [2025-03-04 10:16:12,317 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-04 10:16:12,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15876 conditions, 8119 events. 5351/8119 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 50705 event pairs, 3820 based on Foata normal form. 0/5885 useless extension candidates. Maximal degree in co-relation 8644. Up to 4115 conditions per place. [2025-03-04 10:16:12,344 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 92 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2025-03-04 10:16:12,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 109 transitions, 490 flow [2025-03-04 10:16:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:16:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:16:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2025-03-04 10:16:12,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5380116959064327 [2025-03-04 10:16:12,345 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 172 flow. Second operand 6 states and 184 transitions. [2025-03-04 10:16:12,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 109 transitions, 490 flow [2025-03-04 10:16:12,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 109 transitions, 473 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:16:12,347 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 191 flow [2025-03-04 10:16:12,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2025-03-04 10:16:12,348 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2025-03-04 10:16:12,348 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 191 flow [2025-03-04 10:16:12,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:16:12,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:12,348 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:12,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:16:12,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:12,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:12,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1332510990, now seen corresponding path program 1 times [2025-03-04 10:16:12,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:12,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243168097] [2025-03-04 10:16:12,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:12,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:12,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:16:12,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:16:12,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:12,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:16:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243168097] [2025-03-04 10:16:12,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243168097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594579074] [2025-03-04 10:16:12,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:12,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:12,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:12,428 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:16:12,430 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:16:12,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:16:12,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:16:12,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:12,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:12,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:16:12,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:16:12,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:16:12,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594579074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:12,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:12,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:16:12,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487014714] [2025-03-04 10:16:12,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:12,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:16:12,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:12,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:16:12,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:16:12,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 10:16:12,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 191 flow. Second operand has 13 states, 13 states have (on average 16.53846153846154) internal successors, (215), 13 states have internal predecessors, (215), 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:16:12,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:12,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 10:16:12,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:13,244 INFO L124 PetriNetUnfolderBase]: 6287/9471 cut-off events. [2025-03-04 10:16:13,244 INFO L125 PetriNetUnfolderBase]: For 1687/1888 co-relation queries the response was YES. [2025-03-04 10:16:13,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19915 conditions, 9471 events. 6287/9471 cut-off events. For 1687/1888 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 59869 event pairs, 5244 based on Foata normal form. 1/6809 useless extension candidates. Maximal degree in co-relation 7814. Up to 5283 conditions per place. [2025-03-04 10:16:13,288 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 74 selfloop transitions, 18 changer transitions 0/100 dead transitions. [2025-03-04 10:16:13,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 492 flow [2025-03-04 10:16:13,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:16:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:16:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2025-03-04 10:16:13,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4405458089668616 [2025-03-04 10:16:13,291 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 191 flow. Second operand 9 states and 226 transitions. [2025-03-04 10:16:13,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 492 flow [2025-03-04 10:16:13,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 475 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:16:13,296 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 259 flow [2025-03-04 10:16:13,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-03-04 10:16:13,297 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2025-03-04 10:16:13,297 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 259 flow [2025-03-04 10:16:13,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.53846153846154) internal successors, (215), 13 states have internal predecessors, (215), 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:16:13,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:13,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:13,309 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:16:13,498 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:16:13,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:13,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1583711494, now seen corresponding path program 1 times [2025-03-04 10:16:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:13,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330006350] [2025-03-04 10:16:13,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:13,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:16:13,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:16:13,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:13,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:13,584 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:16:13,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:13,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330006350] [2025-03-04 10:16:13,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330006350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:13,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:13,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:16:13,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439781905] [2025-03-04 10:16:13,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:13,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:13,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:13,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:16:13,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:13,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:13,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:13,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:13,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:14,067 INFO L124 PetriNetUnfolderBase]: 5983/9001 cut-off events. [2025-03-04 10:16:14,068 INFO L125 PetriNetUnfolderBase]: For 1179/1531 co-relation queries the response was YES. [2025-03-04 10:16:14,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18460 conditions, 9001 events. 5983/9001 cut-off events. For 1179/1531 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 54356 event pairs, 4818 based on Foata normal form. 0/6344 useless extension candidates. Maximal degree in co-relation 8586. Up to 7819 conditions per place. [2025-03-04 10:16:14,105 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 79 selfloop transitions, 12 changer transitions 0/98 dead transitions. [2025-03-04 10:16:14,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 98 transitions, 529 flow [2025-03-04 10:16:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:16:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:16:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2025-03-04 10:16:14,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48830409356725146 [2025-03-04 10:16:14,107 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 259 flow. Second operand 6 states and 167 transitions. [2025-03-04 10:16:14,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 98 transitions, 529 flow [2025-03-04 10:16:14,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 497 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 10:16:14,109 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 268 flow [2025-03-04 10:16:14,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2025-03-04 10:16:14,110 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2025-03-04 10:16:14,110 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 268 flow [2025-03-04 10:16:14,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:14,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:14,110 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:16:14,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:16:14,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:14,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash 460886951, now seen corresponding path program 2 times [2025-03-04 10:16:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:14,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903763376] [2025-03-04 10:16:14,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:14,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 10:16:14,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:16:14,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:14,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:16:14,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:14,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903763376] [2025-03-04 10:16:14,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903763376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:14,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14832882] [2025-03-04 10:16:14,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:14,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:14,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:14,279 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:16:14,281 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:16:14,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 10:16:14,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:16:14,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:14,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:14,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:16:14,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:14,390 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:16:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:16:14,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:16:14,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14832882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:14,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:14,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 13 [2025-03-04 10:16:14,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848872157] [2025-03-04 10:16:14,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:14,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:16:14,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:14,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:16:14,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:16:14,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2025-03-04 10:16:14,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 268 flow. Second operand has 15 states, 15 states have (on average 14.733333333333333) internal successors, (221), 15 states have internal predecessors, (221), 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:16:14,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:14,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2025-03-04 10:16:14,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:15,273 INFO L124 PetriNetUnfolderBase]: 5329/8079 cut-off events. [2025-03-04 10:16:15,273 INFO L125 PetriNetUnfolderBase]: For 1629/1947 co-relation queries the response was YES. [2025-03-04 10:16:15,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17574 conditions, 8079 events. 5329/8079 cut-off events. For 1629/1947 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 51585 event pairs, 4488 based on Foata normal form. 2/5983 useless extension candidates. Maximal degree in co-relation 8026. Up to 7590 conditions per place. [2025-03-04 10:16:15,302 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 38 selfloop transitions, 22 changer transitions 0/67 dead transitions. [2025-03-04 10:16:15,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 67 transitions, 391 flow [2025-03-04 10:16:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:16:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:16:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2025-03-04 10:16:15,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3458646616541353 [2025-03-04 10:16:15,304 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 268 flow. Second operand 7 states and 138 transitions. [2025-03-04 10:16:15,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 67 transitions, 391 flow [2025-03-04 10:16:15,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 67 transitions, 368 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:16:15,308 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 292 flow [2025-03-04 10:16:15,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2025-03-04 10:16:15,309 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2025-03-04 10:16:15,309 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 292 flow [2025-03-04 10:16:15,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.733333333333333) internal successors, (221), 15 states have internal predecessors, (221), 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:16:15,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:15,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:15,315 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:16:15,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:15,514 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:15,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1545397767, now seen corresponding path program 1 times [2025-03-04 10:16:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:15,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464133510] [2025-03-04 10:16:15,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:15,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:16:15,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:16:15,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:15,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:15,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:15,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464133510] [2025-03-04 10:16:15,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464133510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:15,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343356963] [2025-03-04 10:16:15,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:15,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:15,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:15,669 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:16:15,671 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:16:15,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:16:15,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:16:15,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:15,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:15,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:16:15,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:15,728 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:16:15,732 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:16:15,776 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:16:15,777 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:16:15,795 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 31 treesize of output 24 [2025-03-04 10:16:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:15,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343356963] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:16,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:16:16,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2025-03-04 10:16:16,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776897873] [2025-03-04 10:16:16,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:16,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:16:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:16,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:16:16,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:16:16,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 10:16:16,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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:16:16,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:16,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 10:16:16,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:16,990 INFO L124 PetriNetUnfolderBase]: 7337/10887 cut-off events. [2025-03-04 10:16:16,990 INFO L125 PetriNetUnfolderBase]: For 2087/2849 co-relation queries the response was YES. [2025-03-04 10:16:17,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23375 conditions, 10887 events. 7337/10887 cut-off events. For 2087/2849 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 68210 event pairs, 3380 based on Foata normal form. 0/7860 useless extension candidates. Maximal degree in co-relation 10917. Up to 5997 conditions per place. [2025-03-04 10:16:17,034 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 86 selfloop transitions, 16 changer transitions 0/109 dead transitions. [2025-03-04 10:16:17,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 109 transitions, 594 flow [2025-03-04 10:16:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:16:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:16:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions. [2025-03-04 10:16:17,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48872180451127817 [2025-03-04 10:16:17,036 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 292 flow. Second operand 7 states and 195 transitions. [2025-03-04 10:16:17,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 109 transitions, 594 flow [2025-03-04 10:16:17,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 109 transitions, 587 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:16:17,039 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 340 flow [2025-03-04 10:16:17,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2025-03-04 10:16:17,040 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2025-03-04 10:16:17,040 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 340 flow [2025-03-04 10:16:17,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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:16:17,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:17,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:17,045 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:16:17,241 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,SelfDestructingSolverStorable9 [2025-03-04 10:16:17,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:17,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1545397768, now seen corresponding path program 1 times [2025-03-04 10:16:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325238820] [2025-03-04 10:16:17,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:17,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:16:17,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:16:17,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:17,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:17,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:17,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325238820] [2025-03-04 10:16:17,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325238820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:17,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:17,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:16:17,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929631448] [2025-03-04 10:16:17,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:17,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:17,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:17,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:17,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:16:17,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2025-03-04 10:16:17,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:17,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:17,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2025-03-04 10:16:17,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:17,634 INFO L124 PetriNetUnfolderBase]: 5133/7763 cut-off events. [2025-03-04 10:16:17,634 INFO L125 PetriNetUnfolderBase]: For 7241/7761 co-relation queries the response was YES. [2025-03-04 10:16:17,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20366 conditions, 7763 events. 5133/7763 cut-off events. For 7241/7761 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 47322 event pairs, 4050 based on Foata normal form. 580/7146 useless extension candidates. Maximal degree in co-relation 10893. Up to 7180 conditions per place. [2025-03-04 10:16:17,668 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 50 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2025-03-04 10:16:17,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 67 transitions, 456 flow [2025-03-04 10:16:17,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:16:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:16:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-03-04 10:16:17,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2025-03-04 10:16:17,669 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 340 flow. Second operand 5 states and 105 transitions. [2025-03-04 10:16:17,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 67 transitions, 456 flow [2025-03-04 10:16:17,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 67 transitions, 433 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 10:16:17,675 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 333 flow [2025-03-04 10:16:17,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2025-03-04 10:16:17,676 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2025-03-04 10:16:17,676 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 333 flow [2025-03-04 10:16:17,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:17,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:17,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:17,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:16:17,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:17,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:17,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1332472069, now seen corresponding path program 1 times [2025-03-04 10:16:17,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:17,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638376746] [2025-03-04 10:16:17,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:17,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:17,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:16:17,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:16:17,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:17,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:17,713 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:16:17,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:17,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638376746] [2025-03-04 10:16:17,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638376746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:17,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:17,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:16:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468163734] [2025-03-04 10:16:17,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:17,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:16:17,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:17,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:16:17,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:16:17,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:17,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 333 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:16:17,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:17,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:17,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:18,187 INFO L124 PetriNetUnfolderBase]: 7019/10459 cut-off events. [2025-03-04 10:16:18,187 INFO L125 PetriNetUnfolderBase]: For 8921/9867 co-relation queries the response was YES. [2025-03-04 10:16:18,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26658 conditions, 10459 events. 7019/10459 cut-off events. For 8921/9867 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 59717 event pairs, 1562 based on Foata normal form. 232/9267 useless extension candidates. Maximal degree in co-relation 13651. Up to 6763 conditions per place. [2025-03-04 10:16:18,219 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 102 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2025-03-04 10:16:18,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 713 flow [2025-03-04 10:16:18,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:16:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:16:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-03-04 10:16:18,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 10:16:18,220 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 333 flow. Second operand 4 states and 133 transitions. [2025-03-04 10:16:18,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 713 flow [2025-03-04 10:16:18,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 699 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:16:18,223 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 344 flow [2025-03-04 10:16:18,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2025-03-04 10:16:18,224 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2025-03-04 10:16:18,224 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 344 flow [2025-03-04 10:16:18,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:16:18,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:18,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:18,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:16:18,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:18,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash 889948144, now seen corresponding path program 1 times [2025-03-04 10:16:18,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:18,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63243166] [2025-03-04 10:16:18,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:18,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:18,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:16:18,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:16:18,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:18,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:18,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63243166] [2025-03-04 10:16:18,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63243166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641057710] [2025-03-04 10:16:18,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:18,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:18,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:18,359 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:16:18,361 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:16:18,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:16:18,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:16:18,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:18,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:18,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:16:18,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:18,425 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:16:18,429 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:16:18,460 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:16:18,460 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:16:18,477 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 31 treesize of output 24 [2025-03-04 10:16:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:18,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:18,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641057710] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:18,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:16:18,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2025-03-04 10:16:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41138146] [2025-03-04 10:16:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:18,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:16:18,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:18,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:16:18,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:16:18,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 10:16:18,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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:16:18,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:18,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 10:16:18,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:19,430 INFO L124 PetriNetUnfolderBase]: 6077/9233 cut-off events. [2025-03-04 10:16:19,430 INFO L125 PetriNetUnfolderBase]: For 8955/9743 co-relation queries the response was YES. [2025-03-04 10:16:19,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24803 conditions, 9233 events. 6077/9233 cut-off events. For 8955/9743 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 55792 event pairs, 1786 based on Foata normal form. 0/7978 useless extension candidates. Maximal degree in co-relation 12740. Up to 5432 conditions per place. [2025-03-04 10:16:19,474 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 80 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2025-03-04 10:16:19,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 103 transitions, 648 flow [2025-03-04 10:16:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:16:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:16:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2025-03-04 10:16:19,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45363408521303256 [2025-03-04 10:16:19,476 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 344 flow. Second operand 7 states and 181 transitions. [2025-03-04 10:16:19,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 103 transitions, 648 flow [2025-03-04 10:16:19,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 103 transitions, 648 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:16:19,482 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 399 flow [2025-03-04 10:16:19,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=399, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2025-03-04 10:16:19,482 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2025-03-04 10:16:19,482 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 399 flow [2025-03-04 10:16:19,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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:16:19,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:19,483 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:19,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:19,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:19,687 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:19,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1189975242, now seen corresponding path program 1 times [2025-03-04 10:16:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:19,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023912076] [2025-03-04 10:16:19,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:19,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:16:19,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:16:19,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:19,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:19,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023912076] [2025-03-04 10:16:19,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023912076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496808202] [2025-03-04 10:16:19,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:19,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:19,750 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:16:19,752 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:16:19,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:16:19,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:16:19,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:19,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:19,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:16:19,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:19,846 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:16:19,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:19,883 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:16:19,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496808202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:19,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:19,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:16:19,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957197354] [2025-03-04 10:16:19,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:19,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:16:19,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:19,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:16:19,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:16:19,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:19,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 72 transitions, 399 flow. Second operand has 14 states, 14 states have (on average 16.214285714285715) internal successors, (227), 14 states have internal predecessors, (227), 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:16:19,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:19,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:19,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:20,595 INFO L124 PetriNetUnfolderBase]: 6763/10256 cut-off events. [2025-03-04 10:16:20,595 INFO L125 PetriNetUnfolderBase]: For 10958/11091 co-relation queries the response was YES. [2025-03-04 10:16:20,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29121 conditions, 10256 events. 6763/10256 cut-off events. For 10958/11091 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 59652 event pairs, 4146 based on Foata normal form. 186/9218 useless extension candidates. Maximal degree in co-relation 16337. Up to 5392 conditions per place. [2025-03-04 10:16:20,631 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 134 selfloop transitions, 24 changer transitions 0/164 dead transitions. [2025-03-04 10:16:20,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 164 transitions, 1069 flow [2025-03-04 10:16:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:16:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:16:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 270 transitions. [2025-03-04 10:16:20,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-03-04 10:16:20,632 INFO L175 Difference]: Start difference. First operand has 90 places, 72 transitions, 399 flow. Second operand 10 states and 270 transitions. [2025-03-04 10:16:20,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 164 transitions, 1069 flow [2025-03-04 10:16:20,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 164 transitions, 1033 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 10:16:20,640 INFO L231 Difference]: Finished difference. Result has 97 places, 76 transitions, 472 flow [2025-03-04 10:16:20,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=472, PETRI_PLACES=97, PETRI_TRANSITIONS=76} [2025-03-04 10:16:20,640 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 40 predicate places. [2025-03-04 10:16:20,640 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 76 transitions, 472 flow [2025-03-04 10:16:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.214285714285715) internal successors, (227), 14 states have internal predecessors, (227), 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:16:20,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:20,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:20,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:16:20,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:20,842 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:20,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:20,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1818589155, now seen corresponding path program 1 times [2025-03-04 10:16:20,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:20,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991803306] [2025-03-04 10:16:20,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:20,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:16:20,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:16:20,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:20,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:20,881 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:16:20,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:20,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991803306] [2025-03-04 10:16:20,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991803306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:20,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:16:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490876446] [2025-03-04 10:16:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:20,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:16:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:20,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:16:20,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:16:20,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2025-03-04 10:16:20,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 76 transitions, 472 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:16:20,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:20,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2025-03-04 10:16:20,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:21,225 INFO L124 PetriNetUnfolderBase]: 4311/6736 cut-off events. [2025-03-04 10:16:21,225 INFO L125 PetriNetUnfolderBase]: For 13911/14416 co-relation queries the response was YES. [2025-03-04 10:16:21,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21616 conditions, 6736 events. 4311/6736 cut-off events. For 13911/14416 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 38302 event pairs, 3330 based on Foata normal form. 0/6274 useless extension candidates. Maximal degree in co-relation 11319. Up to 6152 conditions per place. [2025-03-04 10:16:21,262 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 60 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2025-03-04 10:16:21,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 74 transitions, 602 flow [2025-03-04 10:16:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:16:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:16:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-03-04 10:16:21,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2025-03-04 10:16:21,263 INFO L175 Difference]: Start difference. First operand has 97 places, 76 transitions, 472 flow. Second operand 4 states and 90 transitions. [2025-03-04 10:16:21,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 74 transitions, 602 flow [2025-03-04 10:16:21,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 74 transitions, 567 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 10:16:21,274 INFO L231 Difference]: Finished difference. Result has 92 places, 74 transitions, 447 flow [2025-03-04 10:16:21,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=447, PETRI_PLACES=92, PETRI_TRANSITIONS=74} [2025-03-04 10:16:21,274 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 35 predicate places. [2025-03-04 10:16:21,274 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 74 transitions, 447 flow [2025-03-04 10:16:21,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:16:21,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:21,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:21,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:16:21,274 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:21,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1818589156, now seen corresponding path program 1 times [2025-03-04 10:16:21,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:21,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030651019] [2025-03-04 10:16:21,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:21,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:16:21,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:16:21,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:21,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:21,403 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:16:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030651019] [2025-03-04 10:16:21,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030651019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296304125] [2025-03-04 10:16:21,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:21,405 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:16:21,407 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:16:21,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:16:21,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:16:21,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:21,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:21,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:16:21,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:21,462 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:16:21,509 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:16:21,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:21,557 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:16:21,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296304125] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:21,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:16:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-04 10:16:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016421225] [2025-03-04 10:16:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:21,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:16:21,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:21,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:16:21,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:16:21,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 10:16:21,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 74 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:21,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:21,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 10:16:21,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:21,975 INFO L124 PetriNetUnfolderBase]: 4130/6416 cut-off events. [2025-03-04 10:16:21,975 INFO L125 PetriNetUnfolderBase]: For 12813/13403 co-relation queries the response was YES. [2025-03-04 10:16:21,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20235 conditions, 6416 events. 4130/6416 cut-off events. For 12813/13403 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 35861 event pairs, 1962 based on Foata normal form. 0/6064 useless extension candidates. Maximal degree in co-relation 10812. Up to 3487 conditions per place. [2025-03-04 10:16:22,005 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 86 selfloop transitions, 16 changer transitions 0/109 dead transitions. [2025-03-04 10:16:22,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 109 transitions, 803 flow [2025-03-04 10:16:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:16:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:16:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2025-03-04 10:16:22,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48830409356725146 [2025-03-04 10:16:22,006 INFO L175 Difference]: Start difference. First operand has 92 places, 74 transitions, 447 flow. Second operand 6 states and 167 transitions. [2025-03-04 10:16:22,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 109 transitions, 803 flow [2025-03-04 10:16:22,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 109 transitions, 795 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:16:22,013 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 488 flow [2025-03-04 10:16:22,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2025-03-04 10:16:22,014 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 40 predicate places. [2025-03-04 10:16:22,014 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 488 flow [2025-03-04 10:16:22,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:22,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:22,014 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:22,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:16:22,215 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,SelfDestructingSolverStorable15 [2025-03-04 10:16:22,215 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:22,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash 446717741, now seen corresponding path program 2 times [2025-03-04 10:16:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:22,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987451562] [2025-03-04 10:16:22,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:22,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:22,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:16:22,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:16:22,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:22,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:22,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987451562] [2025-03-04 10:16:22,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987451562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365496581] [2025-03-04 10:16:22,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:22,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:22,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:22,475 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:16:22,476 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:16:22,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:16:22,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:16:22,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:22,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:22,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:16:22,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:22,538 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:16:22,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:16:22,586 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:16:22,590 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:16:22,590 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:16:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:16:22,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:22,768 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:16:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:16:22,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365496581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:22,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:22,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2025-03-04 10:16:22,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890088326] [2025-03-04 10:16:22,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:22,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:16:22,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:22,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:16:22,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:16:23,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2025-03-04 10:16:23,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 75 transitions, 488 flow. Second operand has 22 states, 22 states have (on average 14.272727272727273) internal successors, (314), 22 states have internal predecessors, (314), 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:16:23,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:23,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2025-03-04 10:16:23,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:25,100 INFO L124 PetriNetUnfolderBase]: 8412/12373 cut-off events. [2025-03-04 10:16:25,100 INFO L125 PetriNetUnfolderBase]: For 19974/20357 co-relation queries the response was YES. [2025-03-04 10:16:25,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42987 conditions, 12373 events. 8412/12373 cut-off events. For 19974/20357 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 72825 event pairs, 1724 based on Foata normal form. 280/12290 useless extension candidates. Maximal degree in co-relation 30540. Up to 2861 conditions per place. [2025-03-04 10:16:25,179 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 258 selfloop transitions, 36 changer transitions 0/300 dead transitions. [2025-03-04 10:16:25,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 300 transitions, 2126 flow [2025-03-04 10:16:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:16:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:16:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 453 transitions. [2025-03-04 10:16:25,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4182825484764543 [2025-03-04 10:16:25,181 INFO L175 Difference]: Start difference. First operand has 97 places, 75 transitions, 488 flow. Second operand 19 states and 453 transitions. [2025-03-04 10:16:25,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 300 transitions, 2126 flow [2025-03-04 10:16:25,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 300 transitions, 2069 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:16:25,213 INFO L231 Difference]: Finished difference. Result has 112 places, 85 transitions, 636 flow [2025-03-04 10:16:25,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=636, PETRI_PLACES=112, PETRI_TRANSITIONS=85} [2025-03-04 10:16:25,213 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 55 predicate places. [2025-03-04 10:16:25,213 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 85 transitions, 636 flow [2025-03-04 10:16:25,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 14.272727272727273) internal successors, (314), 22 states have internal predecessors, (314), 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:16:25,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:25,214 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:16:25,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:16:25,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:16:25,414 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:25,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:25,415 INFO L85 PathProgramCache]: Analyzing trace with hash 992718358, now seen corresponding path program 1 times [2025-03-04 10:16:25,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:25,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171020074] [2025-03-04 10:16:25,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:25,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:25,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:16:25,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:16:25,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:25,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:25,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:25,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171020074] [2025-03-04 10:16:25,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171020074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:25,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713657488] [2025-03-04 10:16:25,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:25,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:25,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:25,501 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:16:25,503 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:16:25,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:16:25,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:16:25,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:25,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:25,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:16:25,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:25,610 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:16:25,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:25,654 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:16:25,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713657488] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:25,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:25,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:16:25,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312422203] [2025-03-04 10:16:25,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:25,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:16:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:25,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:16:25,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:16:25,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:25,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 85 transitions, 636 flow. Second operand has 14 states, 14 states have (on average 16.785714285714285) internal successors, (235), 14 states have internal predecessors, (235), 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:16:25,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:25,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:25,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:26,316 INFO L124 PetriNetUnfolderBase]: 5864/8899 cut-off events. [2025-03-04 10:16:26,316 INFO L125 PetriNetUnfolderBase]: For 30854/31686 co-relation queries the response was YES. [2025-03-04 10:16:26,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33318 conditions, 8899 events. 5864/8899 cut-off events. For 30854/31686 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 49583 event pairs, 3233 based on Foata normal form. 152/8829 useless extension candidates. Maximal degree in co-relation 25168. Up to 4848 conditions per place. [2025-03-04 10:16:26,370 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 124 selfloop transitions, 24 changer transitions 0/156 dead transitions. [2025-03-04 10:16:26,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 156 transitions, 1341 flow [2025-03-04 10:16:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:16:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:16:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2025-03-04 10:16:26,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4368421052631579 [2025-03-04 10:16:26,376 INFO L175 Difference]: Start difference. First operand has 112 places, 85 transitions, 636 flow. Second operand 10 states and 249 transitions. [2025-03-04 10:16:26,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 156 transitions, 1341 flow [2025-03-04 10:16:26,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 156 transitions, 1286 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-03-04 10:16:26,401 INFO L231 Difference]: Finished difference. Result has 114 places, 89 transitions, 691 flow [2025-03-04 10:16:26,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=691, PETRI_PLACES=114, PETRI_TRANSITIONS=89} [2025-03-04 10:16:26,401 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 57 predicate places. [2025-03-04 10:16:26,401 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 89 transitions, 691 flow [2025-03-04 10:16:26,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.785714285714285) internal successors, (235), 14 states have internal predecessors, (235), 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:16:26,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:26,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:26,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:26,603 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,SelfDestructingSolverStorable17 [2025-03-04 10:16:26,603 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:26,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:26,603 INFO L85 PathProgramCache]: Analyzing trace with hash 6248755, now seen corresponding path program 1 times [2025-03-04 10:16:26,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:26,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887101715] [2025-03-04 10:16:26,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:26,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:16:26,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:16:26,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:26,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:26,715 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:16:26,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:26,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887101715] [2025-03-04 10:16:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887101715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:26,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:26,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:16:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310012431] [2025-03-04 10:16:26,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:26,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:16:26,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:26,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:16:26,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:16:26,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 10:16:26,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 89 transitions, 691 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:26,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:26,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 10:16:26,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:27,199 INFO L124 PetriNetUnfolderBase]: 5316/8377 cut-off events. [2025-03-04 10:16:27,199 INFO L125 PetriNetUnfolderBase]: For 31793/32332 co-relation queries the response was YES. [2025-03-04 10:16:27,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32399 conditions, 8377 events. 5316/8377 cut-off events. For 31793/32332 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 48389 event pairs, 4166 based on Foata normal form. 1/8119 useless extension candidates. Maximal degree in co-relation 22986. Up to 7451 conditions per place. [2025-03-04 10:16:27,244 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 76 selfloop transitions, 2 changer transitions 17/104 dead transitions. [2025-03-04 10:16:27,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 104 transitions, 955 flow [2025-03-04 10:16:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:16:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:16:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 10:16:27,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2025-03-04 10:16:27,245 INFO L175 Difference]: Start difference. First operand has 114 places, 89 transitions, 691 flow. Second operand 5 states and 130 transitions. [2025-03-04 10:16:27,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 104 transitions, 955 flow [2025-03-04 10:16:27,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 920 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 10:16:27,263 INFO L231 Difference]: Finished difference. Result has 113 places, 87 transitions, 642 flow [2025-03-04 10:16:27,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=642, PETRI_PLACES=113, PETRI_TRANSITIONS=87} [2025-03-04 10:16:27,264 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 56 predicate places. [2025-03-04 10:16:27,264 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 87 transitions, 642 flow [2025-03-04 10:16:27,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:27,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:27,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:27,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:16:27,264 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:27,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:27,265 INFO L85 PathProgramCache]: Analyzing trace with hash 785421924, now seen corresponding path program 1 times [2025-03-04 10:16:27,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:27,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842916216] [2025-03-04 10:16:27,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:27,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:16:27,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:16:27,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:27,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:27,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:27,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842916216] [2025-03-04 10:16:27,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842916216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:27,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757880224] [2025-03-04 10:16:27,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:27,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:27,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:27,328 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:16:27,329 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:16:27,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:16:27,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:16:27,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:27,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:27,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:16:27,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:16:27,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:16:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757880224] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:27,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:16:27,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 10 [2025-03-04 10:16:27,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378081842] [2025-03-04 10:16:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:27,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:27,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:27,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:27,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:16:27,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 10:16:27,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 87 transitions, 642 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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:16:27,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:27,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 10:16:27,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:27,871 INFO L124 PetriNetUnfolderBase]: 4952/7688 cut-off events. [2025-03-04 10:16:27,871 INFO L125 PetriNetUnfolderBase]: For 28990/29583 co-relation queries the response was YES. [2025-03-04 10:16:27,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29116 conditions, 7688 events. 4952/7688 cut-off events. For 28990/29583 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 44202 event pairs, 3794 based on Foata normal form. 2/7444 useless extension candidates. Maximal degree in co-relation 29077. Up to 7008 conditions per place. [2025-03-04 10:16:27,925 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 55 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2025-03-04 10:16:27,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 79 transitions, 688 flow [2025-03-04 10:16:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:16:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:16:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-04 10:16:27,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39649122807017545 [2025-03-04 10:16:27,925 INFO L175 Difference]: Start difference. First operand has 113 places, 87 transitions, 642 flow. Second operand 5 states and 113 transitions. [2025-03-04 10:16:27,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 79 transitions, 688 flow [2025-03-04 10:16:27,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 79 transitions, 648 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-03-04 10:16:27,949 INFO L231 Difference]: Finished difference. Result has 103 places, 79 transitions, 538 flow [2025-03-04 10:16:27,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=538, PETRI_PLACES=103, PETRI_TRANSITIONS=79} [2025-03-04 10:16:27,950 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 46 predicate places. [2025-03-04 10:16:27,950 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 79 transitions, 538 flow [2025-03-04 10:16:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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:16:27,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:27,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:27,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:28,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:28,150 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:28,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:28,152 INFO L85 PathProgramCache]: Analyzing trace with hash -261808621, now seen corresponding path program 1 times [2025-03-04 10:16:28,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:28,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554744007] [2025-03-04 10:16:28,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:28,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:16:28,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:16:28,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:28,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:16:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:28,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554744007] [2025-03-04 10:16:28,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554744007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:28,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:28,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:16:28,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860127587] [2025-03-04 10:16:28,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:28,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:28,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:28,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:28,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:16:28,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:28,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 79 transitions, 538 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:16:28,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:28,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:28,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:28,955 INFO L124 PetriNetUnfolderBase]: 7798/12036 cut-off events. [2025-03-04 10:16:28,955 INFO L125 PetriNetUnfolderBase]: For 35602/35907 co-relation queries the response was YES. [2025-03-04 10:16:28,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43772 conditions, 12036 events. 7798/12036 cut-off events. For 35602/35907 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 73099 event pairs, 2447 based on Foata normal form. 266/12052 useless extension candidates. Maximal degree in co-relation 25177. Up to 6112 conditions per place. [2025-03-04 10:16:29,019 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 168 selfloop transitions, 17 changer transitions 0/193 dead transitions. [2025-03-04 10:16:29,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 193 transitions, 1710 flow [2025-03-04 10:16:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:16:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:16:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2025-03-04 10:16:29,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5350877192982456 [2025-03-04 10:16:29,020 INFO L175 Difference]: Start difference. First operand has 103 places, 79 transitions, 538 flow. Second operand 6 states and 183 transitions. [2025-03-04 10:16:29,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 193 transitions, 1710 flow [2025-03-04 10:16:29,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 193 transitions, 1680 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:16:29,038 INFO L231 Difference]: Finished difference. Result has 108 places, 91 transitions, 685 flow [2025-03-04 10:16:29,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=685, PETRI_PLACES=108, PETRI_TRANSITIONS=91} [2025-03-04 10:16:29,039 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 51 predicate places. [2025-03-04 10:16:29,039 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 91 transitions, 685 flow [2025-03-04 10:16:29,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:16:29,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:29,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:29,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:16:29,039 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:29,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -450596723, now seen corresponding path program 2 times [2025-03-04 10:16:29,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:29,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534189710] [2025-03-04 10:16:29,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:29,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:29,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:16:29,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-03-04 10:16:29,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:16:29,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:16:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:29,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534189710] [2025-03-04 10:16:29,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534189710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:29,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:29,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:16:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054256898] [2025-03-04 10:16:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:29,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:29,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:29,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:16:29,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:29,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 91 transitions, 685 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:16:29,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:29,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:29,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:30,112 INFO L124 PetriNetUnfolderBase]: 11139/16960 cut-off events. [2025-03-04 10:16:30,112 INFO L125 PetriNetUnfolderBase]: For 61560/62040 co-relation queries the response was YES. [2025-03-04 10:16:30,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64517 conditions, 16960 events. 11139/16960 cut-off events. For 61560/62040 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 103919 event pairs, 4227 based on Foata normal form. 292/16823 useless extension candidates. Maximal degree in co-relation 39564. Up to 6868 conditions per place. [2025-03-04 10:16:30,209 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 185 selfloop transitions, 14 changer transitions 0/207 dead transitions. [2025-03-04 10:16:30,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 207 transitions, 1934 flow [2025-03-04 10:16:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:16:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:16:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-03-04 10:16:30,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2025-03-04 10:16:30,210 INFO L175 Difference]: Start difference. First operand has 108 places, 91 transitions, 685 flow. Second operand 6 states and 180 transitions. [2025-03-04 10:16:30,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 207 transitions, 1934 flow [2025-03-04 10:16:30,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 207 transitions, 1905 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:16:30,260 INFO L231 Difference]: Finished difference. Result has 116 places, 99 transitions, 831 flow [2025-03-04 10:16:30,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=116, PETRI_TRANSITIONS=99} [2025-03-04 10:16:30,260 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 59 predicate places. [2025-03-04 10:16:30,260 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 831 flow [2025-03-04 10:16:30,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:16:30,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:30,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:30,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:16:30,260 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:30,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash 292774205, now seen corresponding path program 3 times [2025-03-04 10:16:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817042213] [2025-03-04 10:16:30,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:16:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:30,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-03-04 10:16:30,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-03-04 10:16:30,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:16:30,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:16:30,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:30,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817042213] [2025-03-04 10:16:30,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817042213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:30,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:30,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:16:30,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830373254] [2025-03-04 10:16:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:30,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:30,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:30,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:30,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:16:30,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:30,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 99 transitions, 831 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:16:30,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:30,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:30,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:31,350 INFO L124 PetriNetUnfolderBase]: 10194/15596 cut-off events. [2025-03-04 10:16:31,350 INFO L125 PetriNetUnfolderBase]: For 57928/58567 co-relation queries the response was YES. [2025-03-04 10:16:31,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58609 conditions, 15596 events. 10194/15596 cut-off events. For 57928/58567 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 92098 event pairs, 2051 based on Foata normal form. 266/15616 useless extension candidates. Maximal degree in co-relation 47066. Up to 6263 conditions per place. [2025-03-04 10:16:31,438 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 157 selfloop transitions, 27 changer transitions 0/192 dead transitions. [2025-03-04 10:16:31,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 192 transitions, 1834 flow [2025-03-04 10:16:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:16:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:16:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-03-04 10:16:31,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292397660818714 [2025-03-04 10:16:31,439 INFO L175 Difference]: Start difference. First operand has 116 places, 99 transitions, 831 flow. Second operand 6 states and 181 transitions. [2025-03-04 10:16:31,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 192 transitions, 1834 flow [2025-03-04 10:16:31,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 192 transitions, 1811 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:16:31,484 INFO L231 Difference]: Finished difference. Result has 122 places, 101 transitions, 927 flow [2025-03-04 10:16:31,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=927, PETRI_PLACES=122, PETRI_TRANSITIONS=101} [2025-03-04 10:16:31,484 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 65 predicate places. [2025-03-04 10:16:31,484 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 101 transitions, 927 flow [2025-03-04 10:16:31,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:16:31,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:31,484 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:31,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:16:31,484 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:31,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:31,485 INFO L85 PathProgramCache]: Analyzing trace with hash 416980095, now seen corresponding path program 2 times [2025-03-04 10:16:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833130670] [2025-03-04 10:16:31,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:31,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:16:31,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:16:31,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:31,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:16:31,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833130670] [2025-03-04 10:16:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833130670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096182212] [2025-03-04 10:16:31,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:31,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:31,633 INFO L229 MonitoredProcess]: Starting monitored process 13 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:16:31,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:16:31,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:16:31,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:16:31,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:31,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:31,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:16:31,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:31,694 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:16:31,754 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 10:16:31,755 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 21 treesize of output 21 [2025-03-04 10:16:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:16:31,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:16:32,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096182212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:32,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:32,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 20 [2025-03-04 10:16:32,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233929397] [2025-03-04 10:16:32,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:32,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:16:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:32,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:16:32,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:16:32,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 57 [2025-03-04 10:16:32,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 101 transitions, 927 flow. Second operand has 22 states, 22 states have (on average 12.727272727272727) internal successors, (280), 22 states have internal predecessors, (280), 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:16:32,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:32,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 57 [2025-03-04 10:16:32,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:34,410 INFO L124 PetriNetUnfolderBase]: 10441/15845 cut-off events. [2025-03-04 10:16:34,410 INFO L125 PetriNetUnfolderBase]: For 61875/62279 co-relation queries the response was YES. [2025-03-04 10:16:34,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62272 conditions, 15845 events. 10441/15845 cut-off events. For 61875/62279 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 93035 event pairs, 1405 based on Foata normal form. 338/15871 useless extension candidates. Maximal degree in co-relation 44046. Up to 3759 conditions per place. [2025-03-04 10:16:34,489 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 201 selfloop transitions, 46 changer transitions 0/255 dead transitions. [2025-03-04 10:16:34,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 255 transitions, 2445 flow [2025-03-04 10:16:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:16:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:16:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 359 transitions. [2025-03-04 10:16:34,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3314866112650046 [2025-03-04 10:16:34,490 INFO L175 Difference]: Start difference. First operand has 122 places, 101 transitions, 927 flow. Second operand 19 states and 359 transitions. [2025-03-04 10:16:34,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 255 transitions, 2445 flow [2025-03-04 10:16:34,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 255 transitions, 2348 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-03-04 10:16:34,558 INFO L231 Difference]: Finished difference. Result has 137 places, 114 transitions, 1163 flow [2025-03-04 10:16:34,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1163, PETRI_PLACES=137, PETRI_TRANSITIONS=114} [2025-03-04 10:16:34,558 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 80 predicate places. [2025-03-04 10:16:34,559 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 114 transitions, 1163 flow [2025-03-04 10:16:34,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 12.727272727272727) internal successors, (280), 22 states have internal predecessors, (280), 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:16:34,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:34,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:34,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:16:34,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:16:34,760 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:34,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1609416128, now seen corresponding path program 1 times [2025-03-04 10:16:34,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:34,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780260253] [2025-03-04 10:16:34,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:34,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:34,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:16:34,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:16:34,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:34,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:34,826 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:16:34,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:34,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780260253] [2025-03-04 10:16:34,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780260253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:34,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465935471] [2025-03-04 10:16:34,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:34,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:34,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:34,830 INFO L229 MonitoredProcess]: Starting monitored process 14 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:16:34,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:16:34,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:16:34,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:16:34,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:34,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:34,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:16:34,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:34,917 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:16:34,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465935471] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:16:34,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-04 10:16:34,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128056220] [2025-03-04 10:16:34,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:34,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:34,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:34,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:16:34,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:34,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 114 transitions, 1163 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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:16:34,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:34,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:34,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:36,425 INFO L124 PetriNetUnfolderBase]: 11802/17712 cut-off events. [2025-03-04 10:16:36,425 INFO L125 PetriNetUnfolderBase]: For 72781/73124 co-relation queries the response was YES. [2025-03-04 10:16:36,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71015 conditions, 17712 events. 11802/17712 cut-off events. For 72781/73124 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 105536 event pairs, 3681 based on Foata normal form. 546/17312 useless extension candidates. Maximal degree in co-relation 53002. Up to 9840 conditions per place. [2025-03-04 10:16:36,577 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 154 selfloop transitions, 12 changer transitions 0/174 dead transitions. [2025-03-04 10:16:36,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 174 transitions, 2230 flow [2025-03-04 10:16:36,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:16:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:16:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-04 10:16:36,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4421052631578947 [2025-03-04 10:16:36,578 INFO L175 Difference]: Start difference. First operand has 137 places, 114 transitions, 1163 flow. Second operand 5 states and 126 transitions. [2025-03-04 10:16:36,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 174 transitions, 2230 flow [2025-03-04 10:16:36,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 174 transitions, 2185 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-03-04 10:16:36,661 INFO L231 Difference]: Finished difference. Result has 132 places, 112 transitions, 1141 flow [2025-03-04 10:16:36,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1141, PETRI_PLACES=132, PETRI_TRANSITIONS=112} [2025-03-04 10:16:36,661 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 75 predicate places. [2025-03-04 10:16:36,661 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 112 transitions, 1141 flow [2025-03-04 10:16:36,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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:16:36,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:36,662 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:36,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:16:36,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 10:16:36,862 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:36,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:36,863 INFO L85 PathProgramCache]: Analyzing trace with hash 41481525, now seen corresponding path program 1 times [2025-03-04 10:16:36,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:36,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144026953] [2025-03-04 10:16:36,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:36,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:16:36,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:16:36,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:36,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:16:37,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:37,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144026953] [2025-03-04 10:16:37,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144026953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:37,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780259873] [2025-03-04 10:16:37,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:37,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:37,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:37,059 INFO L229 MonitoredProcess]: Starting monitored process 15 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:16:37,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:16:37,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:16:37,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:16:37,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:37,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:37,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:16:37,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:16:37,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:37,345 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 24 treesize of output 20 [2025-03-04 10:16:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:16:37,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780259873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:37,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:37,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2025-03-04 10:16:37,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753829553] [2025-03-04 10:16:37,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:37,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:16:37,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:37,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:16:37,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:16:37,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:37,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 112 transitions, 1141 flow. Second operand has 22 states, 22 states have (on average 16.772727272727273) internal successors, (369), 22 states have internal predecessors, (369), 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:16:37,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:37,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:37,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:39,199 INFO L124 PetriNetUnfolderBase]: 8886/13871 cut-off events. [2025-03-04 10:16:39,199 INFO L125 PetriNetUnfolderBase]: For 70113/70493 co-relation queries the response was YES. [2025-03-04 10:16:39,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54437 conditions, 13871 events. 8886/13871 cut-off events. For 70113/70493 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 82401 event pairs, 3165 based on Foata normal form. 523/13878 useless extension candidates. Maximal degree in co-relation 39288. Up to 4121 conditions per place. [2025-03-04 10:16:39,269 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 146 selfloop transitions, 25 changer transitions 16/196 dead transitions. [2025-03-04 10:16:39,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 196 transitions, 1935 flow [2025-03-04 10:16:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:16:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:16:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 328 transitions. [2025-03-04 10:16:39,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41102756892230574 [2025-03-04 10:16:39,270 INFO L175 Difference]: Start difference. First operand has 132 places, 112 transitions, 1141 flow. Second operand 14 states and 328 transitions. [2025-03-04 10:16:39,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 196 transitions, 1935 flow [2025-03-04 10:16:39,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 196 transitions, 1864 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 10:16:39,322 INFO L231 Difference]: Finished difference. Result has 143 places, 96 transitions, 877 flow [2025-03-04 10:16:39,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=877, PETRI_PLACES=143, PETRI_TRANSITIONS=96} [2025-03-04 10:16:39,323 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places. [2025-03-04 10:16:39,323 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 96 transitions, 877 flow [2025-03-04 10:16:39,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 16.772727272727273) internal successors, (369), 22 states have internal predecessors, (369), 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:16:39,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:39,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:39,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:39,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:39,523 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:39,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1845917751, now seen corresponding path program 1 times [2025-03-04 10:16:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:39,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323638815] [2025-03-04 10:16:39,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:39,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:16:39,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:16:39,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:39,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:39,580 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:16:39,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:39,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323638815] [2025-03-04 10:16:39,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323638815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:39,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426588847] [2025-03-04 10:16:39,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:39,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:39,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:39,583 INFO L229 MonitoredProcess]: Starting monitored process 16 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:16:39,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:16:39,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:16:39,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:16:39,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:39,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:39,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:16:39,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:39,678 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:16:39,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:39,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426588847] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:39,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:16:39,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-03-04 10:16:39,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112439704] [2025-03-04 10:16:39,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:39,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:39,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:39,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:39,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:16:39,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:39,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 96 transitions, 877 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:39,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:39,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:39,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:40,474 INFO L124 PetriNetUnfolderBase]: 7874/12093 cut-off events. [2025-03-04 10:16:40,474 INFO L125 PetriNetUnfolderBase]: For 59074/59412 co-relation queries the response was YES. [2025-03-04 10:16:40,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47380 conditions, 12093 events. 7874/12093 cut-off events. For 59074/59412 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 69825 event pairs, 2072 based on Foata normal form. 65/11649 useless extension candidates. Maximal degree in co-relation 39922. Up to 8159 conditions per place. [2025-03-04 10:16:40,554 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 90 selfloop transitions, 18 changer transitions 0/117 dead transitions. [2025-03-04 10:16:40,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 117 transitions, 1186 flow [2025-03-04 10:16:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:16:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:16:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-03-04 10:16:40,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4280701754385965 [2025-03-04 10:16:40,555 INFO L175 Difference]: Start difference. First operand has 143 places, 96 transitions, 877 flow. Second operand 5 states and 122 transitions. [2025-03-04 10:16:40,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 117 transitions, 1186 flow [2025-03-04 10:16:40,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 117 transitions, 1087 flow, removed 10 selfloop flow, removed 20 redundant places. [2025-03-04 10:16:40,598 INFO L231 Difference]: Finished difference. Result has 128 places, 94 transitions, 795 flow [2025-03-04 10:16:40,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=795, PETRI_PLACES=128, PETRI_TRANSITIONS=94} [2025-03-04 10:16:40,598 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 71 predicate places. [2025-03-04 10:16:40,598 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 94 transitions, 795 flow [2025-03-04 10:16:40,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:40,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:40,598 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:40,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:16:40,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:16:40,799 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:40,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash -840658161, now seen corresponding path program 2 times [2025-03-04 10:16:40,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:40,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4197308] [2025-03-04 10:16:40,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:40,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:16:40,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:16:40,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:40,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:16:41,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4197308] [2025-03-04 10:16:41,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4197308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624653627] [2025-03-04 10:16:41,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:41,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:41,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:41,035 INFO L229 MonitoredProcess]: Starting monitored process 17 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:16:41,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:16:41,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:16:41,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:16:41,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:41,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:41,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:16:41,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:16:41,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:16:41,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624653627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:41,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:41,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 10:16:41,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722650799] [2025-03-04 10:16:41,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:41,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:16:41,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:41,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:16:41,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:16:41,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:16:41,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 94 transitions, 795 flow. Second operand has 19 states, 19 states have (on average 16.94736842105263) internal successors, (322), 19 states have internal predecessors, (322), 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:16:41,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:41,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:16:41,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:42,748 INFO L124 PetriNetUnfolderBase]: 11892/18397 cut-off events. [2025-03-04 10:16:42,749 INFO L125 PetriNetUnfolderBase]: For 86403/86953 co-relation queries the response was YES. [2025-03-04 10:16:42,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71841 conditions, 18397 events. 11892/18397 cut-off events. For 86403/86953 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 113231 event pairs, 6210 based on Foata normal form. 203/18170 useless extension candidates. Maximal degree in co-relation 44565. Up to 9499 conditions per place. [2025-03-04 10:16:42,880 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 169 selfloop transitions, 40 changer transitions 0/218 dead transitions. [2025-03-04 10:16:42,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 218 transitions, 2075 flow [2025-03-04 10:16:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:16:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:16:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 357 transitions. [2025-03-04 10:16:42,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39144736842105265 [2025-03-04 10:16:42,881 INFO L175 Difference]: Start difference. First operand has 128 places, 94 transitions, 795 flow. Second operand 16 states and 357 transitions. [2025-03-04 10:16:42,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 218 transitions, 2075 flow [2025-03-04 10:16:42,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 218 transitions, 2036 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 10:16:42,970 INFO L231 Difference]: Finished difference. Result has 145 places, 116 transitions, 1183 flow [2025-03-04 10:16:42,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1183, PETRI_PLACES=145, PETRI_TRANSITIONS=116} [2025-03-04 10:16:42,971 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 88 predicate places. [2025-03-04 10:16:42,971 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 116 transitions, 1183 flow [2025-03-04 10:16:42,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 16.94736842105263) internal successors, (322), 19 states have internal predecessors, (322), 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:16:42,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:42,971 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:42,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:16:43,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:16:43,171 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:43,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash -372420728, now seen corresponding path program 1 times [2025-03-04 10:16:43,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:43,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261758543] [2025-03-04 10:16:43,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:43,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:43,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:16:43,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:16:43,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:43,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:16:43,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:43,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261758543] [2025-03-04 10:16:43,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261758543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:43,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979621916] [2025-03-04 10:16:43,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:43,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:43,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:43,281 INFO L229 MonitoredProcess]: Starting monitored process 18 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:16:43,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:16:43,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:16:43,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:16:43,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:43,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:43,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:16:43,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:16:43,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:43,477 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 29 treesize of output 25 [2025-03-04 10:16:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:16:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979621916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:43,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:43,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-04 10:16:43,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843169350] [2025-03-04 10:16:43,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:43,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:16:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:43,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:16:43,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:16:43,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 10:16:43,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 116 transitions, 1183 flow. Second operand has 18 states, 18 states have (on average 17.833333333333332) internal successors, (321), 18 states have internal predecessors, (321), 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:16:43,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:43,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 10:16:43,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:47,246 INFO L124 PetriNetUnfolderBase]: 24547/38182 cut-off events. [2025-03-04 10:16:47,246 INFO L125 PetriNetUnfolderBase]: For 186560/188291 co-relation queries the response was YES. [2025-03-04 10:16:47,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150418 conditions, 38182 events. 24547/38182 cut-off events. For 186560/188291 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 264239 event pairs, 3340 based on Foata normal form. 78/37203 useless extension candidates. Maximal degree in co-relation 97045. Up to 5250 conditions per place. [2025-03-04 10:16:47,679 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 434 selfloop transitions, 83 changer transitions 0/530 dead transitions. [2025-03-04 10:16:47,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 530 transitions, 5148 flow [2025-03-04 10:16:47,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:16:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 10:16:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 661 transitions. [2025-03-04 10:16:47,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5041952707856598 [2025-03-04 10:16:47,681 INFO L175 Difference]: Start difference. First operand has 145 places, 116 transitions, 1183 flow. Second operand 23 states and 661 transitions. [2025-03-04 10:16:47,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 530 transitions, 5148 flow [2025-03-04 10:16:48,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 530 transitions, 5142 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 10:16:48,050 INFO L231 Difference]: Finished difference. Result has 185 places, 190 transitions, 2305 flow [2025-03-04 10:16:48,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2305, PETRI_PLACES=185, PETRI_TRANSITIONS=190} [2025-03-04 10:16:48,051 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 128 predicate places. [2025-03-04 10:16:48,051 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 190 transitions, 2305 flow [2025-03-04 10:16:48,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.833333333333332) internal successors, (321), 18 states have internal predecessors, (321), 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:16:48,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:48,052 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:48,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:16:48,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:16:48,252 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:48,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash 342086540, now seen corresponding path program 2 times [2025-03-04 10:16:48,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:48,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413038661] [2025-03-04 10:16:48,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:48,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:48,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:16:48,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-03-04 10:16:48,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:16:48,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:16:48,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:48,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413038661] [2025-03-04 10:16:48,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413038661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:48,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:48,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:16:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491705622] [2025-03-04 10:16:48,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:48,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:16:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:48,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:16:48,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:16:48,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2025-03-04 10:16:48,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 190 transitions, 2305 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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:16:48,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:48,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2025-03-04 10:16:48,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:54,521 INFO L124 PetriNetUnfolderBase]: 38160/56488 cut-off events. [2025-03-04 10:16:54,521 INFO L125 PetriNetUnfolderBase]: For 526464/528342 co-relation queries the response was YES. [2025-03-04 10:16:55,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274488 conditions, 56488 events. 38160/56488 cut-off events. For 526464/528342 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 376466 event pairs, 10982 based on Foata normal form. 155/56469 useless extension candidates. Maximal degree in co-relation 236268. Up to 25208 conditions per place. [2025-03-04 10:16:55,244 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 260 selfloop transitions, 104 changer transitions 0/375 dead transitions. [2025-03-04 10:16:55,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 375 transitions, 4766 flow [2025-03-04 10:16:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:16:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:16:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions. [2025-03-04 10:16:55,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4543859649122807 [2025-03-04 10:16:55,245 INFO L175 Difference]: Start difference. First operand has 185 places, 190 transitions, 2305 flow. Second operand 10 states and 259 transitions. [2025-03-04 10:16:55,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 375 transitions, 4766 flow [2025-03-04 10:16:56,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 375 transitions, 4679 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-04 10:16:56,889 INFO L231 Difference]: Finished difference. Result has 196 places, 238 transitions, 3339 flow [2025-03-04 10:16:56,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3339, PETRI_PLACES=196, PETRI_TRANSITIONS=238} [2025-03-04 10:16:56,890 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 139 predicate places. [2025-03-04 10:16:56,890 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 238 transitions, 3339 flow [2025-03-04 10:16:56,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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:16:56,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:56,890 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:56,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 10:16:56,890 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:16:56,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash 340299080, now seen corresponding path program 3 times [2025-03-04 10:16:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:56,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679293800] [2025-03-04 10:16:56,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:16:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:56,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-04 10:16:56,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-03-04 10:16:56,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:16:56,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:16:56,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679293800] [2025-03-04 10:16:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679293800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:56,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:56,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:16:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541827223] [2025-03-04 10:16:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:56,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:16:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:56,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:16:56,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:16:56,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2025-03-04 10:16:56,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 238 transitions, 3339 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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:16:56,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:56,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2025-03-04 10:16:56,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:04,379 INFO L124 PetriNetUnfolderBase]: 40732/60132 cut-off events. [2025-03-04 10:17:04,380 INFO L125 PetriNetUnfolderBase]: For 670050/671844 co-relation queries the response was YES. [2025-03-04 10:17:05,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308108 conditions, 60132 events. 40732/60132 cut-off events. For 670050/671844 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 403907 event pairs, 2665 based on Foata normal form. 258/60338 useless extension candidates. Maximal degree in co-relation 276605. Up to 21588 conditions per place. [2025-03-04 10:17:05,293 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 264 selfloop transitions, 137 changer transitions 0/412 dead transitions. [2025-03-04 10:17:05,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 412 transitions, 5771 flow [2025-03-04 10:17:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:17:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:17:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 274 transitions. [2025-03-04 10:17:05,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4370015948963317 [2025-03-04 10:17:05,294 INFO L175 Difference]: Start difference. First operand has 196 places, 238 transitions, 3339 flow. Second operand 11 states and 274 transitions. [2025-03-04 10:17:05,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 412 transitions, 5771 flow [2025-03-04 10:17:08,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 412 transitions, 5634 flow, removed 65 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:08,649 INFO L231 Difference]: Finished difference. Result has 208 places, 274 transitions, 4335 flow [2025-03-04 10:17:08,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=3258, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4335, PETRI_PLACES=208, PETRI_TRANSITIONS=274} [2025-03-04 10:17:08,650 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 151 predicate places. [2025-03-04 10:17:08,650 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 274 transitions, 4335 flow [2025-03-04 10:17:08,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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:17:08,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:08,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:08,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 10:17:08,650 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-03-04 10:17:08,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:08,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1029470383, now seen corresponding path program 1 times [2025-03-04 10:17:08,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:08,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647304368] [2025-03-04 10:17:08,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:08,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:08,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:17:08,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:17:08,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:08,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:08,699 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:17:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647304368] [2025-03-04 10:17:08,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647304368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663063907] [2025-03-04 10:17:08,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:08,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:08,701 INFO L229 MonitoredProcess]: Starting monitored process 19 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:17:08,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:17:08,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:17:08,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:17:08,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:08,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:08,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:17:08,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:08,795 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:17:08,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:17:08,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663063907] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:08,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:17:08,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-04 10:17:08,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105930314] [2025-03-04 10:17:08,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:08,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:17:08,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:08,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:17:08,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:17:08,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2025-03-04 10:17:08,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 274 transitions, 4335 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:08,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:08,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2025-03-04 10:17:08,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:15,808 INFO L124 PetriNetUnfolderBase]: 37266/57172 cut-off events. [2025-03-04 10:17:15,808 INFO L125 PetriNetUnfolderBase]: For 735339/737515 co-relation queries the response was YES. [2025-03-04 10:17:16,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304504 conditions, 57172 events. 37266/57172 cut-off events. For 735339/737515 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 408618 event pairs, 8844 based on Foata normal form. 1/56118 useless extension candidates. Maximal degree in co-relation 272648. Up to 40372 conditions per place. [2025-03-04 10:17:16,530 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 233 selfloop transitions, 47 changer transitions 24/320 dead transitions. [2025-03-04 10:17:16,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 320 transitions, 5547 flow [2025-03-04 10:17:16,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-03-04 10:17:16,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4280701754385965 [2025-03-04 10:17:16,531 INFO L175 Difference]: Start difference. First operand has 208 places, 274 transitions, 4335 flow. Second operand 5 states and 122 transitions. [2025-03-04 10:17:16,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 320 transitions, 5547 flow