./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:00:20,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:00:20,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:00:20,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:00:20,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:00:20,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:00:20,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:00:20,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:00:20,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:00:20,732 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:00:20,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:00:20,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:00:20,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:00:20,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:00:20,733 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:00:20,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:00:20,733 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:00:20,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:00:20,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:00:20,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:00:20,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:20,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:20,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:20,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:20,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:00:20,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:20,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:20,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:20,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:20,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:00:20,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:00:20,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:00:20,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:00:20,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:00:20,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:00:20,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:00:20,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:00:20,736 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-jdk21/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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2025-01-10 01:00:20,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:00:20,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:00:20,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:00:20,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:00:20,954 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:00:20,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-01-10 01:00:22,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/161341aa8/66cfb239bf5c48bda5f1a229fc9a1b26/FLAGa14694e5b [2025-01-10 01:00:22,466 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:00:22,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-01-10 01:00:22,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/161341aa8/66cfb239bf5c48bda5f1a229fc9a1b26/FLAGa14694e5b [2025-01-10 01:00:22,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/161341aa8/66cfb239bf5c48bda5f1a229fc9a1b26 [2025-01-10 01:00:22,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:00:22,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:00:22,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:22,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:00:22,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:00:22,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f99ca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22, skipping insertion in model container [2025-01-10 01:00:22,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:00:22,865 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:00:22,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:22,873 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:00:22,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:22,898 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:00:22,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22 WrapperNode [2025-01-10 01:00:22,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:22,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:22,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:00:22,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:00:22,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,922 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 187 [2025-01-10 01:00:22,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:22,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:00:22,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:00:22,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:00:22,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,940 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-10 01:00:22,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:00:22,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:00:22,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:00:22,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:00:22,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (1/1) ... [2025-01-10 01:00:22,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:22,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:22,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:00:22,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:00:23,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:00:23,006 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:00:23,006 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:00:23,006 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:00:23,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:00:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:00:23,008 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:00:23,115 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:00:23,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:00:23,562 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:00:23,562 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:00:23,796 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:00:23,797 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:00:23,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:23 BoogieIcfgContainer [2025-01-10 01:00:23,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:00:23,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:00:23,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:00:23,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:00:23,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:00:22" (1/3) ... [2025-01-10 01:00:23,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf1c8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:23, skipping insertion in model container [2025-01-10 01:00:23,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:22" (2/3) ... [2025-01-10 01:00:23,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf1c8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:23, skipping insertion in model container [2025-01-10 01:00:23,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:23" (3/3) ... [2025-01-10 01:00:23,806 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-01-10 01:00:23,819 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:00:23,820 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 91 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-01-10 01:00:23,820 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:00:23,874 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:00:23,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 105 transitions, 231 flow [2025-01-10 01:00:23,946 INFO L124 PetriNetUnfolderBase]: 15/102 cut-off events. [2025-01-10 01:00:23,949 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:00:23,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 15/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 294 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-01-10 01:00:23,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 105 transitions, 231 flow [2025-01-10 01:00:23,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 101 transitions, 220 flow [2025-01-10 01:00:23,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:00:23,979 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;@3f0def3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:00:23,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-01-10 01:00:23,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:00:23,984 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:00:23,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:00:23,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:23,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:00:23,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:23,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:23,991 INFO L85 PathProgramCache]: Analyzing trace with hash 730326, now seen corresponding path program 1 times [2025-01-10 01:00:23,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:23,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389694609] [2025-01-10 01:00:23,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:23,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:24,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:00:24,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:00:24,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:24,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:24,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:24,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389694609] [2025-01-10 01:00:24,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389694609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:24,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:24,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:00:24,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256778434] [2025-01-10 01:00:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:24,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:24,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:24,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:24,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:24,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-01-10 01:00:24,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-01-10 01:00:24,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:24,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-01-10 01:00:24,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:24,616 INFO L124 PetriNetUnfolderBase]: 534/1059 cut-off events. [2025-01-10 01:00:24,617 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-01-10 01:00:24,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 1059 events. 534/1059 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6250 event pairs, 210 based on Foata normal form. 1/565 useless extension candidates. Maximal degree in co-relation 1547. Up to 662 conditions per place. [2025-01-10 01:00:24,636 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 35 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-01-10 01:00:24,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 284 flow [2025-01-10 01:00:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2025-01-10 01:00:24,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301 [2025-01-10 01:00:24,649 INFO L175 Difference]: Start difference. First operand has 96 places, 101 transitions, 220 flow. Second operand 3 states and 230 transitions. [2025-01-10 01:00:24,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 284 flow [2025-01-10 01:00:24,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 96 transitions, 272 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:00:24,658 INFO L231 Difference]: Finished difference. Result has 87 places, 96 transitions, 202 flow [2025-01-10 01:00:24,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=87, PETRI_TRANSITIONS=96} [2025-01-10 01:00:24,665 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -9 predicate places. [2025-01-10 01:00:24,666 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 202 flow [2025-01-10 01:00:24,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-01-10 01:00:24,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:24,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:00:24,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:00:24,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:24,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash 730327, now seen corresponding path program 1 times [2025-01-10 01:00:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:24,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109446041] [2025-01-10 01:00:24,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:24,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:00:24,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:00:24,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:24,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:24,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:24,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109446041] [2025-01-10 01:00:24,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109446041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:24,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:24,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:24,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789866417] [2025-01-10 01:00:24,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:24,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:24,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:24,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:24,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:25,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-01-10 01:00:25,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:25,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:25,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-01-10 01:00:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:25,215 INFO L124 PetriNetUnfolderBase]: 535/1062 cut-off events. [2025-01-10 01:00:25,216 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 01:00:25,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 1062 events. 535/1062 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6287 event pairs, 210 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 1727. Up to 675 conditions per place. [2025-01-10 01:00:25,223 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 39 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2025-01-10 01:00:25,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 99 transitions, 294 flow [2025-01-10 01:00:25,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 296 transitions. [2025-01-10 01:00:25,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2025-01-10 01:00:25,227 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 202 flow. Second operand 4 states and 296 transitions. [2025-01-10 01:00:25,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 99 transitions, 294 flow [2025-01-10 01:00:25,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 99 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:25,231 INFO L231 Difference]: Finished difference. Result has 90 places, 99 transitions, 225 flow [2025-01-10 01:00:25,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=90, PETRI_TRANSITIONS=99} [2025-01-10 01:00:25,232 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -6 predicate places. [2025-01-10 01:00:25,232 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 225 flow [2025-01-10 01:00:25,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:25,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:25,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:00:25,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:00:25,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:25,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash 22639670, now seen corresponding path program 1 times [2025-01-10 01:00:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:25,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3915380] [2025-01-10 01:00:25,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:25,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:00:25,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:00:25,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:25,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:25,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:25,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3915380] [2025-01-10 01:00:25,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3915380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:25,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:25,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:25,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713062185] [2025-01-10 01:00:25,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:25,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:25,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:25,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:25,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:25,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-01-10 01:00:25,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 99 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 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-01-10 01:00:25,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:25,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-01-10 01:00:25,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:25,781 INFO L124 PetriNetUnfolderBase]: 536/1065 cut-off events. [2025-01-10 01:00:25,781 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 01:00:25,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 1065 events. 536/1065 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6265 event pairs, 210 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 1756. Up to 674 conditions per place. [2025-01-10 01:00:25,789 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 39 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-01-10 01:00:25,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 323 flow [2025-01-10 01:00:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 362 transitions. [2025-01-10 01:00:25,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6895238095238095 [2025-01-10 01:00:25,791 INFO L175 Difference]: Start difference. First operand has 90 places, 99 transitions, 225 flow. Second operand 5 states and 362 transitions. [2025-01-10 01:00:25,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 323 flow [2025-01-10 01:00:25,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:25,793 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 259 flow [2025-01-10 01:00:25,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-01-10 01:00:25,793 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2025-01-10 01:00:25,793 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 259 flow [2025-01-10 01:00:25,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 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-01-10 01:00:25,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:25,794 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:00:25,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:00:25,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:25,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash 701867278, now seen corresponding path program 1 times [2025-01-10 01:00:25,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:25,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854020151] [2025-01-10 01:00:25,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:25,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:25,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:00:25,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:00:25,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:25,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:26,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854020151] [2025-01-10 01:00:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854020151] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403700891] [2025-01-10 01:00:26,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:26,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:26,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:26,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:26,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:00:26,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:00:26,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:00:26,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:26,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:26,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:00:26,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:26,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:00:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:26,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403700891] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:26,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:26,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:00:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116462803] [2025-01-10 01:00:26,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:26,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:00:26,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:26,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:00:26,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:00:26,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-01-10 01:00:26,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 259 flow. Second operand has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 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-01-10 01:00:26,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:26,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-01-10 01:00:26,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:27,134 INFO L124 PetriNetUnfolderBase]: 537/1067 cut-off events. [2025-01-10 01:00:27,134 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:00:27,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 1067 events. 537/1067 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6262 event pairs, 210 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 1766. Up to 675 conditions per place. [2025-01-10 01:00:27,141 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 38 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2025-01-10 01:00:27,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 366 flow [2025-01-10 01:00:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:00:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:00:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 551 transitions. [2025-01-10 01:00:27,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655952380952381 [2025-01-10 01:00:27,144 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 259 flow. Second operand 8 states and 551 transitions. [2025-01-10 01:00:27,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 366 flow [2025-01-10 01:00:27,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:27,147 INFO L231 Difference]: Finished difference. Result has 100 places, 104 transitions, 289 flow [2025-01-10 01:00:27,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=289, PETRI_PLACES=100, PETRI_TRANSITIONS=104} [2025-01-10 01:00:27,148 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2025-01-10 01:00:27,148 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 104 transitions, 289 flow [2025-01-10 01:00:27,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 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-01-10 01:00:27,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:27,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:00:27,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:27,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:27,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:27,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash 701833680, now seen corresponding path program 1 times [2025-01-10 01:00:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629085985] [2025-01-10 01:00:27,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:27,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:00:27,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:00:27,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:27,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:27,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:27,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629085985] [2025-01-10 01:00:27,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629085985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:27,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:27,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:27,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310578262] [2025-01-10 01:00:27,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:27,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:27,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:27,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:27,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:27,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-01-10 01:00:27,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 104 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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-01-10 01:00:27,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:27,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-01-10 01:00:27,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:27,763 INFO L124 PetriNetUnfolderBase]: 538/1070 cut-off events. [2025-01-10 01:00:27,763 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:00:27,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 1070 events. 538/1070 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6301 event pairs, 210 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 1774. Up to 679 conditions per place. [2025-01-10 01:00:27,771 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 42 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2025-01-10 01:00:27,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 107 transitions, 397 flow [2025-01-10 01:00:27,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2025-01-10 01:00:27,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6876190476190476 [2025-01-10 01:00:27,772 INFO L175 Difference]: Start difference. First operand has 100 places, 104 transitions, 289 flow. Second operand 5 states and 361 transitions. [2025-01-10 01:00:27,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 107 transitions, 397 flow [2025-01-10 01:00:27,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 107 transitions, 350 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 01:00:27,774 INFO L231 Difference]: Finished difference. Result has 98 places, 107 transitions, 285 flow [2025-01-10 01:00:27,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=98, PETRI_TRANSITIONS=107} [2025-01-10 01:00:27,775 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 2 predicate places. [2025-01-10 01:00:27,775 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 107 transitions, 285 flow [2025-01-10 01:00:27,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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-01-10 01:00:27,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:27,776 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:00:27,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:00:27,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:27,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 281908925, now seen corresponding path program 1 times [2025-01-10 01:00:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:27,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732734828] [2025-01-10 01:00:27,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:27,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:00:27,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:00:27,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:27,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:27,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:27,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732734828] [2025-01-10 01:00:27,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732734828] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:27,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540521680] [2025-01-10 01:00:27,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:27,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:27,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:27,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:27,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:00:27,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:00:28,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:00:28,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:28,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:28,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:00:28,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:28,021 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-01-10 01:00:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:28,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:28,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540521680] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:28,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:28,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:00:28,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211483524] [2025-01-10 01:00:28,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:28,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:00:28,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:28,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:00:28,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:00:29,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-01-10 01:00:29,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 107 transitions, 285 flow. Second operand has 13 states, 13 states have (on average 64.3076923076923) internal successors, (836), 13 states have internal predecessors, (836), 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-01-10 01:00:29,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:29,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-01-10 01:00:29,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:29,365 INFO L124 PetriNetUnfolderBase]: 538/1069 cut-off events. [2025-01-10 01:00:29,365 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-10 01:00:29,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 1069 events. 538/1069 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6304 event pairs, 210 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 1763. Up to 669 conditions per place. [2025-01-10 01:00:29,371 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 35 selfloop transitions, 15 changer transitions 0/106 dead transitions. [2025-01-10 01:00:29,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 106 transitions, 381 flow [2025-01-10 01:00:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:00:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:00:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 486 transitions. [2025-01-10 01:00:29,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612244897959184 [2025-01-10 01:00:29,373 INFO L175 Difference]: Start difference. First operand has 98 places, 107 transitions, 285 flow. Second operand 7 states and 486 transitions. [2025-01-10 01:00:29,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 106 transitions, 381 flow [2025-01-10 01:00:29,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 106 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:29,374 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 304 flow [2025-01-10 01:00:29,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2025-01-10 01:00:29,375 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-01-10 01:00:29,375 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 304 flow [2025-01-10 01:00:29,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.3076923076923) internal successors, (836), 13 states have internal predecessors, (836), 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-01-10 01:00:29,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:29,375 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:00:29,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:29,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:29,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:29,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:29,577 INFO L85 PathProgramCache]: Analyzing trace with hash 152325998, now seen corresponding path program 1 times [2025-01-10 01:00:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:29,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342406315] [2025-01-10 01:00:29,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:29,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:00:29,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:00:29,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:29,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:29,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:29,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342406315] [2025-01-10 01:00:29,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342406315] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:29,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103974859] [2025-01-10 01:00:29,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:29,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:29,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:29,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:29,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:00:29,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:00:29,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:00:29,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:29,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:29,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:00:29,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:29,858 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-01-10 01:00:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:30,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103974859] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:30,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:30,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:00:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242063339] [2025-01-10 01:00:30,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:30,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:00:30,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:30,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:00:30,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:00:30,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-01-10 01:00:30,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 304 flow. Second operand has 13 states, 13 states have (on average 64.46153846153847) internal successors, (838), 13 states have internal predecessors, (838), 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-01-10 01:00:30,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:30,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-01-10 01:00:30,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:31,105 INFO L124 PetriNetUnfolderBase]: 538/1068 cut-off events. [2025-01-10 01:00:31,105 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:00:31,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 1068 events. 538/1068 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6267 event pairs, 210 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 1765. Up to 669 conditions per place. [2025-01-10 01:00:31,111 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 31 selfloop transitions, 18 changer transitions 0/105 dead transitions. [2025-01-10 01:00:31,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 105 transitions, 398 flow [2025-01-10 01:00:31,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:00:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:00:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 485 transitions. [2025-01-10 01:00:31,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6598639455782312 [2025-01-10 01:00:31,112 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 304 flow. Second operand 7 states and 485 transitions. [2025-01-10 01:00:31,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 105 transitions, 398 flow [2025-01-10 01:00:31,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 105 transitions, 371 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 01:00:31,114 INFO L231 Difference]: Finished difference. Result has 101 places, 105 transitions, 309 flow [2025-01-10 01:00:31,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=101, PETRI_TRANSITIONS=105} [2025-01-10 01:00:31,114 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-01-10 01:00:31,116 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 105 transitions, 309 flow [2025-01-10 01:00:31,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.46153846153847) internal successors, (838), 13 states have internal predecessors, (838), 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-01-10 01:00:31,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:31,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:31,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:00:31,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:31,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:31,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash 430579421, now seen corresponding path program 1 times [2025-01-10 01:00:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735905508] [2025-01-10 01:00:31,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:31,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:00:31,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:00:31,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:31,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:31,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:31,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735905508] [2025-01-10 01:00:31,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735905508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:31,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:31,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:31,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628514894] [2025-01-10 01:00:31,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:31,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:31,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:31,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:31,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:31,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-01-10 01:00:31,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 105 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 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-01-10 01:00:31,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:31,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-01-10 01:00:31,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:31,558 INFO L124 PetriNetUnfolderBase]: 845/1767 cut-off events. [2025-01-10 01:00:31,558 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-10 01:00:31,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 1767 events. 845/1767 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11880 event pairs, 368 based on Foata normal form. 31/1032 useless extension candidates. Maximal degree in co-relation 2055. Up to 778 conditions per place. [2025-01-10 01:00:31,569 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 84 selfloop transitions, 3 changer transitions 0/142 dead transitions. [2025-01-10 01:00:31,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 142 transitions, 609 flow [2025-01-10 01:00:31,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 333 transitions. [2025-01-10 01:00:31,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7928571428571428 [2025-01-10 01:00:31,572 INFO L175 Difference]: Start difference. First operand has 101 places, 105 transitions, 309 flow. Second operand 4 states and 333 transitions. [2025-01-10 01:00:31,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 142 transitions, 609 flow [2025-01-10 01:00:31,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 142 transitions, 551 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 01:00:31,595 INFO L231 Difference]: Finished difference. Result has 99 places, 105 transitions, 282 flow [2025-01-10 01:00:31,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=99, PETRI_TRANSITIONS=105} [2025-01-10 01:00:31,596 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 3 predicate places. [2025-01-10 01:00:31,597 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 105 transitions, 282 flow [2025-01-10 01:00:31,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 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-01-10 01:00:31,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:31,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:31,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:00:31,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:31,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:31,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1212819717, now seen corresponding path program 1 times [2025-01-10 01:00:31,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:31,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811412347] [2025-01-10 01:00:31,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:31,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:31,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:00:31,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:00:31,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:31,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811412347] [2025-01-10 01:00:31,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811412347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:31,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:31,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634534400] [2025-01-10 01:00:31,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:31,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:31,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:31,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:31,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:31,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-01-10 01:00:31,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 105 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-01-10 01:00:31,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:31,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-01-10 01:00:31,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:31,920 INFO L124 PetriNetUnfolderBase]: 1757/3644 cut-off events. [2025-01-10 01:00:31,921 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-01-10 01:00:31,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6153 conditions, 3644 events. 1757/3644 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 27910 event pairs, 543 based on Foata normal form. 31/2147 useless extension candidates. Maximal degree in co-relation 4412. Up to 937 conditions per place. [2025-01-10 01:00:31,941 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 99 selfloop transitions, 9 changer transitions 0/163 dead transitions. [2025-01-10 01:00:31,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 163 transitions, 637 flow [2025-01-10 01:00:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:00:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:00:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 490 transitions. [2025-01-10 01:00:31,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-01-10 01:00:31,942 INFO L175 Difference]: Start difference. First operand has 99 places, 105 transitions, 282 flow. Second operand 6 states and 490 transitions. [2025-01-10 01:00:31,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 163 transitions, 637 flow [2025-01-10 01:00:31,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 163 transitions, 632 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:31,945 INFO L231 Difference]: Finished difference. Result has 105 places, 108 transitions, 323 flow [2025-01-10 01:00:31,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=105, PETRI_TRANSITIONS=108} [2025-01-10 01:00:31,945 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 9 predicate places. [2025-01-10 01:00:31,945 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 323 flow [2025-01-10 01:00:31,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-01-10 01:00:31,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:31,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:31,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:00:31,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:31,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:31,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1394443886, now seen corresponding path program 1 times [2025-01-10 01:00:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:31,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272200172] [2025-01-10 01:00:31,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:31,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:31,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:00:31,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:00:31,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:31,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:31,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:31,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272200172] [2025-01-10 01:00:31,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272200172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:31,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:31,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273479718] [2025-01-10 01:00:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:31,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:31,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:31,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:32,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-01-10 01:00:32,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 323 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-01-10 01:00:32,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:32,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-01-10 01:00:32,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:32,256 INFO L124 PetriNetUnfolderBase]: 1360/2908 cut-off events. [2025-01-10 01:00:32,257 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-01-10 01:00:32,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5019 conditions, 2908 events. 1360/2908 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 21682 event pairs, 678 based on Foata normal form. 36/1896 useless extension candidates. Maximal degree in co-relation 3160. Up to 1555 conditions per place. [2025-01-10 01:00:32,268 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 72 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2025-01-10 01:00:32,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 135 transitions, 550 flow [2025-01-10 01:00:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:00:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:00:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 461 transitions. [2025-01-10 01:00:32,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7317460317460317 [2025-01-10 01:00:32,270 INFO L175 Difference]: Start difference. First operand has 105 places, 108 transitions, 323 flow. Second operand 6 states and 461 transitions. [2025-01-10 01:00:32,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 135 transitions, 550 flow [2025-01-10 01:00:32,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 135 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:32,272 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 341 flow [2025-01-10 01:00:32,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=341, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2025-01-10 01:00:32,273 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 14 predicate places. [2025-01-10 01:00:32,273 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 341 flow [2025-01-10 01:00:32,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-01-10 01:00:32,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:32,273 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:32,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:00:32,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:32,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:32,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1014090188, now seen corresponding path program 1 times [2025-01-10 01:00:32,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:32,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312676280] [2025-01-10 01:00:32,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:32,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:32,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:00:32,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:00:32,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:32,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:00:32,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312676280] [2025-01-10 01:00:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312676280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:32,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:32,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062022740] [2025-01-10 01:00:32,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:32,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:32,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:32,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:32,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2025-01-10 01:00:32,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-01-10 01:00:32,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:32,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2025-01-10 01:00:32,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:32,629 INFO L124 PetriNetUnfolderBase]: 1752/3145 cut-off events. [2025-01-10 01:00:32,629 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-01-10 01:00:32,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5750 conditions, 3145 events. 1752/3145 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20964 event pairs, 905 based on Foata normal form. 0/2268 useless extension candidates. Maximal degree in co-relation 3886. Up to 2307 conditions per place. [2025-01-10 01:00:32,638 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 49 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2025-01-10 01:00:32,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 445 flow [2025-01-10 01:00:32,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 320 transitions. [2025-01-10 01:00:32,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2025-01-10 01:00:32,640 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 341 flow. Second operand 5 states and 320 transitions. [2025-01-10 01:00:32,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 445 flow [2025-01-10 01:00:32,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 431 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:00:32,641 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 333 flow [2025-01-10 01:00:32,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2025-01-10 01:00:32,643 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2025-01-10 01:00:32,643 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 333 flow [2025-01-10 01:00:32,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-01-10 01:00:32,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:32,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:32,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:00:32,643 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:32,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1014090189, now seen corresponding path program 1 times [2025-01-10 01:00:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:32,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269694619] [2025-01-10 01:00:32,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:32,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:00:32,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:00:32,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:32,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:32,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:32,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269694619] [2025-01-10 01:00:32,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269694619] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108538122] [2025-01-10 01:00:32,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:32,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:32,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:32,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:00:32,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:00:32,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:00:32,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:32,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:32,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:00:32,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:32,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:32,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:00:32,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:32,935 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:00:32,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:00:32,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:00:32,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:32,974 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:00:32,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:00:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:33,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:33,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 111 [2025-01-10 01:00:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108538122] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:33,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:33,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-10 01:00:33,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366622602] [2025-01-10 01:00:33,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:33,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:00:33,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:33,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:00:33,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:00:34,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2025-01-10 01:00:34,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 333 flow. Second operand has 14 states, 14 states have (on average 55.142857142857146) internal successors, (772), 14 states have internal predecessors, (772), 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-01-10 01:00:34,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:34,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2025-01-10 01:00:34,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:34,716 INFO L124 PetriNetUnfolderBase]: 2089/3802 cut-off events. [2025-01-10 01:00:34,716 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-01-10 01:00:34,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6908 conditions, 3802 events. 2089/3802 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 26274 event pairs, 799 based on Foata normal form. 0/2719 useless extension candidates. Maximal degree in co-relation 4963. Up to 1149 conditions per place. [2025-01-10 01:00:34,731 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 106 selfloop transitions, 22 changer transitions 0/174 dead transitions. [2025-01-10 01:00:34,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 174 transitions, 795 flow [2025-01-10 01:00:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:00:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:00:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 548 transitions. [2025-01-10 01:00:34,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-01-10 01:00:34,732 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 333 flow. Second operand 8 states and 548 transitions. [2025-01-10 01:00:34,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 174 transitions, 795 flow [2025-01-10 01:00:34,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 174 transitions, 781 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:34,735 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 443 flow [2025-01-10 01:00:34,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=443, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2025-01-10 01:00:34,735 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2025-01-10 01:00:34,735 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 443 flow [2025-01-10 01:00:34,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 55.142857142857146) internal successors, (772), 14 states have internal predecessors, (772), 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-01-10 01:00:34,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:34,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:34,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:34,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:00:34,936 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:34,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash 4832385, now seen corresponding path program 1 times [2025-01-10 01:00:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:34,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813965551] [2025-01-10 01:00:34,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:34,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:34,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:00:34,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:00:34,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:34,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813965551] [2025-01-10 01:00:34,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813965551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:34,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:34,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:34,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687890963] [2025-01-10 01:00:34,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:34,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:34,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:34,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:35,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-01-10 01:00:35,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 443 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:35,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:35,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-01-10 01:00:35,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:35,169 INFO L124 PetriNetUnfolderBase]: 1363/2541 cut-off events. [2025-01-10 01:00:35,169 INFO L125 PetriNetUnfolderBase]: For 589/625 co-relation queries the response was YES. [2025-01-10 01:00:35,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 2541 events. 1363/2541 cut-off events. For 589/625 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16719 event pairs, 735 based on Foata normal form. 32/1885 useless extension candidates. Maximal degree in co-relation 3626. Up to 1608 conditions per place. [2025-01-10 01:00:35,204 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 87 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-01-10 01:00:35,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 143 transitions, 707 flow [2025-01-10 01:00:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2025-01-10 01:00:35,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7880952380952381 [2025-01-10 01:00:35,207 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 443 flow. Second operand 4 states and 331 transitions. [2025-01-10 01:00:35,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 143 transitions, 707 flow [2025-01-10 01:00:35,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 143 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:00:35,210 INFO L231 Difference]: Finished difference. Result has 117 places, 113 transitions, 452 flow [2025-01-10 01:00:35,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=452, PETRI_PLACES=117, PETRI_TRANSITIONS=113} [2025-01-10 01:00:35,212 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 21 predicate places. [2025-01-10 01:00:35,212 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 113 transitions, 452 flow [2025-01-10 01:00:35,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:35,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:35,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:35,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:00:35,212 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:35,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:35,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1960404917, now seen corresponding path program 1 times [2025-01-10 01:00:35,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:35,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187380907] [2025-01-10 01:00:35,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:35,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:35,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:00:35,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:00:35,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:35,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:35,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:35,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187380907] [2025-01-10 01:00:35,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187380907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:35,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:35,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:35,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693636581] [2025-01-10 01:00:35,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:35,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:35,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:35,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:35,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:35,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-01-10 01:00:35,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 113 transitions, 452 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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-01-10 01:00:35,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:35,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-01-10 01:00:35,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:35,556 INFO L124 PetriNetUnfolderBase]: 1860/4112 cut-off events. [2025-01-10 01:00:35,557 INFO L125 PetriNetUnfolderBase]: For 1080/1129 co-relation queries the response was YES. [2025-01-10 01:00:35,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7687 conditions, 4112 events. 1860/4112 cut-off events. For 1080/1129 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 33036 event pairs, 1038 based on Foata normal form. 74/3053 useless extension candidates. Maximal degree in co-relation 6325. Up to 1839 conditions per place. [2025-01-10 01:00:35,573 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 74 selfloop transitions, 12 changer transitions 0/139 dead transitions. [2025-01-10 01:00:35,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 139 transitions, 694 flow [2025-01-10 01:00:35,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2025-01-10 01:00:35,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7466666666666667 [2025-01-10 01:00:35,575 INFO L175 Difference]: Start difference. First operand has 117 places, 113 transitions, 452 flow. Second operand 5 states and 392 transitions. [2025-01-10 01:00:35,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 139 transitions, 694 flow [2025-01-10 01:00:35,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 139 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:35,578 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 477 flow [2025-01-10 01:00:35,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=477, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2025-01-10 01:00:35,579 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 24 predicate places. [2025-01-10 01:00:35,579 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 477 flow [2025-01-10 01:00:35,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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-01-10 01:00:35,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:35,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:35,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:00:35,580 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:35,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1372025498, now seen corresponding path program 1 times [2025-01-10 01:00:35,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:35,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72362284] [2025-01-10 01:00:35,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:35,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:00:35,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:00:35,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:35,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:00:35,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:35,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72362284] [2025-01-10 01:00:35,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72362284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:35,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:35,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:35,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135840197] [2025-01-10 01:00:35,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:35,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:35,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:35,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:35,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:35,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 105 [2025-01-10 01:00:35,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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-01-10 01:00:35,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:35,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 105 [2025-01-10 01:00:35,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:36,024 INFO L124 PetriNetUnfolderBase]: 2594/5031 cut-off events. [2025-01-10 01:00:36,024 INFO L125 PetriNetUnfolderBase]: For 970/970 co-relation queries the response was YES. [2025-01-10 01:00:36,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9812 conditions, 5031 events. 2594/5031 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 37746 event pairs, 1476 based on Foata normal form. 0/4038 useless extension candidates. Maximal degree in co-relation 7585. Up to 3534 conditions per place. [2025-01-10 01:00:36,046 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 52 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2025-01-10 01:00:36,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 109 transitions, 593 flow [2025-01-10 01:00:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 324 transitions. [2025-01-10 01:00:36,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2025-01-10 01:00:36,047 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 477 flow. Second operand 5 states and 324 transitions. [2025-01-10 01:00:36,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 109 transitions, 593 flow [2025-01-10 01:00:36,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 109 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:36,053 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 480 flow [2025-01-10 01:00:36,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=480, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2025-01-10 01:00:36,053 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 22 predicate places. [2025-01-10 01:00:36,053 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 480 flow [2025-01-10 01:00:36,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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-01-10 01:00:36,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:36,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:36,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:00:36,054 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:36,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1372025499, now seen corresponding path program 1 times [2025-01-10 01:00:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:36,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510784571] [2025-01-10 01:00:36,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:36,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:00:36,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:00:36,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:36,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:36,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:36,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510784571] [2025-01-10 01:00:36,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510784571] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:36,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667335113] [2025-01-10 01:00:36,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:36,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:36,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:36,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:36,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:00:36,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:00:36,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:00:36,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:36,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:36,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:00:36,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:36,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:36,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:00:36,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:36,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:00:36,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:00:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:36,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:36,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-01-10 01:00:36,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:00:36,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39 [2025-01-10 01:00:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:36,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667335113] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:36,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:36,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:00:36,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264901761] [2025-01-10 01:00:36,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:36,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:00:36,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:36,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:00:36,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:00:37,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 105 [2025-01-10 01:00:37,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 480 flow. Second operand has 12 states, 12 states have (on average 62.0) internal successors, (744), 12 states have internal predecessors, (744), 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-01-10 01:00:37,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:37,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 105 [2025-01-10 01:00:37,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:37,834 INFO L124 PetriNetUnfolderBase]: 2452/4710 cut-off events. [2025-01-10 01:00:37,834 INFO L125 PetriNetUnfolderBase]: For 700/700 co-relation queries the response was YES. [2025-01-10 01:00:37,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9165 conditions, 4710 events. 2452/4710 cut-off events. For 700/700 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 34926 event pairs, 620 based on Foata normal form. 0/3505 useless extension candidates. Maximal degree in co-relation 6959. Up to 1191 conditions per place. [2025-01-10 01:00:37,851 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 123 selfloop transitions, 25 changer transitions 0/195 dead transitions. [2025-01-10 01:00:37,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 195 transitions, 984 flow [2025-01-10 01:00:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:00:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:00:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 740 transitions. [2025-01-10 01:00:37,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2025-01-10 01:00:37,855 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 480 flow. Second operand 10 states and 740 transitions. [2025-01-10 01:00:37,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 195 transitions, 984 flow [2025-01-10 01:00:37,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 195 transitions, 968 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:37,859 INFO L231 Difference]: Finished difference. Result has 128 places, 114 transitions, 568 flow [2025-01-10 01:00:37,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=568, PETRI_PLACES=128, PETRI_TRANSITIONS=114} [2025-01-10 01:00:37,860 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 32 predicate places. [2025-01-10 01:00:37,860 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 114 transitions, 568 flow [2025-01-10 01:00:37,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 62.0) internal successors, (744), 12 states have internal predecessors, (744), 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-01-10 01:00:37,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:37,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:37,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:00:38,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 01:00:38,061 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:38,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1657219304, now seen corresponding path program 1 times [2025-01-10 01:00:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619906080] [2025-01-10 01:00:38,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:38,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:00:38,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:38,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:38,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:38,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619906080] [2025-01-10 01:00:38,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619906080] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148033459] [2025-01-10 01:00:38,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:38,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:38,216 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:38,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:00:38,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:00:38,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:38,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:38,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:38,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:00:38,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:38,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:38,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:00:38,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:38,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:00:38,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:00:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:38,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:38,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-01-10 01:00:38,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:00:38,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39 [2025-01-10 01:00:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:38,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148033459] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:38,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:38,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:00:38,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214559587] [2025-01-10 01:00:38,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:38,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:00:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:38,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:00:38,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:00:39,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 105 [2025-01-10 01:00:39,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 114 transitions, 568 flow. Second operand has 12 states, 12 states have (on average 61.833333333333336) internal successors, (742), 12 states have internal predecessors, (742), 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-01-10 01:00:39,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:39,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 105 [2025-01-10 01:00:39,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:40,001 INFO L124 PetriNetUnfolderBase]: 3361/6823 cut-off events. [2025-01-10 01:00:40,001 INFO L125 PetriNetUnfolderBase]: For 4445/4655 co-relation queries the response was YES. [2025-01-10 01:00:40,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13522 conditions, 6823 events. 3361/6823 cut-off events. For 4445/4655 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 55795 event pairs, 961 based on Foata normal form. 0/5121 useless extension candidates. Maximal degree in co-relation 11840. Up to 1932 conditions per place. [2025-01-10 01:00:40,028 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 125 selfloop transitions, 25 changer transitions 0/197 dead transitions. [2025-01-10 01:00:40,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 197 transitions, 1110 flow [2025-01-10 01:00:40,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:00:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:00:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 726 transitions. [2025-01-10 01:00:40,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2025-01-10 01:00:40,030 INFO L175 Difference]: Start difference. First operand has 128 places, 114 transitions, 568 flow. Second operand 10 states and 726 transitions. [2025-01-10 01:00:40,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 197 transitions, 1110 flow [2025-01-10 01:00:40,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 197 transitions, 1047 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-01-10 01:00:40,034 INFO L231 Difference]: Finished difference. Result has 135 places, 118 transitions, 603 flow [2025-01-10 01:00:40,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=603, PETRI_PLACES=135, PETRI_TRANSITIONS=118} [2025-01-10 01:00:40,034 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 39 predicate places. [2025-01-10 01:00:40,034 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 118 transitions, 603 flow [2025-01-10 01:00:40,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 61.833333333333336) internal successors, (742), 12 states have internal predecessors, (742), 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-01-10 01:00:40,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:40,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:40,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:00:40,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:00:40,239 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:40,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1846970922, now seen corresponding path program 1 times [2025-01-10 01:00:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:40,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352221423] [2025-01-10 01:00:40,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:40,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:00:40,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:40,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:40,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:40,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352221423] [2025-01-10 01:00:40,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352221423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:40,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:40,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:40,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222438125] [2025-01-10 01:00:40,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:40,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:40,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:40,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:40,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:40,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-01-10 01:00:40,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 118 transitions, 603 flow. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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-01-10 01:00:40,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:40,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-01-10 01:00:40,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:40,788 INFO L124 PetriNetUnfolderBase]: 3448/7423 cut-off events. [2025-01-10 01:00:40,788 INFO L125 PetriNetUnfolderBase]: For 3873/4202 co-relation queries the response was YES. [2025-01-10 01:00:40,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14926 conditions, 7423 events. 3448/7423 cut-off events. For 3873/4202 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 64008 event pairs, 1441 based on Foata normal form. 48/5996 useless extension candidates. Maximal degree in co-relation 13096. Up to 2638 conditions per place. [2025-01-10 01:00:40,816 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 105 selfloop transitions, 13 changer transitions 0/171 dead transitions. [2025-01-10 01:00:40,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 171 transitions, 1016 flow [2025-01-10 01:00:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2025-01-10 01:00:40,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7866666666666666 [2025-01-10 01:00:40,817 INFO L175 Difference]: Start difference. First operand has 135 places, 118 transitions, 603 flow. Second operand 5 states and 413 transitions. [2025-01-10 01:00:40,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 171 transitions, 1016 flow [2025-01-10 01:00:40,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 171 transitions, 985 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:00:40,822 INFO L231 Difference]: Finished difference. Result has 137 places, 119 transitions, 617 flow [2025-01-10 01:00:40,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=617, PETRI_PLACES=137, PETRI_TRANSITIONS=119} [2025-01-10 01:00:40,822 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 41 predicate places. [2025-01-10 01:00:40,822 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 119 transitions, 617 flow [2025-01-10 01:00:40,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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-01-10 01:00:40,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:40,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:40,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:00:40,823 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:40,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash 165809851, now seen corresponding path program 1 times [2025-01-10 01:00:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126594274] [2025-01-10 01:00:40,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:40,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:00:40,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:00:40,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:40,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:40,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:40,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126594274] [2025-01-10 01:00:40,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126594274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:40,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:40,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:40,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863475472] [2025-01-10 01:00:40,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:40,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:40,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:40,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:40,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 105 [2025-01-10 01:00:40,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 119 transitions, 617 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:40,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:40,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 105 [2025-01-10 01:00:40,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:41,329 INFO L124 PetriNetUnfolderBase]: 4293/8633 cut-off events. [2025-01-10 01:00:41,330 INFO L125 PetriNetUnfolderBase]: For 4729/5021 co-relation queries the response was YES. [2025-01-10 01:00:41,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18598 conditions, 8633 events. 4293/8633 cut-off events. For 4729/5021 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 72261 event pairs, 2943 based on Foata normal form. 0/7959 useless extension candidates. Maximal degree in co-relation 16785. Up to 6197 conditions per place. [2025-01-10 01:00:41,364 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 58 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-01-10 01:00:41,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 115 transitions, 743 flow [2025-01-10 01:00:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2025-01-10 01:00:41,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6452380952380953 [2025-01-10 01:00:41,365 INFO L175 Difference]: Start difference. First operand has 137 places, 119 transitions, 617 flow. Second operand 4 states and 271 transitions. [2025-01-10 01:00:41,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 115 transitions, 743 flow [2025-01-10 01:00:41,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 115 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:41,372 INFO L231 Difference]: Finished difference. Result has 134 places, 115 transitions, 614 flow [2025-01-10 01:00:41,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=614, PETRI_PLACES=134, PETRI_TRANSITIONS=115} [2025-01-10 01:00:41,373 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 38 predicate places. [2025-01-10 01:00:41,373 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 115 transitions, 614 flow [2025-01-10 01:00:41,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:41,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:41,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:41,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:00:41,374 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:41,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:41,375 INFO L85 PathProgramCache]: Analyzing trace with hash 165809852, now seen corresponding path program 1 times [2025-01-10 01:00:41,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:41,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633230459] [2025-01-10 01:00:41,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:41,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:00:41,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:00:41,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:41,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633230459] [2025-01-10 01:00:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633230459] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956002781] [2025-01-10 01:00:41,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:41,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:41,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:41,513 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:41,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:00:41,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:00:41,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:00:41,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:41,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:41,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:00:41,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:41,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:41,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 01:00:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956002781] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:41,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:41,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:00:41,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132718002] [2025-01-10 01:00:41,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:41,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:00:41,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:41,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:00:41,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:00:42,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-01-10 01:00:42,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 115 transitions, 614 flow. Second operand has 12 states, 12 states have (on average 65.33333333333333) internal successors, (784), 12 states have internal predecessors, (784), 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-01-10 01:00:42,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:42,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-01-10 01:00:42,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:42,718 INFO L124 PetriNetUnfolderBase]: 4131/7868 cut-off events. [2025-01-10 01:00:42,718 INFO L125 PetriNetUnfolderBase]: For 4492/4772 co-relation queries the response was YES. [2025-01-10 01:00:42,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17279 conditions, 7868 events. 4131/7868 cut-off events. For 4492/4772 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 62497 event pairs, 1199 based on Foata normal form. 0/6968 useless extension candidates. Maximal degree in co-relation 15491. Up to 2179 conditions per place. [2025-01-10 01:00:42,747 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 126 selfloop transitions, 25 changer transitions 0/198 dead transitions. [2025-01-10 01:00:42,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 198 transitions, 1176 flow [2025-01-10 01:00:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:00:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:00:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 631 transitions. [2025-01-10 01:00:42,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511904761904762 [2025-01-10 01:00:42,749 INFO L175 Difference]: Start difference. First operand has 134 places, 115 transitions, 614 flow. Second operand 8 states and 631 transitions. [2025-01-10 01:00:42,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 198 transitions, 1176 flow [2025-01-10 01:00:42,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 198 transitions, 1166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:42,756 INFO L231 Difference]: Finished difference. Result has 143 places, 118 transitions, 690 flow [2025-01-10 01:00:42,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=690, PETRI_PLACES=143, PETRI_TRANSITIONS=118} [2025-01-10 01:00:42,756 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 47 predicate places. [2025-01-10 01:00:42,756 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 118 transitions, 690 flow [2025-01-10 01:00:42,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.33333333333333) internal successors, (784), 12 states have internal predecessors, (784), 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-01-10 01:00:42,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:42,757 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:42,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:42,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:42,958 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:42,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1191405582, now seen corresponding path program 1 times [2025-01-10 01:00:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:42,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383776951] [2025-01-10 01:00:42,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:42,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:00:42,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:00:42,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:42,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:43,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383776951] [2025-01-10 01:00:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383776951] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999483817] [2025-01-10 01:00:43,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:43,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:43,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:43,026 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:43,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:00:43,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:00:43,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:00:43,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:43,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:43,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:00:43,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:43,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999483817] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:43,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:43,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-01-10 01:00:43,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200675707] [2025-01-10 01:00:43,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:43,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:00:43,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:43,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:00:43,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:00:43,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-01-10 01:00:43,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 118 transitions, 690 flow. Second operand has 15 states, 15 states have (on average 67.4) internal successors, (1011), 15 states have internal predecessors, (1011), 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-01-10 01:00:43,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:43,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-01-10 01:00:43,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:45,357 INFO L124 PetriNetUnfolderBase]: 10122/19964 cut-off events. [2025-01-10 01:00:45,357 INFO L125 PetriNetUnfolderBase]: For 22127/23931 co-relation queries the response was YES. [2025-01-10 01:00:45,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45337 conditions, 19964 events. 10122/19964 cut-off events. For 22127/23931 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 186835 event pairs, 3779 based on Foata normal form. 342/18189 useless extension candidates. Maximal degree in co-relation 42198. Up to 2728 conditions per place. [2025-01-10 01:00:45,441 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 399 selfloop transitions, 74 changer transitions 0/523 dead transitions. [2025-01-10 01:00:45,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 523 transitions, 3355 flow [2025-01-10 01:00:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-10 01:00:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-01-10 01:00:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 3414 transitions. [2025-01-10 01:00:45,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7068322981366459 [2025-01-10 01:00:45,445 INFO L175 Difference]: Start difference. First operand has 143 places, 118 transitions, 690 flow. Second operand 46 states and 3414 transitions. [2025-01-10 01:00:45,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 523 transitions, 3355 flow [2025-01-10 01:00:45,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 523 transitions, 3277 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:45,469 INFO L231 Difference]: Finished difference. Result has 200 places, 179 transitions, 1371 flow [2025-01-10 01:00:45,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1371, PETRI_PLACES=200, PETRI_TRANSITIONS=179} [2025-01-10 01:00:45,470 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 104 predicate places. [2025-01-10 01:00:45,470 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 179 transitions, 1371 flow [2025-01-10 01:00:45,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 67.4) internal successors, (1011), 15 states have internal predecessors, (1011), 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-01-10 01:00:45,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:45,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:45,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:45,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:45,673 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:45,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:45,673 INFO L85 PathProgramCache]: Analyzing trace with hash 735553676, now seen corresponding path program 1 times [2025-01-10 01:00:45,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:45,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512271370] [2025-01-10 01:00:45,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:45,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:45,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:00:45,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:00:45,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:45,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:45,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:45,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512271370] [2025-01-10 01:00:45,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512271370] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:45,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62920185] [2025-01-10 01:00:45,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:45,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:45,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:45,894 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:45,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:00:45,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:00:45,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:00:45,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:45,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:45,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:00:45,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:45,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:46,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:00:46,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:46,014 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:00:46,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:00:46,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:00:46,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:46,042 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:00:46,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:00:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:46,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:46,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 183 [2025-01-10 01:00:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62920185] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:46,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:46,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-01-10 01:00:46,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016962060] [2025-01-10 01:00:46,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:46,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:00:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:46,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:00:46,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:00:49,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:00:53,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:00:53,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2025-01-10 01:00:53,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 179 transitions, 1371 flow. Second operand has 15 states, 15 states have (on average 55.8) internal successors, (837), 15 states have internal predecessors, (837), 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-01-10 01:00:53,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:53,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2025-01-10 01:00:53,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:55,819 INFO L124 PetriNetUnfolderBase]: 14871/28394 cut-off events. [2025-01-10 01:00:55,820 INFO L125 PetriNetUnfolderBase]: For 36326/38678 co-relation queries the response was YES. [2025-01-10 01:00:55,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66186 conditions, 28394 events. 14871/28394 cut-off events. For 36326/38678 co-relation queries the response was YES. Maximal size of possible extension queue 1392. Compared 270383 event pairs, 6761 based on Foata normal form. 0/25428 useless extension candidates. Maximal degree in co-relation 65797. Up to 9327 conditions per place. [2025-01-10 01:00:56,141 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 169 selfloop transitions, 42 changer transitions 0/254 dead transitions. [2025-01-10 01:00:56,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 254 transitions, 2161 flow [2025-01-10 01:00:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:00:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:00:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 544 transitions. [2025-01-10 01:00:56,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2025-01-10 01:00:56,143 INFO L175 Difference]: Start difference. First operand has 200 places, 179 transitions, 1371 flow. Second operand 8 states and 544 transitions. [2025-01-10 01:00:56,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 254 transitions, 2161 flow [2025-01-10 01:00:56,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 254 transitions, 2122 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:00:56,184 INFO L231 Difference]: Finished difference. Result has 204 places, 181 transitions, 1458 flow [2025-01-10 01:00:56,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1458, PETRI_PLACES=204, PETRI_TRANSITIONS=181} [2025-01-10 01:00:56,185 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 108 predicate places. [2025-01-10 01:00:56,185 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 181 transitions, 1458 flow [2025-01-10 01:00:56,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 55.8) internal successors, (837), 15 states have internal predecessors, (837), 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-01-10 01:00:56,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:56,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:56,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:56,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:56,390 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:56,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1327328212, now seen corresponding path program 1 times [2025-01-10 01:00:56,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:56,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182426126] [2025-01-10 01:00:56,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:56,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:56,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:00:56,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:00:56,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:56,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:56,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182426126] [2025-01-10 01:00:56,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182426126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515451239] [2025-01-10 01:00:56,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:56,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:56,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:56,498 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:56,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:00:56,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:00:56,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:00:56,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:56,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:56,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:00:56,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:56,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:56,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 01:00:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:56,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515451239] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:56,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:56,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:00:56,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061577969] [2025-01-10 01:00:56,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:56,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:00:56,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:56,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:00:56,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:00:57,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-01-10 01:00:57,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 181 transitions, 1458 flow. Second operand has 12 states, 12 states have (on average 65.83333333333333) internal successors, (790), 12 states have internal predecessors, (790), 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-01-10 01:00:57,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:57,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-01-10 01:00:57,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:58,979 INFO L124 PetriNetUnfolderBase]: 12681/24822 cut-off events. [2025-01-10 01:00:58,980 INFO L125 PetriNetUnfolderBase]: For 41100/44533 co-relation queries the response was YES. [2025-01-10 01:00:59,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60349 conditions, 24822 events. 12681/24822 cut-off events. For 41100/44533 co-relation queries the response was YES. Maximal size of possible extension queue 1275. Compared 240776 event pairs, 4004 based on Foata normal form. 0/22851 useless extension candidates. Maximal degree in co-relation 59952. Up to 7361 conditions per place. [2025-01-10 01:00:59,101 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 176 selfloop transitions, 43 changer transitions 0/269 dead transitions. [2025-01-10 01:00:59,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 269 transitions, 2313 flow [2025-01-10 01:00:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:00:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:00:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 624 transitions. [2025-01-10 01:00:59,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2025-01-10 01:00:59,103 INFO L175 Difference]: Start difference. First operand has 204 places, 181 transitions, 1458 flow. Second operand 8 states and 624 transitions. [2025-01-10 01:00:59,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 269 transitions, 2313 flow [2025-01-10 01:00:59,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 269 transitions, 2255 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:00:59,165 INFO L231 Difference]: Finished difference. Result has 211 places, 184 transitions, 1531 flow [2025-01-10 01:00:59,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1531, PETRI_PLACES=211, PETRI_TRANSITIONS=184} [2025-01-10 01:00:59,167 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 115 predicate places. [2025-01-10 01:00:59,167 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 184 transitions, 1531 flow [2025-01-10 01:00:59,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.83333333333333) internal successors, (790), 12 states have internal predecessors, (790), 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-01-10 01:00:59,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:59,168 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:59,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:00:59,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 01:00:59,369 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:00:59,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash 429633150, now seen corresponding path program 1 times [2025-01-10 01:00:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:59,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832913749] [2025-01-10 01:00:59,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:59,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:59,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:00:59,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:00:59,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:59,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:59,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832913749] [2025-01-10 01:00:59,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832913749] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845635704] [2025-01-10 01:00:59,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:59,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:59,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:59,541 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:59,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:00:59,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:00:59,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:00:59,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:59,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:59,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:00:59,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:59,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:00:59,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845635704] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:59,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:59,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 01:00:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600051167] [2025-01-10 01:00:59,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:59,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:00:59,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:59,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:00:59,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:00:59,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-01-10 01:00:59,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 184 transitions, 1531 flow. Second operand has 15 states, 15 states have (on average 67.66666666666667) internal successors, (1015), 15 states have internal predecessors, (1015), 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-01-10 01:00:59,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:59,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-01-10 01:00:59,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:03,475 INFO L124 PetriNetUnfolderBase]: 17214/35005 cut-off events. [2025-01-10 01:01:03,475 INFO L125 PetriNetUnfolderBase]: For 69827/75019 co-relation queries the response was YES. [2025-01-10 01:01:03,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89318 conditions, 35005 events. 17214/35005 cut-off events. For 69827/75019 co-relation queries the response was YES. Maximal size of possible extension queue 1667. Compared 364926 event pairs, 10298 based on Foata normal form. 641/32492 useless extension candidates. Maximal degree in co-relation 88594. Up to 8268 conditions per place. [2025-01-10 01:01:03,687 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 341 selfloop transitions, 78 changer transitions 0/472 dead transitions. [2025-01-10 01:01:03,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 472 transitions, 3657 flow [2025-01-10 01:01:03,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 01:01:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-10 01:01:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1939 transitions. [2025-01-10 01:01:03,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7386666666666667 [2025-01-10 01:01:03,688 INFO L175 Difference]: Start difference. First operand has 211 places, 184 transitions, 1531 flow. Second operand 25 states and 1939 transitions. [2025-01-10 01:01:03,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 472 transitions, 3657 flow [2025-01-10 01:01:03,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 472 transitions, 3512 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 01:01:03,797 INFO L231 Difference]: Finished difference. Result has 237 places, 199 transitions, 1814 flow [2025-01-10 01:01:03,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1814, PETRI_PLACES=237, PETRI_TRANSITIONS=199} [2025-01-10 01:01:03,798 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 141 predicate places. [2025-01-10 01:01:03,798 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 199 transitions, 1814 flow [2025-01-10 01:01:03,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 67.66666666666667) internal successors, (1015), 15 states have internal predecessors, (1015), 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-01-10 01:01:03,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:03,798 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:03,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:01:03,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:01:03,999 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:01:03,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash -434081182, now seen corresponding path program 2 times [2025-01-10 01:01:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:04,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699071362] [2025-01-10 01:01:04,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:04,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:04,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:01:04,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:01:04,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:04,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:04,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:04,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699071362] [2025-01-10 01:01:04,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699071362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:04,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928144065] [2025-01-10 01:01:04,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:04,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:04,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:04,295 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:04,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:01:04,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:01:04,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:01:04,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:04,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:04,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:01:04,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:04,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:01:04,534 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:01:04,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:01:04,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:01:04,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:01:04,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:01:04,597 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:01:04,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:01:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:04,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:04,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 183 [2025-01-10 01:01:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:05,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928144065] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:05,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:05,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2025-01-10 01:01:05,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108719423] [2025-01-10 01:01:05,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:05,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:01:05,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:05,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:01:05,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:01:07,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-01-10 01:01:07,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 199 transitions, 1814 flow. Second operand has 21 states, 21 states have (on average 54.285714285714285) internal successors, (1140), 21 states have internal predecessors, (1140), 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-01-10 01:01:07,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:07,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-01-10 01:01:07,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:16,823 INFO L124 PetriNetUnfolderBase]: 43953/78874 cut-off events. [2025-01-10 01:01:16,823 INFO L125 PetriNetUnfolderBase]: For 225091/238561 co-relation queries the response was YES. [2025-01-10 01:01:17,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214727 conditions, 78874 events. 43953/78874 cut-off events. For 225091/238561 co-relation queries the response was YES. Maximal size of possible extension queue 3333. Compared 817909 event pairs, 15864 based on Foata normal form. 819/75882 useless extension candidates. Maximal degree in co-relation 213989. Up to 16500 conditions per place. [2025-01-10 01:01:17,569 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 369 selfloop transitions, 91 changer transitions 0/503 dead transitions. [2025-01-10 01:01:17,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 503 transitions, 4415 flow [2025-01-10 01:01:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 01:01:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-10 01:01:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1614 transitions. [2025-01-10 01:01:17,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6148571428571429 [2025-01-10 01:01:17,572 INFO L175 Difference]: Start difference. First operand has 237 places, 199 transitions, 1814 flow. Second operand 25 states and 1614 transitions. [2025-01-10 01:01:17,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 503 transitions, 4415 flow [2025-01-10 01:01:18,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 503 transitions, 4323 flow, removed 21 selfloop flow, removed 6 redundant places. [2025-01-10 01:01:18,062 INFO L231 Difference]: Finished difference. Result has 265 places, 227 transitions, 2391 flow [2025-01-10 01:01:18,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2391, PETRI_PLACES=265, PETRI_TRANSITIONS=227} [2025-01-10 01:01:18,063 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 169 predicate places. [2025-01-10 01:01:18,063 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 227 transitions, 2391 flow [2025-01-10 01:01:18,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 54.285714285714285) internal successors, (1140), 21 states have internal predecessors, (1140), 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-01-10 01:01:18,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:18,064 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:18,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:01:18,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:18,265 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:01:18,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1328396046, now seen corresponding path program 1 times [2025-01-10 01:01:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:18,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820586524] [2025-01-10 01:01:18,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:18,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:18,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:01:18,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:01:18,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:18,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:01:18,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820586524] [2025-01-10 01:01:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820586524] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061487854] [2025-01-10 01:01:18,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:18,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:18,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:18,515 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:18,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:01:18,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:01:18,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:01:18,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:18,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:18,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:01:18,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:18,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:18,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061487854] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:18,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:18,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-01-10 01:01:18,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809010775] [2025-01-10 01:01:18,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:18,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:01:18,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:18,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:01:18,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:01:18,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-01-10 01:01:18,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 227 transitions, 2391 flow. Second operand has 15 states, 15 states have (on average 68.2) internal successors, (1023), 15 states have internal predecessors, (1023), 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-01-10 01:01:18,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:18,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-01-10 01:01:18,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:24,378 INFO L124 PetriNetUnfolderBase]: 24959/50583 cut-off events. [2025-01-10 01:01:24,379 INFO L125 PetriNetUnfolderBase]: For 142941/152042 co-relation queries the response was YES. [2025-01-10 01:01:24,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130113 conditions, 50583 events. 24959/50583 cut-off events. For 142941/152042 co-relation queries the response was YES. Maximal size of possible extension queue 2058. Compared 551131 event pairs, 10545 based on Foata normal form. 744/47697 useless extension candidates. Maximal degree in co-relation 130005. Up to 9616 conditions per place. [2025-01-10 01:01:24,858 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 429 selfloop transitions, 89 changer transitions 0/577 dead transitions. [2025-01-10 01:01:24,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 577 transitions, 5142 flow [2025-01-10 01:01:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 01:01:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-10 01:01:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2183 transitions. [2025-01-10 01:01:24,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.742517006802721 [2025-01-10 01:01:24,861 INFO L175 Difference]: Start difference. First operand has 265 places, 227 transitions, 2391 flow. Second operand 28 states and 2183 transitions. [2025-01-10 01:01:24,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 577 transitions, 5142 flow [2025-01-10 01:01:25,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 577 transitions, 5059 flow, removed 19 selfloop flow, removed 10 redundant places. [2025-01-10 01:01:25,225 INFO L231 Difference]: Finished difference. Result has 286 places, 232 transitions, 2554 flow [2025-01-10 01:01:25,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2554, PETRI_PLACES=286, PETRI_TRANSITIONS=232} [2025-01-10 01:01:25,226 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 190 predicate places. [2025-01-10 01:01:25,226 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 232 transitions, 2554 flow [2025-01-10 01:01:25,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 68.2) internal successors, (1023), 15 states have internal predecessors, (1023), 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-01-10 01:01:25,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:25,227 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:25,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:01:25,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:25,427 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 01:01:25,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash -571614042, now seen corresponding path program 1 times [2025-01-10 01:01:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:25,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145842649] [2025-01-10 01:01:25,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:25,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:25,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:01:25,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:01:25,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:25,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:01:25,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145842649] [2025-01-10 01:01:25,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145842649] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465125985] [2025-01-10 01:01:25,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:25,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:25,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:25,592 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:25,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:01:25,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:01:25,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:01:25,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:25,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:25,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:01:25,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:25,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:01:26,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:01:26,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:01:26,005 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:01:26,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:01:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:01:26,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:26,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-01-10 01:01:26,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:01:26,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39 [2025-01-10 01:01:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:01:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465125985] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:26,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-01-10 01:01:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470690095] [2025-01-10 01:01:26,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:26,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:01:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:26,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:01:26,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:01:27,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 105 [2025-01-10 01:01:27,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 232 transitions, 2554 flow. Second operand has 19 states, 19 states have (on average 62.05263157894737) internal successors, (1179), 19 states have internal predecessors, (1179), 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-01-10 01:01:27,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:27,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 105 [2025-01-10 01:01:27,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:32,918 INFO L124 PetriNetUnfolderBase]: 27127/52686 cut-off events. [2025-01-10 01:01:32,918 INFO L125 PetriNetUnfolderBase]: For 159945/170598 co-relation queries the response was YES. [2025-01-10 01:01:33,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141375 conditions, 52686 events. 27127/52686 cut-off events. For 159945/170598 co-relation queries the response was YES. Maximal size of possible extension queue 2239. Compared 556366 event pairs, 6903 based on Foata normal form. 419/49882 useless extension candidates. Maximal degree in co-relation 141264. Up to 10022 conditions per place.