./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.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 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:23:04,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:23:04,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:23:04,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:23:04,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:23:04,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:23:04,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:23:04,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:23:04,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:23:04,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:23:04,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:23:04,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:23:04,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:23:04,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:23:04,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:23:04,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:23:04,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:23:04,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:23:04,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:23:04,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:23:04,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:23:04,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:23:04,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:23:04,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:23:04,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:23:04,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:23:04,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:23:04,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:23:04,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:23:04,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:23:04,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:23:04,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:23:04,784 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 -> 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 [2025-03-09 01:23:05,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:23:05,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:23:05,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:23:05,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:23:05,022 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:23:05,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-09 01:23:06,194 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df36f8d3/2f16c1c5b5834b50b3991d0cda624285/FLAGed6da675e [2025-03-09 01:23:06,464 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:23:06,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-09 01:23:06,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df36f8d3/2f16c1c5b5834b50b3991d0cda624285/FLAGed6da675e [2025-03-09 01:23:06,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df36f8d3/2f16c1c5b5834b50b3991d0cda624285 [2025-03-09 01:23:06,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:23:06,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:23:06,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:23:06,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:23:06,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:23:06,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53724da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06, skipping insertion in model container [2025-03-09 01:23:06,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:23:06,651 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-09 01:23:06,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:23:06,667 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:23:06,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:23:06,711 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:23:06,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06 WrapperNode [2025-03-09 01:23:06,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:23:06,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:23:06,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:23:06,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:23:06,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,750 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 247 [2025-03-09 01:23:06,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:23:06,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:23:06,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:23:06,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:23:06,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,779 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:23:06,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:23:06,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:23:06,803 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:23:06,803 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:23:06,804 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (1/1) ... [2025-03-09 01:23:06,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:23:06,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:06,835 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-09 01:23:06,838 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-09 01:23:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:23:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:23:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:23:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:23:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:23:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:23:06,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:23:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:23:06,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:23:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:23:06,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:23:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-09 01:23:06,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-09 01:23:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:23:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:23:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:23:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:23:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:23:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:23:06,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:23:06,859 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:23:06,954 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:23:06,955 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:23:07,291 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:23:07,291 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:23:07,552 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:23:07,552 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:23:07,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:23:07 BoogieIcfgContainer [2025-03-09 01:23:07,553 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:23:07,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:23:07,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:23:07,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:23:07,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:23:06" (1/3) ... [2025-03-09 01:23:07,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1215b417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:23:07, skipping insertion in model container [2025-03-09 01:23:07,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:06" (2/3) ... [2025-03-09 01:23:07,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1215b417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:23:07, skipping insertion in model container [2025-03-09 01:23:07,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:23:07" (3/3) ... [2025-03-09 01:23:07,565 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-03-09 01:23:07,578 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:23:07,579 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-03-09 01:23:07,580 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:23:07,650 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-03-09 01:23:07,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 70 transitions, 180 flow [2025-03-09 01:23:07,710 INFO L124 PetriNetUnfolderBase]: 9/63 cut-off events. [2025-03-09 01:23:07,712 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:23:07,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 63 events. 9/63 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 59. Up to 3 conditions per place. [2025-03-09 01:23:07,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 70 transitions, 180 flow [2025-03-09 01:23:07,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 62 transitions, 154 flow [2025-03-09 01:23:07,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:23:07,733 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;@131b2026, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:23:07,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-09 01:23:07,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:23:07,737 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:23:07,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:23:07,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:07,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:23:07,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:07,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash 729952, now seen corresponding path program 1 times [2025-03-09 01:23:07,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:07,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504997092] [2025-03-09 01:23:07,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:07,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:23:07,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:23:07,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:07,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:07,951 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-09 01:23:07,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:07,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504997092] [2025-03-09 01:23:07,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504997092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:07,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:07,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:23:07,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909819986] [2025-03-09 01:23:07,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:07,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:23:07,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:07,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:23:07,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:23:07,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-03-09 01:23:07,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-09 01:23:07,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:07,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-03-09 01:23:07,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:09,516 INFO L124 PetriNetUnfolderBase]: 14986/20198 cut-off events. [2025-03-09 01:23:09,517 INFO L125 PetriNetUnfolderBase]: For 1062/1062 co-relation queries the response was YES. [2025-03-09 01:23:09,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41822 conditions, 20198 events. 14986/20198 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 103947 event pairs, 13324 based on Foata normal form. 1/15683 useless extension candidates. Maximal degree in co-relation 41747. Up to 20169 conditions per place. [2025-03-09 01:23:09,651 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 49 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-09 01:23:09,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 244 flow [2025-03-09 01:23:09,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-09 01:23:09,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2025-03-09 01:23:09,663 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 154 flow. Second operand 3 states and 86 transitions. [2025-03-09 01:23:09,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 244 flow [2025-03-09 01:23:09,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 224 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:23:09,679 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 126 flow [2025-03-09 01:23:09,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2025-03-09 01:23:09,683 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2025-03-09 01:23:09,684 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 126 flow [2025-03-09 01:23:09,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-09 01:23:09,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:09,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:23:09,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:23:09,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:09,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 729953, now seen corresponding path program 1 times [2025-03-09 01:23:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:09,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658623991] [2025-03-09 01:23:09,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:09,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:23:09,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:23:09,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:09,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:09,984 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-09 01:23:09,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:09,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658623991] [2025-03-09 01:23:09,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658623991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:09,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:09,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628236231] [2025-03-09 01:23:09,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:09,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:09,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:09,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:09,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:09,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-03-09 01:23:09,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-09 01:23:09,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:09,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-03-09 01:23:09,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:11,143 INFO L124 PetriNetUnfolderBase]: 14987/20201 cut-off events. [2025-03-09 01:23:11,144 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-03-09 01:23:11,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40858 conditions, 20201 events. 14987/20201 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 103846 event pairs, 13324 based on Foata normal form. 0/15685 useless extension candidates. Maximal degree in co-relation 40836. Up to 20174 conditions per place. [2025-03-09 01:23:11,219 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 51 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-03-09 01:23:11,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 244 flow [2025-03-09 01:23:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-09 01:23:11,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-03-09 01:23:11,220 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 126 flow. Second operand 4 states and 96 transitions. [2025-03-09 01:23:11,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 244 flow [2025-03-09 01:23:11,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:11,223 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 149 flow [2025-03-09 01:23:11,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2025-03-09 01:23:11,224 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-03-09 01:23:11,224 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 149 flow [2025-03-09 01:23:11,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-09 01:23:11,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:11,226 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:23:11,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:23:11,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:11,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash 701507490, now seen corresponding path program 1 times [2025-03-09 01:23:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:11,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214752432] [2025-03-09 01:23:11,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:11,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:11,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:23:11,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:23:11,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:11,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:11,536 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-09 01:23:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:11,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214752432] [2025-03-09 01:23:11,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214752432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:11,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213630725] [2025-03-09 01:23:11,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:11,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:11,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:11,540 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-09 01:23:11,542 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-09 01:23:11,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:23:11,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:23:11,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:11,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:11,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:23:11,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:11,651 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-09 01:23:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:11,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:11,924 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-09 01:23:11,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213630725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:11,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:11,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:23:11,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621695786] [2025-03-09 01:23:11,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:11,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:23:11,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:11,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:23:11,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:23:11,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-03-09 01:23:11,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 149 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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-09 01:23:11,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:11,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-03-09 01:23:11,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:13,090 INFO L124 PetriNetUnfolderBase]: 14987/20200 cut-off events. [2025-03-09 01:23:13,090 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-03-09 01:23:13,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40865 conditions, 20200 events. 14987/20200 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 104002 event pairs, 13324 based on Foata normal form. 0/15684 useless extension candidates. Maximal degree in co-relation 40843. Up to 20170 conditions per place. [2025-03-09 01:23:13,193 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 47 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2025-03-09 01:23:13,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 253 flow [2025-03-09 01:23:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:23:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:23:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-03-09 01:23:13,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2662037037037037 [2025-03-09 01:23:13,194 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 149 flow. Second operand 6 states and 115 transitions. [2025-03-09 01:23:13,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 253 flow [2025-03-09 01:23:13,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:23:13,196 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 156 flow [2025-03-09 01:23:13,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2025-03-09 01:23:13,197 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2025-03-09 01:23:13,197 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 156 flow [2025-03-09 01:23:13,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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-09 01:23:13,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:13,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:13,205 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-09 01:23:13,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:13,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:13,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash -387183865, now seen corresponding path program 1 times [2025-03-09 01:23:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:13,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454975129] [2025-03-09 01:23:13,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:13,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:13,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:23:13,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:23:13,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:13,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:13,476 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-09 01:23:13,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:13,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454975129] [2025-03-09 01:23:13,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454975129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:13,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:13,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:13,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571814542] [2025-03-09 01:23:13,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:13,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:13,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:13,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:13,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:13,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-03-09 01:23:13,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-09 01:23:13,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:13,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-03-09 01:23:13,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:14,230 INFO L124 PetriNetUnfolderBase]: 11187/15107 cut-off events. [2025-03-09 01:23:14,230 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-09 01:23:14,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30601 conditions, 15107 events. 11187/15107 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 74431 event pairs, 9814 based on Foata normal form. 0/12548 useless extension candidates. Maximal degree in co-relation 30575. Up to 15076 conditions per place. [2025-03-09 01:23:14,277 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 48 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-03-09 01:23:14,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 252 flow [2025-03-09 01:23:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-09 01:23:14,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3159722222222222 [2025-03-09 01:23:14,279 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 156 flow. Second operand 4 states and 91 transitions. [2025-03-09 01:23:14,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 252 flow [2025-03-09 01:23:14,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 222 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-09 01:23:14,280 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 126 flow [2025-03-09 01:23:14,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-03-09 01:23:14,281 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2025-03-09 01:23:14,281 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 126 flow [2025-03-09 01:23:14,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-09 01:23:14,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:14,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:14,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:23:14,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:14,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash -387183864, now seen corresponding path program 1 times [2025-03-09 01:23:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135523662] [2025-03-09 01:23:14,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:14,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:14,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:23:14,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:23:14,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:14,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:14,344 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-09 01:23:14,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:14,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135523662] [2025-03-09 01:23:14,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135523662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:14,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:14,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:14,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134262553] [2025-03-09 01:23:14,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:14,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:14,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:14,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:14,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:14,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:14,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:14,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:14,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:15,388 INFO L124 PetriNetUnfolderBase]: 19693/26747 cut-off events. [2025-03-09 01:23:15,388 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2025-03-09 01:23:15,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54196 conditions, 26747 events. 19693/26747 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 910. Compared 147061 event pairs, 11285 based on Foata normal form. 391/22809 useless extension candidates. Maximal degree in co-relation 30487. Up to 15035 conditions per place. [2025-03-09 01:23:15,495 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 118 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2025-03-09 01:23:15,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 126 transitions, 529 flow [2025-03-09 01:23:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-03-09 01:23:15,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49722222222222223 [2025-03-09 01:23:15,497 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 126 flow. Second operand 5 states and 179 transitions. [2025-03-09 01:23:15,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 126 transitions, 529 flow [2025-03-09 01:23:15,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 126 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:15,498 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 141 flow [2025-03-09 01:23:15,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2025-03-09 01:23:15,499 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-03-09 01:23:15,499 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 141 flow [2025-03-09 01:23:15,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:15,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:15,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:15,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:23:15,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:15,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash -451268357, now seen corresponding path program 1 times [2025-03-09 01:23:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336139430] [2025-03-09 01:23:15,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:15,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:15,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:23:15,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:23:15,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:15,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:15,554 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-09 01:23:15,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:15,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336139430] [2025-03-09 01:23:15,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336139430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:15,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:15,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:15,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792785391] [2025-03-09 01:23:15,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:15,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:15,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:15,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:15,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:15,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:15,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-09 01:23:15,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:15,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:15,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:16,250 INFO L124 PetriNetUnfolderBase]: 14905/20422 cut-off events. [2025-03-09 01:23:16,250 INFO L125 PetriNetUnfolderBase]: For 1535/1535 co-relation queries the response was YES. [2025-03-09 01:23:16,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42932 conditions, 20422 events. 14905/20422 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 108447 event pairs, 11441 based on Foata normal form. 432/17552 useless extension candidates. Maximal degree in co-relation 31741. Up to 15079 conditions per place. [2025-03-09 01:23:16,353 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 87 selfloop transitions, 4 changer transitions 4/99 dead transitions. [2025-03-09 01:23:16,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 432 flow [2025-03-09 01:23:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-03-09 01:23:16,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2025-03-09 01:23:16,354 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 141 flow. Second operand 5 states and 154 transitions. [2025-03-09 01:23:16,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 432 flow [2025-03-09 01:23:16,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:16,360 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 159 flow [2025-03-09 01:23:16,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-03-09 01:23:16,361 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-03-09 01:23:16,361 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 159 flow [2025-03-09 01:23:16,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-09 01:23:16,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:16,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:16,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:23:16,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:16,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash 208071591, now seen corresponding path program 1 times [2025-03-09 01:23:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712451938] [2025-03-09 01:23:16,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:16,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:23:16,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:23:16,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:16,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:23:16,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:16,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712451938] [2025-03-09 01:23:16,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712451938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:16,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394573556] [2025-03-09 01:23:16,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:16,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:16,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:16,460 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-09 01:23:16,462 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-09 01:23:16,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:23:16,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:23:16,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:16,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:16,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:23:16,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:23:16,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:23:16,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394573556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:16,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:16,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 01:23:16,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650140648] [2025-03-09 01:23:16,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:16,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:23:16,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:16,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:23:16,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:23:16,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:16,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 159 flow. Second operand has 12 states, 12 states have (on average 13.25) internal successors, (159), 12 states have internal predecessors, (159), 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-09 01:23:16,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:16,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:16,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:18,387 INFO L124 PetriNetUnfolderBase]: 23412/32029 cut-off events. [2025-03-09 01:23:18,388 INFO L125 PetriNetUnfolderBase]: For 3113/3113 co-relation queries the response was YES. [2025-03-09 01:23:18,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69768 conditions, 32029 events. 23412/32029 cut-off events. For 3113/3113 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 184195 event pairs, 9882 based on Foata normal form. 391/27342 useless extension candidates. Maximal degree in co-relation 58577. Up to 13384 conditions per place. [2025-03-09 01:23:18,579 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 148 selfloop transitions, 10 changer transitions 0/162 dead transitions. [2025-03-09 01:23:18,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 162 transitions, 746 flow [2025-03-09 01:23:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:23:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:23:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2025-03-09 01:23:18,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4253472222222222 [2025-03-09 01:23:18,580 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 159 flow. Second operand 8 states and 245 transitions. [2025-03-09 01:23:18,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 162 transitions, 746 flow [2025-03-09 01:23:18,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 162 transitions, 741 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:18,591 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 213 flow [2025-03-09 01:23:18,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2025-03-09 01:23:18,592 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2025-03-09 01:23:18,592 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 213 flow [2025-03-09 01:23:18,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 12 states have internal predecessors, (159), 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-09 01:23:18,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:18,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:18,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:23:18,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 01:23:18,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:18,794 INFO L85 PathProgramCache]: Analyzing trace with hash 821781564, now seen corresponding path program 1 times [2025-03-09 01:23:18,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:18,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770347944] [2025-03-09 01:23:18,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:18,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:23:18,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:23:18,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:18,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:23:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770347944] [2025-03-09 01:23:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770347944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545519336] [2025-03-09 01:23:18,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:18,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:18,877 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-09 01:23:18,879 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-09 01:23:18,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:23:18,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:23:18,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:18,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:18,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:23:18,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:23:18,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:23:19,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545519336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:19,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:19,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 01:23:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955479122] [2025-03-09 01:23:19,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:19,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:23:19,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:19,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:23:19,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:23:19,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:19,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 213 flow. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:19,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:19,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:19,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:20,223 INFO L124 PetriNetUnfolderBase]: 18228/25344 cut-off events. [2025-03-09 01:23:20,223 INFO L125 PetriNetUnfolderBase]: For 6897/6897 co-relation queries the response was YES. [2025-03-09 01:23:20,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57488 conditions, 25344 events. 18228/25344 cut-off events. For 6897/6897 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 142272 event pairs, 9011 based on Foata normal form. 612/22072 useless extension candidates. Maximal degree in co-relation 39434. Up to 10410 conditions per place. [2025-03-09 01:23:20,335 INFO L140 encePairwiseOnDemand]: 61/72 looper letters, 111 selfloop transitions, 11 changer transitions 4/130 dead transitions. [2025-03-09 01:23:20,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 130 transitions, 647 flow [2025-03-09 01:23:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:23:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:23:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2025-03-09 01:23:20,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3802083333333333 [2025-03-09 01:23:20,336 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 213 flow. Second operand 8 states and 219 transitions. [2025-03-09 01:23:20,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 130 transitions, 647 flow [2025-03-09 01:23:20,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 130 transitions, 630 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:20,346 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 269 flow [2025-03-09 01:23:20,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=269, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-03-09 01:23:20,347 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2025-03-09 01:23:20,349 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 269 flow [2025-03-09 01:23:20,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:20,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:20,349 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:20,355 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-09 01:23:20,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:20,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:20,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:20,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1017913478, now seen corresponding path program 2 times [2025-03-09 01:23:20,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:20,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114052310] [2025-03-09 01:23:20,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:20,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:20,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 01:23:20,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 14 statements. [2025-03-09 01:23:20,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:23:20,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:23:20,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:20,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114052310] [2025-03-09 01:23:20,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114052310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:20,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:20,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:20,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299817310] [2025-03-09 01:23:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:20,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:20,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:20,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:20,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:20,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:20,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:20,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:20,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:20,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:22,198 INFO L124 PetriNetUnfolderBase]: 24944/34337 cut-off events. [2025-03-09 01:23:22,198 INFO L125 PetriNetUnfolderBase]: For 12371/12371 co-relation queries the response was YES. [2025-03-09 01:23:22,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83458 conditions, 34337 events. 24944/34337 cut-off events. For 12371/12371 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 198162 event pairs, 10774 based on Foata normal form. 0/29132 useless extension candidates. Maximal degree in co-relation 61675. Up to 17334 conditions per place. [2025-03-09 01:23:22,343 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 95 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2025-03-09 01:23:22,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 107 transitions, 626 flow [2025-03-09 01:23:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2025-03-09 01:23:22,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2025-03-09 01:23:22,344 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 269 flow. Second operand 5 states and 142 transitions. [2025-03-09 01:23:22,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 107 transitions, 626 flow [2025-03-09 01:23:22,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 107 transitions, 596 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-03-09 01:23:22,360 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 278 flow [2025-03-09 01:23:22,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2025-03-09 01:23:22,361 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2025-03-09 01:23:22,361 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 278 flow [2025-03-09 01:23:22,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:22,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:22,361 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:22,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:23:22,361 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:22,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash 157076285, now seen corresponding path program 2 times [2025-03-09 01:23:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:22,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610407773] [2025-03-09 01:23:22,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:22,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:22,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 01:23:22,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-03-09 01:23:22,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:23:22,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:23:22,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:22,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610407773] [2025-03-09 01:23:22,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610407773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:22,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:22,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:22,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938553362] [2025-03-09 01:23:22,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:22,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:22,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:22,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:22,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:22,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-09 01:23:22,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:22,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:22,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:24,371 INFO L124 PetriNetUnfolderBase]: 32963/45360 cut-off events. [2025-03-09 01:23:24,372 INFO L125 PetriNetUnfolderBase]: For 20503/20503 co-relation queries the response was YES. [2025-03-09 01:23:24,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110894 conditions, 45360 events. 32963/45360 cut-off events. For 20503/20503 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 262236 event pairs, 16158 based on Foata normal form. 0/38432 useless extension candidates. Maximal degree in co-relation 88652. Up to 23855 conditions per place. [2025-03-09 01:23:24,572 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 94 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2025-03-09 01:23:24,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 107 transitions, 636 flow [2025-03-09 01:23:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2025-03-09 01:23:24,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-09 01:23:24,573 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 278 flow. Second operand 5 states and 140 transitions. [2025-03-09 01:23:24,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 107 transitions, 636 flow [2025-03-09 01:23:24,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 107 transitions, 612 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:23:24,590 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 305 flow [2025-03-09 01:23:24,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2025-03-09 01:23:24,591 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 19 predicate places. [2025-03-09 01:23:24,591 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 305 flow [2025-03-09 01:23:24,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-09 01:23:24,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:24,591 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:24,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:23:24,591 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:24,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash -764267069, now seen corresponding path program 1 times [2025-03-09 01:23:24,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:24,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013273902] [2025-03-09 01:23:24,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:24,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:24,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:23:24,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:23:24,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:24,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:23:24,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:24,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013273902] [2025-03-09 01:23:24,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013273902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:24,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469503221] [2025-03-09 01:23:24,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:24,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:24,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:24,690 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-09 01:23:24,692 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-09 01:23:24,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:23:24,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:23:24,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:24,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:24,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:23:24,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:23:24,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:23:24,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469503221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:24,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-09 01:23:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098730730] [2025-03-09 01:23:24,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:24,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:23:24,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:24,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:23:24,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:23:24,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:24,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 305 flow. Second operand has 17 states, 17 states have (on average 13.411764705882353) internal successors, (228), 17 states have internal predecessors, (228), 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-09 01:23:24,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:24,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:24,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:29,202 INFO L124 PetriNetUnfolderBase]: 56306/77114 cut-off events. [2025-03-09 01:23:29,202 INFO L125 PetriNetUnfolderBase]: For 36301/36301 co-relation queries the response was YES. [2025-03-09 01:23:29,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192279 conditions, 77114 events. 56306/77114 cut-off events. For 36301/36301 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 480339 event pairs, 19888 based on Foata normal form. 568/66330 useless extension candidates. Maximal degree in co-relation 170079. Up to 25890 conditions per place. [2025-03-09 01:23:29,570 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 245 selfloop transitions, 16 changer transitions 0/265 dead transitions. [2025-03-09 01:23:29,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 265 transitions, 1602 flow [2025-03-09 01:23:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:23:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:23:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 350 transitions. [2025-03-09 01:23:29,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44191919191919193 [2025-03-09 01:23:29,571 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 305 flow. Second operand 11 states and 350 transitions. [2025-03-09 01:23:29,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 265 transitions, 1602 flow [2025-03-09 01:23:29,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 265 transitions, 1520 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-09 01:23:29,596 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 392 flow [2025-03-09 01:23:29,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=392, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2025-03-09 01:23:29,596 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 31 predicate places. [2025-03-09 01:23:29,597 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 392 flow [2025-03-09 01:23:29,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.411764705882353) internal successors, (228), 17 states have internal predecessors, (228), 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-09 01:23:29,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:29,597 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:29,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:23:29,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:29,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:29,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:29,798 INFO L85 PathProgramCache]: Analyzing trace with hash 751165242, now seen corresponding path program 1 times [2025-03-09 01:23:29,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:29,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391223022] [2025-03-09 01:23:29,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:29,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:23:29,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:23:29,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:29,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:23:29,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:29,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391223022] [2025-03-09 01:23:29,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391223022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:29,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131363804] [2025-03-09 01:23:29,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:29,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:29,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:29,900 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-09 01:23:29,902 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-09 01:23:29,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:23:29,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:23:29,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:29,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:29,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:23:29,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:23:30,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:23:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131363804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:30,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:30,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-09 01:23:30,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417979674] [2025-03-09 01:23:30,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:30,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:23:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:30,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:23:30,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:23:30,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:30,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 75 transitions, 392 flow. Second operand has 17 states, 17 states have (on average 13.705882352941176) internal successors, (233), 17 states have internal predecessors, (233), 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-09 01:23:30,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:30,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:30,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:34,085 INFO L124 PetriNetUnfolderBase]: 51896/71503 cut-off events. [2025-03-09 01:23:34,085 INFO L125 PetriNetUnfolderBase]: For 47194/47194 co-relation queries the response was YES. [2025-03-09 01:23:34,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180885 conditions, 71503 events. 51896/71503 cut-off events. For 47194/47194 co-relation queries the response was YES. Maximal size of possible extension queue 1656. Compared 439320 event pairs, 15998 based on Foata normal form. 780/62063 useless extension candidates. Maximal degree in co-relation 157066. Up to 18797 conditions per place. [2025-03-09 01:23:34,483 INFO L140 encePairwiseOnDemand]: 61/72 looper letters, 187 selfloop transitions, 20 changer transitions 4/215 dead transitions. [2025-03-09 01:23:34,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 215 transitions, 1328 flow [2025-03-09 01:23:34,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:23:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:23:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 313 transitions. [2025-03-09 01:23:34,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3952020202020202 [2025-03-09 01:23:34,484 INFO L175 Difference]: Start difference. First operand has 97 places, 75 transitions, 392 flow. Second operand 11 states and 313 transitions. [2025-03-09 01:23:34,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 215 transitions, 1328 flow [2025-03-09 01:23:34,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 215 transitions, 1316 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:34,513 INFO L231 Difference]: Finished difference. Result has 108 places, 84 transitions, 515 flow [2025-03-09 01:23:34,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=515, PETRI_PLACES=108, PETRI_TRANSITIONS=84} [2025-03-09 01:23:34,514 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 42 predicate places. [2025-03-09 01:23:34,514 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 84 transitions, 515 flow [2025-03-09 01:23:34,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.705882352941176) internal successors, (233), 17 states have internal predecessors, (233), 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-09 01:23:34,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:34,514 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:34,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:23:34,715 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,SelfDestructingSolverStorable11 [2025-03-09 01:23:34,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:34,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:34,715 INFO L85 PathProgramCache]: Analyzing trace with hash -745666718, now seen corresponding path program 2 times [2025-03-09 01:23:34,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:34,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109990717] [2025-03-09 01:23:34,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:34,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:34,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:23:34,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:23:34,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:23:34,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:23:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109990717] [2025-03-09 01:23:34,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109990717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:34,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:34,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031600638] [2025-03-09 01:23:34,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:34,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:34,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:34,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:34,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:34,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 84 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-09 01:23:34,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:34,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:34,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:38,964 INFO L124 PetriNetUnfolderBase]: 50283/69154 cut-off events. [2025-03-09 01:23:38,964 INFO L125 PetriNetUnfolderBase]: For 63869/63869 co-relation queries the response was YES. [2025-03-09 01:23:39,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183445 conditions, 69154 events. 50283/69154 cut-off events. For 63869/63869 co-relation queries the response was YES. Maximal size of possible extension queue 1681. Compared 440813 event pairs, 5099 based on Foata normal form. 0/59816 useless extension candidates. Maximal degree in co-relation 158376. Up to 60513 conditions per place. [2025-03-09 01:23:39,359 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 115 selfloop transitions, 9 changer transitions 0/128 dead transitions. [2025-03-09 01:23:39,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 128 transitions, 1009 flow [2025-03-09 01:23:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-09 01:23:39,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36944444444444446 [2025-03-09 01:23:39,360 INFO L175 Difference]: Start difference. First operand has 108 places, 84 transitions, 515 flow. Second operand 5 states and 133 transitions. [2025-03-09 01:23:39,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 128 transitions, 1009 flow [2025-03-09 01:23:39,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 128 transitions, 986 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-09 01:23:39,622 INFO L231 Difference]: Finished difference. Result has 107 places, 83 transitions, 510 flow [2025-03-09 01:23:39,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=107, PETRI_TRANSITIONS=83} [2025-03-09 01:23:39,623 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 41 predicate places. [2025-03-09 01:23:39,623 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 83 transitions, 510 flow [2025-03-09 01:23:39,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-09 01:23:39,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:39,623 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:39,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:23:39,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:39,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:39,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1327776123, now seen corresponding path program 2 times [2025-03-09 01:23:39,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:39,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347504387] [2025-03-09 01:23:39,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:39,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:39,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:23:39,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:23:39,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:23:39,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:23:39,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:39,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347504387] [2025-03-09 01:23:39,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347504387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:39,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:39,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:39,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562699767] [2025-03-09 01:23:39,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:39,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:39,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:39,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:39,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:39,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:39,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 83 transitions, 510 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-09 01:23:39,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:39,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:39,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:43,703 INFO L124 PetriNetUnfolderBase]: 47275/65263 cut-off events. [2025-03-09 01:23:43,703 INFO L125 PetriNetUnfolderBase]: For 63804/63804 co-relation queries the response was YES. [2025-03-09 01:23:43,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171629 conditions, 65263 events. 47275/65263 cut-off events. For 63804/63804 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 405938 event pairs, 18656 based on Foata normal form. 0/56973 useless extension candidates. Maximal degree in co-relation 146101. Up to 64604 conditions per place. [2025-03-09 01:23:44,036 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 87 selfloop transitions, 9 changer transitions 0/100 dead transitions. [2025-03-09 01:23:44,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 810 flow [2025-03-09 01:23:44,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-09 01:23:44,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3138888888888889 [2025-03-09 01:23:44,038 INFO L175 Difference]: Start difference. First operand has 107 places, 83 transitions, 510 flow. Second operand 5 states and 113 transitions. [2025-03-09 01:23:44,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 100 transitions, 810 flow [2025-03-09 01:23:44,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 792 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:23:44,114 INFO L231 Difference]: Finished difference. Result has 106 places, 81 transitions, 498 flow [2025-03-09 01:23:44,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=498, PETRI_PLACES=106, PETRI_TRANSITIONS=81} [2025-03-09 01:23:44,115 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 40 predicate places. [2025-03-09 01:23:44,115 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 81 transitions, 498 flow [2025-03-09 01:23:44,115 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-09 01:23:44,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:44,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:44,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:23:44,115 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:23:44,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1830273086, now seen corresponding path program 1 times [2025-03-09 01:23:44,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:44,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667588503] [2025-03-09 01:23:44,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:44,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:44,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:23:44,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:23:44,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:44,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:44,150 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-09 01:23:44,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:44,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667588503] [2025-03-09 01:23:44,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667588503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:44,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:23:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123065539] [2025-03-09 01:23:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:44,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:44,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:44,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:44,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-09 01:23:44,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 81 transitions, 498 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-09 01:23:44,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:44,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-09 01:23:44,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand