./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.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/popl20-more-array-sum2.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 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:08:54,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:08:54,847 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:08:54,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:08:54,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:08:54,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:08:54,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:08:54,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:08:54,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:08:54,886 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:08:54,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:08:54,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:08:54,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:08:54,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:08:54,886 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:08:54,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:08:54,887 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:08:54,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:08:54,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:08:54,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:08:54,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:08:54,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:08:54,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:08:54,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:08:54,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:08:54,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:08:54,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:08:54,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:08:54,888 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2025-01-10 01:08:55,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:08:55,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:08:55,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:08:55,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:08:55,218 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:08:55,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-01-10 01:08:56,535 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07e8c04ce/8c9c1b555e4b4882ad893eb39aea09b4/FLAGd10b35c98 [2025-01-10 01:08:56,794 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:08:56,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-01-10 01:08:56,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07e8c04ce/8c9c1b555e4b4882ad893eb39aea09b4/FLAGd10b35c98 [2025-01-10 01:08:56,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07e8c04ce/8c9c1b555e4b4882ad893eb39aea09b4 [2025-01-10 01:08:56,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:08:56,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:08:56,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:08:56,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:08:56,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:08:56,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:08:56" (1/1) ... [2025-01-10 01:08:56,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e9db7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:56, skipping insertion in model container [2025-01-10 01:08:56,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:08:56" (1/1) ... [2025-01-10 01:08:56,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:08:56,967 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:08:56,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:08:56,981 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:08:57,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:08:57,013 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:08:57,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57 WrapperNode [2025-01-10 01:08:57,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:08:57,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:08:57,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:08:57,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:08:57,019 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:08:57" (1/1) ... [2025-01-10 01:08:57,024 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:08:57" (1/1) ... [2025-01-10 01:08:57,048 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 251 [2025-01-10 01:08:57,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:08:57,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:08:57,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:08:57,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:08:57,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,078 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:08:57,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:08:57,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:08:57,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:08:57,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:08:57,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (1/1) ... [2025-01-10 01:08:57,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:08:57,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:57,124 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:08:57,129 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:08:57,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:08:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:08:57,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:08:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:08:57,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:08:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:08:57,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:08:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:08:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:08:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:08:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:08:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:08:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:08:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:08:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:08:57,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:08:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:08:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:08:57,144 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:08:57,224 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:08:57,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:08:57,707 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:08:57,708 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:08:58,166 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:08:58,167 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:08:58,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:08:58 BoogieIcfgContainer [2025-01-10 01:08:58,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:08:58,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:08:58,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:08:58,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:08:58,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:08:56" (1/3) ... [2025-01-10 01:08:58,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b26a95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:08:58, skipping insertion in model container [2025-01-10 01:08:58,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:08:57" (2/3) ... [2025-01-10 01:08:58,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b26a95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:08:58, skipping insertion in model container [2025-01-10 01:08:58,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:08:58" (3/3) ... [2025-01-10 01:08:58,173 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-01-10 01:08:58,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:08:58,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 51 locations, 1 initial locations, 5 loop locations, and 18 error locations. [2025-01-10 01:08:58,187 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:08:58,248 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:08:58,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 131 flow [2025-01-10 01:08:58,306 INFO L124 PetriNetUnfolderBase]: 5/52 cut-off events. [2025-01-10 01:08:58,312 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:08:58,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 5/52 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 117 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-01-10 01:08:58,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 55 transitions, 131 flow [2025-01-10 01:08:58,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 120 flow [2025-01-10 01:08:58,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:08:58,353 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;@686cf9d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:08:58,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-01-10 01:08:58,357 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:08:58,357 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:08:58,357 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:08:58,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:58,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:08:58,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:08:58,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash 872285, now seen corresponding path program 1 times [2025-01-10 01:08:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:58,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949145907] [2025-01-10 01:08:58,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:58,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:08:58,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:08:58,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:58,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:58,637 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:08:58,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:58,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949145907] [2025-01-10 01:08:58,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949145907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:08:58,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:08:58,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:08:58,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116319824] [2025-01-10 01:08:58,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:08:58,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:08:58,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:58,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:08:58,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:08:58,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-01-10 01:08:58,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:58,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:58,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-01-10 01:08:58,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:59,256 INFO L124 PetriNetUnfolderBase]: 2971/4303 cut-off events. [2025-01-10 01:08:59,257 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-01-10 01:08:59,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8745 conditions, 4303 events. 2971/4303 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 25468 event pairs, 2534 based on Foata normal form. 1/2489 useless extension candidates. Maximal degree in co-relation 8226. Up to 4213 conditions per place. [2025-01-10 01:08:59,287 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 39 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-01-10 01:08:59,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 194 flow [2025-01-10 01:08:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:08:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:08:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-01-10 01:08:59,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-01-10 01:08:59,298 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 120 flow. Second operand 3 states and 74 transitions. [2025-01-10 01:08:59,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 194 flow [2025-01-10 01:08:59,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 182 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:08:59,306 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 104 flow [2025-01-10 01:08:59,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2025-01-10 01:08:59,310 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -8 predicate places. [2025-01-10 01:08:59,313 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 104 flow [2025-01-10 01:08:59,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:59,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:59,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:08:59,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:08:59,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:08:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash 872286, now seen corresponding path program 1 times [2025-01-10 01:08:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474375440] [2025-01-10 01:08:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:59,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:08:59,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:08:59,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:59,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:59,645 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:08:59,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:59,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474375440] [2025-01-10 01:08:59,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474375440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:08:59,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:08:59,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:08:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149341446] [2025-01-10 01:08:59,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:08:59,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:08:59,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:59,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:08:59,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:08:59,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-01-10 01:08:59,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:59,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:59,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-01-10 01:08:59,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:00,172 INFO L124 PetriNetUnfolderBase]: 2972/4306 cut-off events. [2025-01-10 01:09:00,172 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 01:09:00,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8607 conditions, 4306 events. 2972/4306 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 25608 event pairs, 2534 based on Foata normal form. 0/2489 useless extension candidates. Maximal degree in co-relation 8578. Up to 4222 conditions per place. [2025-01-10 01:09:00,200 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 42 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-01-10 01:09:00,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 202 flow [2025-01-10 01:09:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-01-10 01:09:00,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39545454545454545 [2025-01-10 01:09:00,205 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 104 flow. Second operand 4 states and 87 transitions. [2025-01-10 01:09:00,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 202 flow [2025-01-10 01:09:00,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:00,208 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 127 flow [2025-01-10 01:09:00,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-01-10 01:09:00,210 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2025-01-10 01:09:00,211 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 127 flow [2025-01-10 01:09:00,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:00,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:00,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:09:00,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:09:00,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:00,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 27042393, now seen corresponding path program 1 times [2025-01-10 01:09:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496747514] [2025-01-10 01:09:00,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:00,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:00,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:09:00,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:09:00,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:00,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:00,347 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:09:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:00,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496747514] [2025-01-10 01:09:00,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496747514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:00,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:00,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:00,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677375980] [2025-01-10 01:09:00,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:00,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:00,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:00,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:00,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-01-10 01:09:00,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:09:00,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:00,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-01-10 01:09:00,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:00,847 INFO L124 PetriNetUnfolderBase]: 2971/4309 cut-off events. [2025-01-10 01:09:00,847 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 01:09:00,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8621 conditions, 4309 events. 2971/4309 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 25575 event pairs, 2534 based on Foata normal form. 1/2495 useless extension candidates. Maximal degree in co-relation 8601. Up to 4219 conditions per place. [2025-01-10 01:09:00,862 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 41 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2025-01-10 01:09:00,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 223 flow [2025-01-10 01:09:00,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-01-10 01:09:00,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4409090909090909 [2025-01-10 01:09:00,863 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 127 flow. Second operand 4 states and 97 transitions. [2025-01-10 01:09:00,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 223 flow [2025-01-10 01:09:00,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:00,864 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 142 flow [2025-01-10 01:09:00,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-01-10 01:09:00,865 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2025-01-10 01:09:00,865 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 142 flow [2025-01-10 01:09:00,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:09:00,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:00,866 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:09:00,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:09:00,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:00,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:00,866 INFO L85 PathProgramCache]: Analyzing trace with hash 838294413, now seen corresponding path program 1 times [2025-01-10 01:09:00,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:00,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092676889] [2025-01-10 01:09:00,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:00,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:00,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:00,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:00,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:01,051 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:09:01,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:01,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092676889] [2025-01-10 01:09:01,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092676889] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:01,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977789636] [2025-01-10 01:09:01,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:01,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:01,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:01,055 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:09:01,060 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:09:01,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:01,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:01,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:01,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:01,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:09:01,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:01,170 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:09:01,296 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:09:01,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:01,402 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:09:01,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977789636] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:01,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:01,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:09:01,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016036722] [2025-01-10 01:09:01,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:01,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:09:01,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:01,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:09:01,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:09:01,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-01-10 01:09:01,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 142 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:01,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:01,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-01-10 01:09:01,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:01,907 INFO L124 PetriNetUnfolderBase]: 2972/4310 cut-off events. [2025-01-10 01:09:01,907 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 01:09:01,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8639 conditions, 4310 events. 2972/4310 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 25577 event pairs, 2534 based on Foata normal form. 0/2497 useless extension candidates. Maximal degree in co-relation 8606. Up to 4221 conditions per place. [2025-01-10 01:09:01,936 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 39 selfloop transitions, 9 changer transitions 0/52 dead transitions. [2025-01-10 01:09:01,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 52 transitions, 249 flow [2025-01-10 01:09:01,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:09:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:09:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2025-01-10 01:09:01,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29318181818181815 [2025-01-10 01:09:01,940 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 142 flow. Second operand 8 states and 129 transitions. [2025-01-10 01:09:01,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 52 transitions, 249 flow [2025-01-10 01:09:01,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 240 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:01,941 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 162 flow [2025-01-10 01:09:01,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=162, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2025-01-10 01:09:01,941 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2025-01-10 01:09:01,941 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 162 flow [2025-01-10 01:09:01,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:01,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:01,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:09:01,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:09:02,142 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:09:02,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:02,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash 217324554, now seen corresponding path program 1 times [2025-01-10 01:09:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:02,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950387145] [2025-01-10 01:09:02,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:02,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:02,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:02,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:02,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:02,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:02,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:02,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950387145] [2025-01-10 01:09:02,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950387145] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:02,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546877311] [2025-01-10 01:09:02,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:02,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:02,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:02,371 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:09:02,372 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:09:02,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:02,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:02,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:02,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:02,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:09:02,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:02,449 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:09:02,546 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:09:02,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 01:09:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:02,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:02,653 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:09:02,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546877311] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:02,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:09:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-01-10 01:09:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393348583] [2025-01-10 01:09:02,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:02,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:02,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:02,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:09:02,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-01-10 01:09:02,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:09:02,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:02,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-01-10 01:09:02,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:03,003 INFO L124 PetriNetUnfolderBase]: 2972/4309 cut-off events. [2025-01-10 01:09:03,003 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 01:09:03,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8640 conditions, 4309 events. 2972/4309 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 25646 event pairs, 2534 based on Foata normal form. 1/2497 useless extension candidates. Maximal degree in co-relation 8602. Up to 4221 conditions per place. [2025-01-10 01:09:03,016 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-01-10 01:09:03,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 262 flow [2025-01-10 01:09:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-01-10 01:09:03,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3527272727272727 [2025-01-10 01:09:03,018 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 162 flow. Second operand 5 states and 97 transitions. [2025-01-10 01:09:03,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 262 flow [2025-01-10 01:09:03,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 224 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-01-10 01:09:03,020 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 139 flow [2025-01-10 01:09:03,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-01-10 01:09:03,021 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2025-01-10 01:09:03,021 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 139 flow [2025-01-10 01:09:03,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:09:03,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:03,021 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:03,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:09:03,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:03,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:03,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1604473388, now seen corresponding path program 1 times [2025-01-10 01:09:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298812619] [2025-01-10 01:09:03,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:03,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:09:03,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:09:03,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:03,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:03,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:03,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298812619] [2025-01-10 01:09:03,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298812619] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:03,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119364596] [2025-01-10 01:09:03,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:03,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:03,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:03,313 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:09:03,317 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:09:03,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:09:03,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:09:03,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:03,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:03,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:09:03,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:03,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:03,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119364596] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:03,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:03,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:09:03,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104435163] [2025-01-10 01:09:03,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:03,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:09:03,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:09:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:09:03,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-01-10 01:09:03,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 139 flow. Second operand has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 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:09:03,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:03,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-01-10 01:09:03,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:04,134 INFO L124 PetriNetUnfolderBase]: 5941/8610 cut-off events. [2025-01-10 01:09:04,135 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-10 01:09:04,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17224 conditions, 8610 events. 5941/8610 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 53884 event pairs, 5068 based on Foata normal form. 1/5058 useless extension candidates. Maximal degree in co-relation 8598. Up to 4217 conditions per place. [2025-01-10 01:09:04,171 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 74 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2025-01-10 01:09:04,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 414 flow [2025-01-10 01:09:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:09:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:09:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2025-01-10 01:09:04,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2025-01-10 01:09:04,173 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 139 flow. Second operand 8 states and 185 transitions. [2025-01-10 01:09:04,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 414 flow [2025-01-10 01:09:04,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 400 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:09:04,175 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 190 flow [2025-01-10 01:09:04,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=190, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-01-10 01:09:04,176 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2025-01-10 01:09:04,176 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 190 flow [2025-01-10 01:09:04,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 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:09:04,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:04,176 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:09:04,184 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:09:04,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:04,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:04,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -619780347, now seen corresponding path program 2 times [2025-01-10 01:09:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739741754] [2025-01-10 01:09:04,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:04,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:09:04,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:04,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:04,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:09:04,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:04,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739741754] [2025-01-10 01:09:04,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739741754] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:04,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732523197] [2025-01-10 01:09:04,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:04,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:04,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:04,627 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:09:04,629 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:09:04,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:09:04,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:04,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:04,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:04,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 01:09:04,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:04,716 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:09:04,844 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:09:04,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2025-01-10 01:09:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:04,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:05,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732523197] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:05,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:05,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2025-01-10 01:09:05,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30703148] [2025-01-10 01:09:05,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:05,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:09:05,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:05,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:09:05,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:09:05,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-01-10 01:09:05,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 190 flow. Second operand has 18 states, 18 states have (on average 11.555555555555555) internal successors, (208), 18 states have internal predecessors, (208), 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:09:05,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:05,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-01-10 01:09:05,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:06,803 INFO L124 PetriNetUnfolderBase]: 8918/12931 cut-off events. [2025-01-10 01:09:06,803 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-10 01:09:06,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25936 conditions, 12931 events. 8918/12931 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 79965 event pairs, 7602 based on Foata normal form. 8/7573 useless extension candidates. Maximal degree in co-relation 8646. Up to 8429 conditions per place. [2025-01-10 01:09:06,832 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 70 selfloop transitions, 46 changer transitions 0/120 dead transitions. [2025-01-10 01:09:06,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 120 transitions, 674 flow [2025-01-10 01:09:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:09:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 01:09:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 332 transitions. [2025-01-10 01:09:06,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28744588744588745 [2025-01-10 01:09:06,834 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 190 flow. Second operand 21 states and 332 transitions. [2025-01-10 01:09:06,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 120 transitions, 674 flow [2025-01-10 01:09:06,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 624 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:06,837 INFO L231 Difference]: Finished difference. Result has 80 places, 85 transitions, 424 flow [2025-01-10 01:09:06,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=424, PETRI_PLACES=80, PETRI_TRANSITIONS=85} [2025-01-10 01:09:06,837 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2025-01-10 01:09:06,837 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 424 flow [2025-01-10 01:09:06,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.555555555555555) internal successors, (208), 18 states have internal predecessors, (208), 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:09:06,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:06,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:06,844 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:09:07,042 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,SelfDestructingSolverStorable6 [2025-01-10 01:09:07,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:07,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash -172762083, now seen corresponding path program 1 times [2025-01-10 01:09:07,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:07,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651999060] [2025-01-10 01:09:07,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:07,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:09:07,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:09:07,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:07,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:07,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:07,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651999060] [2025-01-10 01:09:07,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651999060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:07,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423876809] [2025-01-10 01:09:07,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:07,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:07,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:07,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:07,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:07,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-01-10 01:09:07,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:09:07,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:07,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-01-10 01:09:07,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:07,562 INFO L124 PetriNetUnfolderBase]: 6104/8908 cut-off events. [2025-01-10 01:09:07,562 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-10 01:09:07,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17931 conditions, 8908 events. 6104/8908 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 52573 event pairs, 5076 based on Foata normal form. 0/5679 useless extension candidates. Maximal degree in co-relation 5977. Up to 8669 conditions per place. [2025-01-10 01:09:07,590 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 63 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-01-10 01:09:07,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 82 transitions, 574 flow [2025-01-10 01:09:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-01-10 01:09:07,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33090909090909093 [2025-01-10 01:09:07,592 INFO L175 Difference]: Start difference. First operand has 80 places, 85 transitions, 424 flow. Second operand 5 states and 91 transitions. [2025-01-10 01:09:07,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 82 transitions, 574 flow [2025-01-10 01:09:07,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 82 transitions, 506 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-01-10 01:09:07,594 INFO L231 Difference]: Finished difference. Result has 78 places, 82 transitions, 380 flow [2025-01-10 01:09:07,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2025-01-10 01:09:07,594 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 22 predicate places. [2025-01-10 01:09:07,594 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 380 flow [2025-01-10 01:09:07,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:09:07,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:07,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:07,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:09:07,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:07,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:07,595 INFO L85 PathProgramCache]: Analyzing trace with hash -172762082, now seen corresponding path program 1 times [2025-01-10 01:09:07,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:07,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479578591] [2025-01-10 01:09:07,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:07,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:07,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:09:07,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:09:07,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:07,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:07,777 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:09:07,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479578591] [2025-01-10 01:09:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479578591] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811537938] [2025-01-10 01:09:07,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:07,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:07,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:07,784 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:09:07,803 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:09:07,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:09:07,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:09:07,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:07,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:07,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 01:09:07,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:07,884 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:09:07,895 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:09:07,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:09:07,940 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:09:07,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2025-01-10 01:09:08,147 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:09:08,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:08,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811537938] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:08,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:09:08,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 11 [2025-01-10 01:09:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570500438] [2025-01-10 01:09:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:08,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:08,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:08,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:09:08,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-01-10 01:09:08,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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:09:08,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:08,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-01-10 01:09:08,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:09,567 INFO L124 PetriNetUnfolderBase]: 7955/11194 cut-off events. [2025-01-10 01:09:09,567 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-10 01:09:09,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22414 conditions, 11194 events. 7955/11194 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 61206 event pairs, 2787 based on Foata normal form. 0/7090 useless extension candidates. Maximal degree in co-relation 7468. Up to 5694 conditions per place. [2025-01-10 01:09:09,602 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 78 selfloop transitions, 24 changer transitions 0/106 dead transitions. [2025-01-10 01:09:09,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 106 transitions, 642 flow [2025-01-10 01:09:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:09:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:09:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2025-01-10 01:09:09,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38441558441558443 [2025-01-10 01:09:09,603 INFO L175 Difference]: Start difference. First operand has 78 places, 82 transitions, 380 flow. Second operand 7 states and 148 transitions. [2025-01-10 01:09:09,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 106 transitions, 642 flow [2025-01-10 01:09:09,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 106 transitions, 616 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:09:09,605 INFO L231 Difference]: Finished difference. Result has 83 places, 86 transitions, 442 flow [2025-01-10 01:09:09,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=442, PETRI_PLACES=83, PETRI_TRANSITIONS=86} [2025-01-10 01:09:09,606 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 27 predicate places. [2025-01-10 01:09:09,606 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 86 transitions, 442 flow [2025-01-10 01:09:09,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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:09:09,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:09,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:09,613 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:09:09,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:09,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:09,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:09,807 INFO L85 PathProgramCache]: Analyzing trace with hash -172762081, now seen corresponding path program 1 times [2025-01-10 01:09:09,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:09,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914987007] [2025-01-10 01:09:09,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:09,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:09,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:09:09,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:09:09,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:09,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:09,854 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:09:09,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:09,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914987007] [2025-01-10 01:09:09,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914987007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:09,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:09,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:09,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666018507] [2025-01-10 01:09:09,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:09,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:09,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:09,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:09,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:09,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-01-10 01:09:09,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 86 transitions, 442 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:09,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:09,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-01-10 01:09:09,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:10,224 INFO L124 PetriNetUnfolderBase]: 5090/7264 cut-off events. [2025-01-10 01:09:10,225 INFO L125 PetriNetUnfolderBase]: For 3869/3869 co-relation queries the response was YES. [2025-01-10 01:09:10,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18225 conditions, 7264 events. 5090/7264 cut-off events. For 3869/3869 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 37923 event pairs, 3720 based on Foata normal form. 0/5428 useless extension candidates. Maximal degree in co-relation 6143. Up to 7025 conditions per place. [2025-01-10 01:09:10,250 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 69 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2025-01-10 01:09:10,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 82 transitions, 584 flow [2025-01-10 01:09:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-01-10 01:09:10,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35454545454545455 [2025-01-10 01:09:10,251 INFO L175 Difference]: Start difference. First operand has 83 places, 86 transitions, 442 flow. Second operand 4 states and 78 transitions. [2025-01-10 01:09:10,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 82 transitions, 584 flow [2025-01-10 01:09:10,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 82 transitions, 567 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:09:10,254 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 429 flow [2025-01-10 01:09:10,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=429, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2025-01-10 01:09:10,255 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2025-01-10 01:09:10,255 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 429 flow [2025-01-10 01:09:10,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:10,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:10,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:10,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:09:10,255 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:10,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash -172762080, now seen corresponding path program 1 times [2025-01-10 01:09:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:10,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957549847] [2025-01-10 01:09:10,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:10,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:09:10,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:09:10,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:10,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:10,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:10,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957549847] [2025-01-10 01:09:10,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957549847] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:10,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603763777] [2025-01-10 01:09:10,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:10,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:10,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:10,402 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:09:10,403 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:09:10,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:09:10,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:09:10,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:10,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:10,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:09:10,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:10,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:10,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-01-10 01:09:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:10,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603763777] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:10,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:10,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:09:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054578707] [2025-01-10 01:09:10,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:10,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:09:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:10,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:09:10,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:09:10,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-01-10 01:09:10,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 429 flow. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 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:09:10,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:10,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-01-10 01:09:10,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:11,201 INFO L124 PetriNetUnfolderBase]: 5450/8068 cut-off events. [2025-01-10 01:09:11,201 INFO L125 PetriNetUnfolderBase]: For 2371/2371 co-relation queries the response was YES. [2025-01-10 01:09:11,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19928 conditions, 8068 events. 5450/8068 cut-off events. For 2371/2371 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 46624 event pairs, 2640 based on Foata normal form. 0/6372 useless extension candidates. Maximal degree in co-relation 6706. Up to 5015 conditions per place. [2025-01-10 01:09:11,228 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 89 selfloop transitions, 24 changer transitions 0/117 dead transitions. [2025-01-10 01:09:11,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 737 flow [2025-01-10 01:09:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:09:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:09:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-01-10 01:09:11,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2025-01-10 01:09:11,230 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 429 flow. Second operand 7 states and 161 transitions. [2025-01-10 01:09:11,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 737 flow [2025-01-10 01:09:11,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:11,235 INFO L231 Difference]: Finished difference. Result has 84 places, 82 transitions, 469 flow [2025-01-10 01:09:11,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=84, PETRI_TRANSITIONS=82} [2025-01-10 01:09:11,235 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 28 predicate places. [2025-01-10 01:09:11,235 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 469 flow [2025-01-10 01:09:11,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 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:09:11,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:11,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:11,242 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:09:11,436 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,SelfDestructingSolverStorable10 [2025-01-10 01:09:11,436 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:11,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:11,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1460926708, now seen corresponding path program 1 times [2025-01-10 01:09:11,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:11,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511143530] [2025-01-10 01:09:11,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:11,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:09:11,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:09:11,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:11,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:11,535 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:09:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511143530] [2025-01-10 01:09:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511143530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694321934] [2025-01-10 01:09:11,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:11,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:11,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:11,538 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:09:11,539 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:09:11,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:09:11,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:09:11,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:11,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:11,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:09:11,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:11,647 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:09:11,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:11,691 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:09:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694321934] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:11,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:09:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206307302] [2025-01-10 01:09:11,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:11,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:09:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:11,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:09:11,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:09:11,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:09:11,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 469 flow. Second operand has 14 states, 14 states have (on average 13.071428571428571) internal successors, (183), 14 states have internal predecessors, (183), 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:09:11,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:11,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:09:11,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:12,221 INFO L124 PetriNetUnfolderBase]: 5034/7254 cut-off events. [2025-01-10 01:09:12,221 INFO L125 PetriNetUnfolderBase]: For 8722/8722 co-relation queries the response was YES. [2025-01-10 01:09:12,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19600 conditions, 7254 events. 5034/7254 cut-off events. For 8722/8722 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 37424 event pairs, 3754 based on Foata normal form. 0/5945 useless extension candidates. Maximal degree in co-relation 8179. Up to 5941 conditions per place. [2025-01-10 01:09:12,241 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 89 selfloop transitions, 38 changer transitions 0/130 dead transitions. [2025-01-10 01:09:12,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 130 transitions, 916 flow [2025-01-10 01:09:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:09:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:09:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2025-01-10 01:09:12,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-01-10 01:09:12,242 INFO L175 Difference]: Start difference. First operand has 84 places, 82 transitions, 469 flow. Second operand 9 states and 189 transitions. [2025-01-10 01:09:12,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 130 transitions, 916 flow [2025-01-10 01:09:12,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 130 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:09:12,245 INFO L231 Difference]: Finished difference. Result has 89 places, 84 transitions, 512 flow [2025-01-10 01:09:12,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=512, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2025-01-10 01:09:12,246 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2025-01-10 01:09:12,246 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 84 transitions, 512 flow [2025-01-10 01:09:12,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.071428571428571) internal successors, (183), 14 states have internal predecessors, (183), 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:09:12,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:12,246 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:12,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:09:12,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:12,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:12,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1383390337, now seen corresponding path program 1 times [2025-01-10 01:09:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707861093] [2025-01-10 01:09:12,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:12,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:09:12,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:09:12,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:12,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:12,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:12,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707861093] [2025-01-10 01:09:12,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707861093] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:12,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801714145] [2025-01-10 01:09:12,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:12,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:12,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:12,561 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:09:12,563 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:09:12,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:09:12,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:09:12,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:12,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:12,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:09:12,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:12,682 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:09:12,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:12,723 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:09:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801714145] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:12,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:09:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103596118] [2025-01-10 01:09:12,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:12,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:09:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:12,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:09:12,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:09:12,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:09:12,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 512 flow. Second operand has 14 states, 14 states have (on average 13.214285714285714) internal successors, (185), 14 states have internal predecessors, (185), 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:09:12,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:12,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:09:12,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:13,336 INFO L124 PetriNetUnfolderBase]: 5038/7277 cut-off events. [2025-01-10 01:09:13,337 INFO L125 PetriNetUnfolderBase]: For 3931/4201 co-relation queries the response was YES. [2025-01-10 01:09:13,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18504 conditions, 7277 events. 5038/7277 cut-off events. For 3931/4201 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 38191 event pairs, 3723 based on Foata normal form. 44/5958 useless extension candidates. Maximal degree in co-relation 8042. Up to 6277 conditions per place. [2025-01-10 01:09:13,360 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 91 selfloop transitions, 40 changer transitions 0/134 dead transitions. [2025-01-10 01:09:13,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 134 transitions, 925 flow [2025-01-10 01:09:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:09:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:09:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2025-01-10 01:09:13,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-01-10 01:09:13,361 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 512 flow. Second operand 10 states and 210 transitions. [2025-01-10 01:09:13,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 134 transitions, 925 flow [2025-01-10 01:09:13,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 134 transitions, 855 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:09:13,367 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 564 flow [2025-01-10 01:09:13,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=564, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2025-01-10 01:09:13,368 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 39 predicate places. [2025-01-10 01:09:13,368 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 564 flow [2025-01-10 01:09:13,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.214285714285714) internal successors, (185), 14 states have internal predecessors, (185), 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:09:13,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:13,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:13,375 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:09:13,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:13,569 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:13,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash -529030004, now seen corresponding path program 1 times [2025-01-10 01:09:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:13,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104463078] [2025-01-10 01:09:13,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:13,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:13,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:09:13,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:09:13,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:13,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:13,742 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:09:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104463078] [2025-01-10 01:09:13,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104463078] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122618054] [2025-01-10 01:09:13,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:13,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:13,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:13,744 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:09:13,746 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:09:13,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:09:13,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:09:13,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:13,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:13,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:09:13,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:13,819 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:09:13,827 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:09:13,882 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:09:13,883 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:09:13,891 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 18 treesize of output 13 [2025-01-10 01:09:14,124 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:09:14,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:14,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122618054] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:14,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:14,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-01-10 01:09:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982862451] [2025-01-10 01:09:14,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:14,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:09:14,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:14,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:09:14,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:09:14,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-01-10 01:09:14,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 564 flow. Second operand has 17 states, 17 states have (on average 10.058823529411764) internal successors, (171), 17 states have internal predecessors, (171), 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:09:14,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:14,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-01-10 01:09:14,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:16,273 INFO L124 PetriNetUnfolderBase]: 5976/8814 cut-off events. [2025-01-10 01:09:16,273 INFO L125 PetriNetUnfolderBase]: For 11451/11855 co-relation queries the response was YES. [2025-01-10 01:09:16,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24349 conditions, 8814 events. 5976/8814 cut-off events. For 11451/11855 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 49221 event pairs, 2502 based on Foata normal form. 0/7227 useless extension candidates. Maximal degree in co-relation 11750. Up to 4149 conditions per place. [2025-01-10 01:09:16,325 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 137 selfloop transitions, 38 changer transitions 0/179 dead transitions. [2025-01-10 01:09:16,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 179 transitions, 1376 flow [2025-01-10 01:09:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:09:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 01:09:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 281 transitions. [2025-01-10 01:09:16,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26889952153110047 [2025-01-10 01:09:16,327 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 564 flow. Second operand 19 states and 281 transitions. [2025-01-10 01:09:16,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 179 transitions, 1376 flow [2025-01-10 01:09:16,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 179 transitions, 1290 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 01:09:16,336 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 660 flow [2025-01-10 01:09:16,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=660, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2025-01-10 01:09:16,337 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 57 predicate places. [2025-01-10 01:09:16,337 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 660 flow [2025-01-10 01:09:16,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.058823529411764) internal successors, (171), 17 states have internal predecessors, (171), 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:09:16,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:16,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:16,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:09:16,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:16,538 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -529030002, now seen corresponding path program 1 times [2025-01-10 01:09:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025044131] [2025-01-10 01:09:16,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:16,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:09:16,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:09:16,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:16,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:16,695 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:09:16,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:16,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025044131] [2025-01-10 01:09:16,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025044131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:16,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585997874] [2025-01-10 01:09:16,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:16,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:16,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:16,697 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:09:16,701 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:09:16,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:09:16,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:09:16,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:16,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:16,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:09:16,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:16,872 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:09:16,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:16,949 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 36 treesize of output 32 [2025-01-10 01:09:17,012 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:09:17,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585997874] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:17,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:17,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-01-10 01:09:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492134312] [2025-01-10 01:09:17,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:17,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:09:17,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:17,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:09:17,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:09:17,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-01-10 01:09:17,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 660 flow. Second operand has 20 states, 20 states have (on average 14.1) internal successors, (282), 20 states have internal predecessors, (282), 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:09:17,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:17,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-01-10 01:09:17,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:18,197 INFO L124 PetriNetUnfolderBase]: 5773/8663 cut-off events. [2025-01-10 01:09:18,198 INFO L125 PetriNetUnfolderBase]: For 14854/15278 co-relation queries the response was YES. [2025-01-10 01:09:18,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28519 conditions, 8663 events. 5773/8663 cut-off events. For 14854/15278 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 49378 event pairs, 3080 based on Foata normal form. 0/7641 useless extension candidates. Maximal degree in co-relation 20991. Up to 4361 conditions per place. [2025-01-10 01:09:18,242 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 108 selfloop transitions, 58 changer transitions 0/170 dead transitions. [2025-01-10 01:09:18,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 170 transitions, 1342 flow [2025-01-10 01:09:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:09:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:09:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 289 transitions. [2025-01-10 01:09:18,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37532467532467534 [2025-01-10 01:09:18,245 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 660 flow. Second operand 14 states and 289 transitions. [2025-01-10 01:09:18,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 170 transitions, 1342 flow [2025-01-10 01:09:18,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 170 transitions, 1294 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-01-10 01:09:18,271 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 752 flow [2025-01-10 01:09:18,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=752, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2025-01-10 01:09:18,272 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 61 predicate places. [2025-01-10 01:09:18,272 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 752 flow [2025-01-10 01:09:18,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.1) internal successors, (282), 20 states have internal predecessors, (282), 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:09:18,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:18,273 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:18,279 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:09:18,473 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,SelfDestructingSolverStorable14 [2025-01-10 01:09:18,473 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:18,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:18,474 INFO L85 PathProgramCache]: Analyzing trace with hash -555160167, now seen corresponding path program 2 times [2025-01-10 01:09:18,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:18,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209046645] [2025-01-10 01:09:18,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:18,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:18,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 01:09:18,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:09:18,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:18,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:09:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209046645] [2025-01-10 01:09:18,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209046645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:18,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:18,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:18,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516424753] [2025-01-10 01:09:18,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:18,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:09:18,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:18,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:09:18,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:09:18,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:09:18,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 752 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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:09:18,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:18,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:09:18,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:19,348 INFO L124 PetriNetUnfolderBase]: 5773/8507 cut-off events. [2025-01-10 01:09:19,348 INFO L125 PetriNetUnfolderBase]: For 19046/19222 co-relation queries the response was YES. [2025-01-10 01:09:19,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29816 conditions, 8507 events. 5773/8507 cut-off events. For 19046/19222 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 44850 event pairs, 1416 based on Foata normal form. 0/7769 useless extension candidates. Maximal degree in co-relation 22095. Up to 3175 conditions per place. [2025-01-10 01:09:19,389 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 141 selfloop transitions, 16 changer transitions 0/160 dead transitions. [2025-01-10 01:09:19,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 160 transitions, 1424 flow [2025-01-10 01:09:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:09:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:09:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-01-10 01:09:19,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-01-10 01:09:19,391 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 752 flow. Second operand 6 states and 134 transitions. [2025-01-10 01:09:19,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 160 transitions, 1424 flow [2025-01-10 01:09:19,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 160 transitions, 1345 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 01:09:19,404 INFO L231 Difference]: Finished difference. Result has 114 places, 103 transitions, 703 flow [2025-01-10 01:09:19,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=114, PETRI_TRANSITIONS=103} [2025-01-10 01:09:19,405 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 58 predicate places. [2025-01-10 01:09:19,405 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 103 transitions, 703 flow [2025-01-10 01:09:19,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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:09:19,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:19,406 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:19,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:09:19,406 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:19,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:19,406 INFO L85 PathProgramCache]: Analyzing trace with hash -555160169, now seen corresponding path program 1 times [2025-01-10 01:09:19,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:19,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389184081] [2025-01-10 01:09:19,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:19,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:19,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:09:19,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:09:19,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:19,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:19,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:19,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389184081] [2025-01-10 01:09:19,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389184081] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:19,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79924601] [2025-01-10 01:09:19,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:19,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:19,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:19,614 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:09:19,616 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:09:19,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:09:19,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:09:19,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:19,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:19,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:09:19,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:19,691 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:09:19,703 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:09:19,804 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:09:19,805 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:09:19,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2025-01-10 01:09:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:20,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:09:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79924601] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:20,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:09:20,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 16 [2025-01-10 01:09:20,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039107638] [2025-01-10 01:09:20,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:20,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:09:20,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:20,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:09:20,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:09:20,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-01-10 01:09:20,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 103 transitions, 703 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:09:20,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:20,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-01-10 01:09:20,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:21,413 INFO L124 PetriNetUnfolderBase]: 6043/9168 cut-off events. [2025-01-10 01:09:21,414 INFO L125 PetriNetUnfolderBase]: For 20598/21016 co-relation queries the response was YES. [2025-01-10 01:09:21,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32801 conditions, 9168 events. 6043/9168 cut-off events. For 20598/21016 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 50977 event pairs, 3324 based on Foata normal form. 0/8688 useless extension candidates. Maximal degree in co-relation 24544. Up to 4063 conditions per place. [2025-01-10 01:09:21,476 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 113 selfloop transitions, 25 changer transitions 0/142 dead transitions. [2025-01-10 01:09:21,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 142 transitions, 1170 flow [2025-01-10 01:09:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:09:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:09:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2025-01-10 01:09:21,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-01-10 01:09:21,477 INFO L175 Difference]: Start difference. First operand has 114 places, 103 transitions, 703 flow. Second operand 8 states and 176 transitions. [2025-01-10 01:09:21,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 142 transitions, 1170 flow [2025-01-10 01:09:21,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 142 transitions, 1136 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:09:21,522 INFO L231 Difference]: Finished difference. Result has 118 places, 105 transitions, 748 flow [2025-01-10 01:09:21,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=748, PETRI_PLACES=118, PETRI_TRANSITIONS=105} [2025-01-10 01:09:21,522 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 62 predicate places. [2025-01-10 01:09:21,522 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 105 transitions, 748 flow [2025-01-10 01:09:21,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:09:21,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:21,522 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:09:21,530 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:09:21,725 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,SelfDestructingSolverStorable16 [2025-01-10 01:09:21,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:21,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2096848349, now seen corresponding path program 1 times [2025-01-10 01:09:21,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:21,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791756414] [2025-01-10 01:09:21,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:21,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:21,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:09:21,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:09:21,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:21,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:21,820 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:09:21,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:21,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791756414] [2025-01-10 01:09:21,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791756414] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:21,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108606708] [2025-01-10 01:09:21,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:21,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:21,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:21,823 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:09:21,824 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:09:21,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:09:21,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:09:21,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:21,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:21,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:09:21,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:21,960 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:09:21,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:22,006 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:09:22,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108606708] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:22,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:22,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-10 01:09:22,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673433024] [2025-01-10 01:09:22,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:22,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:09:22,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:22,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:09:22,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:09:22,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:09:22,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 105 transitions, 748 flow. Second operand has 15 states, 15 states have (on average 13.466666666666667) internal successors, (202), 15 states have internal predecessors, (202), 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:09:22,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:22,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:09:22,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:23,004 INFO L124 PetriNetUnfolderBase]: 6819/9712 cut-off events. [2025-01-10 01:09:23,005 INFO L125 PetriNetUnfolderBase]: For 23896/24612 co-relation queries the response was YES. [2025-01-10 01:09:23,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36098 conditions, 9712 events. 6819/9712 cut-off events. For 23896/24612 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 48600 event pairs, 4612 based on Foata normal form. 68/9522 useless extension candidates. Maximal degree in co-relation 29460. Up to 7863 conditions per place. [2025-01-10 01:09:23,050 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 88 selfloop transitions, 44 changer transitions 0/135 dead transitions. [2025-01-10 01:09:23,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 135 transitions, 1149 flow [2025-01-10 01:09:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:09:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:09:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2025-01-10 01:09:23,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3618181818181818 [2025-01-10 01:09:23,055 INFO L175 Difference]: Start difference. First operand has 118 places, 105 transitions, 748 flow. Second operand 10 states and 199 transitions. [2025-01-10 01:09:23,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 135 transitions, 1149 flow [2025-01-10 01:09:23,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 135 transitions, 1097 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 01:09:23,090 INFO L231 Difference]: Finished difference. Result has 119 places, 101 transitions, 768 flow [2025-01-10 01:09:23,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=768, PETRI_PLACES=119, PETRI_TRANSITIONS=101} [2025-01-10 01:09:23,090 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 63 predicate places. [2025-01-10 01:09:23,090 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 101 transitions, 768 flow [2025-01-10 01:09:23,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.466666666666667) internal successors, (202), 15 states have internal predecessors, (202), 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:09:23,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:23,091 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:23,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:09:23,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:09:23,292 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash 542425978, now seen corresponding path program 2 times [2025-01-10 01:09:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365015083] [2025-01-10 01:09:23,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:23,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:09:23,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:09:23,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:23,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365015083] [2025-01-10 01:09:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365015083] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173343736] [2025-01-10 01:09:23,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:23,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:23,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:23,477 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:09:23,478 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:09:23,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:09:23,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:09:23,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:23,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:23,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:09:23,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:09:23,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:23,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:09:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:09:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173343736] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:23,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:23,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2025-01-10 01:09:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053041652] [2025-01-10 01:09:23,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:23,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:09:23,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:23,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:09:23,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:09:24,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:09:24,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 101 transitions, 768 flow. Second operand has 22 states, 22 states have (on average 13.136363636363637) internal successors, (289), 22 states have internal predecessors, (289), 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:09:24,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:24,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:09:24,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:26,545 INFO L124 PetriNetUnfolderBase]: 12814/18038 cut-off events. [2025-01-10 01:09:26,545 INFO L125 PetriNetUnfolderBase]: For 45002/46532 co-relation queries the response was YES. [2025-01-10 01:09:26,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67095 conditions, 18038 events. 12814/18038 cut-off events. For 45002/46532 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 98352 event pairs, 3684 based on Foata normal form. 0/17827 useless extension candidates. Maximal degree in co-relation 54344. Up to 5055 conditions per place. [2025-01-10 01:09:26,676 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 309 selfloop transitions, 46 changer transitions 0/358 dead transitions. [2025-01-10 01:09:26,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 358 transitions, 2808 flow [2025-01-10 01:09:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 01:09:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-10 01:09:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 607 transitions. [2025-01-10 01:09:26,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39415584415584415 [2025-01-10 01:09:26,679 INFO L175 Difference]: Start difference. First operand has 119 places, 101 transitions, 768 flow. Second operand 28 states and 607 transitions. [2025-01-10 01:09:26,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 358 transitions, 2808 flow [2025-01-10 01:09:26,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 358 transitions, 2699 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-01-10 01:09:26,751 INFO L231 Difference]: Finished difference. Result has 147 places, 116 transitions, 928 flow [2025-01-10 01:09:26,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=928, PETRI_PLACES=147, PETRI_TRANSITIONS=116} [2025-01-10 01:09:26,751 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 91 predicate places. [2025-01-10 01:09:26,751 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 116 transitions, 928 flow [2025-01-10 01:09:26,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.136363636363637) internal successors, (289), 22 states have internal predecessors, (289), 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:09:26,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:26,752 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:26,758 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:09:26,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:26,954 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:26,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 542425976, now seen corresponding path program 1 times [2025-01-10 01:09:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225154042] [2025-01-10 01:09:26,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:26,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:09:26,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:09:26,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:26,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:27,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:27,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225154042] [2025-01-10 01:09:27,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225154042] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:27,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680717550] [2025-01-10 01:09:27,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:27,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:27,118 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:09:27,119 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:09:27,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:09:27,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:09:27,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:27,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:27,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 01:09:27,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:27,196 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:09:27,207 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:09:27,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:09:27,259 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:09:27,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2025-01-10 01:09:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:27,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:09:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680717550] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:27,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 19 [2025-01-10 01:09:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197211002] [2025-01-10 01:09:27,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:27,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:09:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:27,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:09:27,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:09:27,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-01-10 01:09:27,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 116 transitions, 928 flow. Second operand has 21 states, 21 states have (on average 10.095238095238095) internal successors, (212), 21 states have internal predecessors, (212), 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:09:27,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:27,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-01-10 01:09:27,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:32,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-10 01:09:34,290 INFO L124 PetriNetUnfolderBase]: 9478/14065 cut-off events. [2025-01-10 01:09:34,291 INFO L125 PetriNetUnfolderBase]: For 49269/50769 co-relation queries the response was YES. [2025-01-10 01:09:34,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59045 conditions, 14065 events. 9478/14065 cut-off events. For 49269/50769 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 81224 event pairs, 2914 based on Foata normal form. 527/14571 useless extension candidates. Maximal degree in co-relation 48765. Up to 5410 conditions per place. [2025-01-10 01:09:34,404 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 191 selfloop transitions, 44 changer transitions 0/241 dead transitions. [2025-01-10 01:09:34,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 241 transitions, 2005 flow [2025-01-10 01:09:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:09:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 01:09:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 320 transitions. [2025-01-10 01:09:34,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2025-01-10 01:09:34,406 INFO L175 Difference]: Start difference. First operand has 147 places, 116 transitions, 928 flow. Second operand 18 states and 320 transitions. [2025-01-10 01:09:34,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 241 transitions, 2005 flow [2025-01-10 01:09:34,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 241 transitions, 1919 flow, removed 7 selfloop flow, removed 14 redundant places. [2025-01-10 01:09:34,562 INFO L231 Difference]: Finished difference. Result has 154 places, 119 transitions, 979 flow [2025-01-10 01:09:34,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=979, PETRI_PLACES=154, PETRI_TRANSITIONS=119} [2025-01-10 01:09:34,563 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 98 predicate places. [2025-01-10 01:09:34,563 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 119 transitions, 979 flow [2025-01-10 01:09:34,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.095238095238095) internal successors, (212), 21 states have internal predecessors, (212), 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:09:34,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:34,563 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:34,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 01:09:34,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:34,764 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:34,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1143445069, now seen corresponding path program 1 times [2025-01-10 01:09:34,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:34,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813118490] [2025-01-10 01:09:34,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:34,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:34,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:09:34,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:09:34,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:34,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:34,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:34,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813118490] [2025-01-10 01:09:34,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813118490] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:34,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787138260] [2025-01-10 01:09:34,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:34,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:34,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:34,855 INFO L229 MonitoredProcess]: Starting monitored process 16 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:09:34,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:09:34,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:09:34,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:09:34,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:34,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:34,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:09:34,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:35,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787138260] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:35,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:35,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-10 01:09:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392759276] [2025-01-10 01:09:35,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:35,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:09:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:35,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:09:35,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:09:35,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:09:35,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 119 transitions, 979 flow. Second operand has 19 states, 19 states have (on average 13.263157894736842) internal successors, (252), 19 states have internal predecessors, (252), 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:09:35,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:35,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:09:35,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:36,876 INFO L124 PetriNetUnfolderBase]: 13929/19954 cut-off events. [2025-01-10 01:09:36,877 INFO L125 PetriNetUnfolderBase]: For 90058/91295 co-relation queries the response was YES. [2025-01-10 01:09:37,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87027 conditions, 19954 events. 13929/19954 cut-off events. For 90058/91295 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 113527 event pairs, 7216 based on Foata normal form. 483/20418 useless extension candidates. Maximal degree in co-relation 85855. Up to 10455 conditions per place. [2025-01-10 01:09:37,307 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 186 selfloop transitions, 45 changer transitions 0/236 dead transitions. [2025-01-10 01:09:37,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 236 transitions, 2394 flow [2025-01-10 01:09:37,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:09:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:09:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 288 transitions. [2025-01-10 01:09:37,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3490909090909091 [2025-01-10 01:09:37,309 INFO L175 Difference]: Start difference. First operand has 154 places, 119 transitions, 979 flow. Second operand 15 states and 288 transitions. [2025-01-10 01:09:37,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 236 transitions, 2394 flow [2025-01-10 01:09:37,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 236 transitions, 2288 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-01-10 01:09:37,385 INFO L231 Difference]: Finished difference. Result has 158 places, 124 transitions, 1068 flow [2025-01-10 01:09:37,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1068, PETRI_PLACES=158, PETRI_TRANSITIONS=124} [2025-01-10 01:09:37,385 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 102 predicate places. [2025-01-10 01:09:37,385 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 124 transitions, 1068 flow [2025-01-10 01:09:37,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.263157894736842) internal successors, (252), 19 states have internal predecessors, (252), 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:09:37,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:37,386 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:37,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 01:09:37,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:37,588 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:37,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1746257379, now seen corresponding path program 2 times [2025-01-10 01:09:37,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:37,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704300140] [2025-01-10 01:09:37,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:37,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:09:37,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:09:37,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:37,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:37,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704300140] [2025-01-10 01:09:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704300140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800966123] [2025-01-10 01:09:37,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:37,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:37,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:37,696 INFO L229 MonitoredProcess]: Starting monitored process 17 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:09:37,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:09:37,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:09:37,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:09:37,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:37,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:37,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:09:37,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:37,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:37,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800966123] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:37,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:37,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-10 01:09:37,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041681905] [2025-01-10 01:09:37,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:37,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:09:37,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:37,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:09:37,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:09:38,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:09:38,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 124 transitions, 1068 flow. Second operand has 19 states, 19 states have (on average 13.263157894736842) internal successors, (252), 19 states have internal predecessors, (252), 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:09:38,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:38,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:09:38,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:39,850 INFO L124 PetriNetUnfolderBase]: 12609/18131 cut-off events. [2025-01-10 01:09:39,851 INFO L125 PetriNetUnfolderBase]: For 80817/82305 co-relation queries the response was YES. [2025-01-10 01:09:39,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81755 conditions, 18131 events. 12609/18131 cut-off events. For 80817/82305 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 99775 event pairs, 6522 based on Foata normal form. 164/18287 useless extension candidates. Maximal degree in co-relation 80532. Up to 10131 conditions per place. [2025-01-10 01:09:40,043 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 162 selfloop transitions, 58 changer transitions 0/223 dead transitions. [2025-01-10 01:09:40,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 223 transitions, 2163 flow [2025-01-10 01:09:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:09:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:09:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 314 transitions. [2025-01-10 01:09:40,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3568181818181818 [2025-01-10 01:09:40,045 INFO L175 Difference]: Start difference. First operand has 158 places, 124 transitions, 1068 flow. Second operand 16 states and 314 transitions. [2025-01-10 01:09:40,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 223 transitions, 2163 flow [2025-01-10 01:09:40,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 223 transitions, 2055 flow, removed 12 selfloop flow, removed 13 redundant places. [2025-01-10 01:09:40,186 INFO L231 Difference]: Finished difference. Result has 162 places, 127 transitions, 1180 flow [2025-01-10 01:09:40,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1180, PETRI_PLACES=162, PETRI_TRANSITIONS=127} [2025-01-10 01:09:40,187 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 106 predicate places. [2025-01-10 01:09:40,187 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 127 transitions, 1180 flow [2025-01-10 01:09:40,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.263157894736842) internal successors, (252), 19 states have internal predecessors, (252), 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:09:40,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:40,188 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:40,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 01:09:40,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:40,389 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:40,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash 934792350, now seen corresponding path program 2 times [2025-01-10 01:09:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:40,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65954748] [2025-01-10 01:09:40,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:40,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:40,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:09:40,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:09:40,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:40,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:40,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65954748] [2025-01-10 01:09:40,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65954748] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873413061] [2025-01-10 01:09:40,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:40,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:40,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:40,608 INFO L229 MonitoredProcess]: Starting monitored process 18 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:09:40,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:09:40,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:09:40,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:09:40,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:40,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:40,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:09:40,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:40,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:41,146 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 36 treesize of output 32 [2025-01-10 01:09:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:41,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873413061] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:41,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:41,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2025-01-10 01:09:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42960381] [2025-01-10 01:09:41,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:41,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:09:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:41,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:09:41,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:09:41,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:09:41,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 127 transitions, 1180 flow. Second operand has 30 states, 30 states have (on average 13.2) internal successors, (396), 30 states have internal predecessors, (396), 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:09:41,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:41,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:09:41,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:46,269 INFO L124 PetriNetUnfolderBase]: 11475/16082 cut-off events. [2025-01-10 01:09:46,270 INFO L125 PetriNetUnfolderBase]: For 96923/99072 co-relation queries the response was YES. [2025-01-10 01:09:46,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77051 conditions, 16082 events. 11475/16082 cut-off events. For 96923/99072 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 84195 event pairs, 2498 based on Foata normal form. 453/16528 useless extension candidates. Maximal degree in co-relation 75366. Up to 3164 conditions per place. [2025-01-10 01:09:46,408 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 361 selfloop transitions, 72 changer transitions 0/437 dead transitions. [2025-01-10 01:09:46,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 437 transitions, 4477 flow [2025-01-10 01:09:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-10 01:09:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-01-10 01:09:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 779 transitions. [2025-01-10 01:09:46,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35409090909090907 [2025-01-10 01:09:46,411 INFO L175 Difference]: Start difference. First operand has 162 places, 127 transitions, 1180 flow. Second operand 40 states and 779 transitions. [2025-01-10 01:09:46,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 437 transitions, 4477 flow [2025-01-10 01:09:46,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 437 transitions, 4340 flow, removed 32 selfloop flow, removed 11 redundant places. [2025-01-10 01:09:46,533 INFO L231 Difference]: Finished difference. Result has 193 places, 144 transitions, 1369 flow [2025-01-10 01:09:46,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=1369, PETRI_PLACES=193, PETRI_TRANSITIONS=144} [2025-01-10 01:09:46,534 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 137 predicate places. [2025-01-10 01:09:46,534 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 144 transitions, 1369 flow [2025-01-10 01:09:46,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 13.2) internal successors, (396), 30 states have internal predecessors, (396), 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:09:46,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:46,535 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:46,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 01:09:46,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:46,739 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:46,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash 934792348, now seen corresponding path program 1 times [2025-01-10 01:09:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325614456] [2025-01-10 01:09:46,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:46,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:09:46,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:09:46,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:46,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:46,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325614456] [2025-01-10 01:09:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325614456] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804278233] [2025-01-10 01:09:46,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:46,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:46,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:46,929 INFO L229 MonitoredProcess]: Starting monitored process 19 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:09:46,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 01:09:46,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:09:47,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:09:47,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:47,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:47,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 01:09:47,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:47,013 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:09:47,020 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:09:47,124 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:09:47,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-01-10 01:09:47,142 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:09:47,142 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:09:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:47,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:48,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804278233] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:48,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2025-01-10 01:09:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172467621] [2025-01-10 01:09:48,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:48,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:09:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:48,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:09:48,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:09:48,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-01-10 01:09:48,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 144 transitions, 1369 flow. Second operand has 30 states, 30 states have (on average 9.133333333333333) internal successors, (274), 30 states have internal predecessors, (274), 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:09:48,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:48,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-01-10 01:09:48,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:51,588 INFO L124 PetriNetUnfolderBase]: 11279/15860 cut-off events. [2025-01-10 01:09:51,589 INFO L125 PetriNetUnfolderBase]: For 99269/101337 co-relation queries the response was YES. [2025-01-10 01:09:51,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81348 conditions, 15860 events. 11279/15860 cut-off events. For 99269/101337 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 83052 event pairs, 2498 based on Foata normal form. 453/16306 useless extension candidates. Maximal degree in co-relation 79605. Up to 3644 conditions per place. [2025-01-10 01:09:51,781 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 331 selfloop transitions, 63 changer transitions 0/398 dead transitions. [2025-01-10 01:09:51,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 398 transitions, 4398 flow [2025-01-10 01:09:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 01:09:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-10 01:09:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 456 transitions. [2025-01-10 01:09:51,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26744868035190617 [2025-01-10 01:09:51,783 INFO L175 Difference]: Start difference. First operand has 193 places, 144 transitions, 1369 flow. Second operand 31 states and 456 transitions. [2025-01-10 01:09:51,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 398 transitions, 4398 flow [2025-01-10 01:09:52,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 398 transitions, 4222 flow, removed 18 selfloop flow, removed 24 redundant places. [2025-01-10 01:09:52,165 INFO L231 Difference]: Finished difference. Result has 199 places, 148 transitions, 1378 flow [2025-01-10 01:09:52,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1378, PETRI_PLACES=199, PETRI_TRANSITIONS=148} [2025-01-10 01:09:52,166 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 143 predicate places. [2025-01-10 01:09:52,166 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 148 transitions, 1378 flow [2025-01-10 01:09:52,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.133333333333333) internal successors, (274), 30 states have internal predecessors, (274), 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:09:52,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:52,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:52,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-01-10 01:09:52,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:09:52,370 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:52,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1338708108, now seen corresponding path program 1 times [2025-01-10 01:09:52,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:52,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803661037] [2025-01-10 01:09:52,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:52,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:52,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:09:52,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:09:52,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:52,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:52,407 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:09:52,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:52,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803661037] [2025-01-10 01:09:52,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803661037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:52,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:52,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180063640] [2025-01-10 01:09:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:52,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:52,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:52,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:52,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:52,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-01-10 01:09:52,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 148 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:09:52,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:52,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-01-10 01:09:52,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:53,693 INFO L124 PetriNetUnfolderBase]: 9423/14123 cut-off events. [2025-01-10 01:09:53,694 INFO L125 PetriNetUnfolderBase]: For 78586/80053 co-relation queries the response was YES. [2025-01-10 01:09:53,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68404 conditions, 14123 events. 9423/14123 cut-off events. For 78586/80053 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 79518 event pairs, 2250 based on Foata normal form. 47/14155 useless extension candidates. Maximal degree in co-relation 66266. Up to 11843 conditions per place. [2025-01-10 01:09:53,800 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 169 selfloop transitions, 10 changer transitions 1/191 dead transitions. [2025-01-10 01:09:53,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 191 transitions, 2079 flow [2025-01-10 01:09:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-01-10 01:09:53,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2025-01-10 01:09:53,802 INFO L175 Difference]: Start difference. First operand has 199 places, 148 transitions, 1378 flow. Second operand 3 states and 86 transitions. [2025-01-10 01:09:53,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 191 transitions, 2079 flow [2025-01-10 01:09:53,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 191 transitions, 1920 flow, removed 16 selfloop flow, removed 22 redundant places. [2025-01-10 01:09:53,926 INFO L231 Difference]: Finished difference. Result has 180 places, 157 transitions, 1331 flow [2025-01-10 01:09:53,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=180, PETRI_TRANSITIONS=157} [2025-01-10 01:09:53,927 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 124 predicate places. [2025-01-10 01:09:53,927 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 157 transitions, 1331 flow [2025-01-10 01:09:53,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:09:53,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:53,927 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:53,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:09:53,928 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:53,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2054119496, now seen corresponding path program 2 times [2025-01-10 01:09:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:53,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687160412] [2025-01-10 01:09:53,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:53,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:53,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:09:53,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:09:53,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:53,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:09:54,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:54,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687160412] [2025-01-10 01:09:54,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687160412] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:54,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242305113] [2025-01-10 01:09:54,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:54,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:54,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:54,283 INFO L229 MonitoredProcess]: Starting monitored process 20 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:09:54,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 01:09:54,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:09:54,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:09:54,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:54,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:54,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 01:09:54,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:54,388 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:09:54,511 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-10 01:09:54,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2025-01-10 01:09:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:09:54,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:09:55,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242305113] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:55,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:55,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-01-10 01:09:55,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372693490] [2025-01-10 01:09:55,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:55,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:09:55,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:55,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:09:55,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:09:55,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-01-10 01:09:55,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 157 transitions, 1331 flow. Second operand has 26 states, 26 states have (on average 9.26923076923077) internal successors, (241), 26 states have internal predecessors, (241), 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:09:55,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:55,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-01-10 01:09:55,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:59,234 INFO L124 PetriNetUnfolderBase]: 14479/20234 cut-off events. [2025-01-10 01:09:59,234 INFO L125 PetriNetUnfolderBase]: For 95671/97008 co-relation queries the response was YES. [2025-01-10 01:09:59,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92967 conditions, 20234 events. 14479/20234 cut-off events. For 95671/97008 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 107425 event pairs, 1822 based on Foata normal form. 633/20853 useless extension candidates. Maximal degree in co-relation 92073. Up to 3468 conditions per place. [2025-01-10 01:09:59,408 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 304 selfloop transitions, 62 changer transitions 0/374 dead transitions. [2025-01-10 01:09:59,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 374 transitions, 3566 flow [2025-01-10 01:09:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-10 01:09:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-01-10 01:09:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 455 transitions. [2025-01-10 01:09:59,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2852664576802508 [2025-01-10 01:09:59,410 INFO L175 Difference]: Start difference. First operand has 180 places, 157 transitions, 1331 flow. Second operand 29 states and 455 transitions. [2025-01-10 01:09:59,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 374 transitions, 3566 flow [2025-01-10 01:09:59,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 374 transitions, 3316 flow, removed 53 selfloop flow, removed 14 redundant places. [2025-01-10 01:09:59,509 INFO L231 Difference]: Finished difference. Result has 185 places, 155 transitions, 1363 flow [2025-01-10 01:09:59,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1363, PETRI_PLACES=185, PETRI_TRANSITIONS=155} [2025-01-10 01:09:59,510 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 129 predicate places. [2025-01-10 01:09:59,510 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 155 transitions, 1363 flow [2025-01-10 01:09:59,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.26923076923077) internal successors, (241), 26 states have internal predecessors, (241), 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:09:59,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:59,510 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:59,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-10 01:09:59,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:59,715 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:09:59,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash -87606456, now seen corresponding path program 3 times [2025-01-10 01:09:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457898095] [2025-01-10 01:09:59,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:09:59,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:59,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 5 equivalence classes. [2025-01-10 01:09:59,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 25 statements. [2025-01-10 01:09:59,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:09:59,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:09:59,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:59,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457898095] [2025-01-10 01:09:59,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457898095] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:59,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775729033] [2025-01-10 01:09:59,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:09:59,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:59,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:59,874 INFO L229 MonitoredProcess]: Starting monitored process 21 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:09:59,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 01:09:59,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 5 equivalence classes. [2025-01-10 01:09:59,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 25 statements. [2025-01-10 01:09:59,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:09:59,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:59,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:09:59,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:59,959 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:10:00,015 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:10:00,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-01-10 01:10:00,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:10:00,028 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:10:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:10:00,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:00,263 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 42 treesize of output 38 [2025-01-10 01:10:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:10:00,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775729033] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:00,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:00,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2025-01-10 01:10:00,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998423127] [2025-01-10 01:10:00,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:00,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:10:00,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:00,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:10:00,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:10:00,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2025-01-10 01:10:00,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 155 transitions, 1363 flow. Second operand has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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:10:00,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:00,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2025-01-10 01:10:00,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:02,352 INFO L124 PetriNetUnfolderBase]: 12776/18347 cut-off events. [2025-01-10 01:10:02,353 INFO L125 PetriNetUnfolderBase]: For 104678/106322 co-relation queries the response was YES. [2025-01-10 01:10:02,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92341 conditions, 18347 events. 12776/18347 cut-off events. For 104678/106322 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 100163 event pairs, 3262 based on Foata normal form. 300/18645 useless extension candidates. Maximal degree in co-relation 87312. Up to 7216 conditions per place. [2025-01-10 01:10:02,553 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 246 selfloop transitions, 36 changer transitions 0/290 dead transitions. [2025-01-10 01:10:02,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 290 transitions, 3023 flow [2025-01-10 01:10:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:10:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:10:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2025-01-10 01:10:02,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3340909090909091 [2025-01-10 01:10:02,555 INFO L175 Difference]: Start difference. First operand has 185 places, 155 transitions, 1363 flow. Second operand 8 states and 147 transitions. [2025-01-10 01:10:02,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 290 transitions, 3023 flow [2025-01-10 01:10:02,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 290 transitions, 2693 flow, removed 53 selfloop flow, removed 24 redundant places. [2025-01-10 01:10:02,762 INFO L231 Difference]: Finished difference. Result has 168 places, 155 transitions, 1312 flow [2025-01-10 01:10:02,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1312, PETRI_PLACES=168, PETRI_TRANSITIONS=155} [2025-01-10 01:10:02,763 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 112 predicate places. [2025-01-10 01:10:02,763 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 155 transitions, 1312 flow [2025-01-10 01:10:02,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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:10:02,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:02,764 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:02,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:02,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-10 01:10:02,965 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:10:02,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash -87606454, now seen corresponding path program 3 times [2025-01-10 01:10:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:02,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374534747] [2025-01-10 01:10:02,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:10:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:02,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 5 equivalence classes. [2025-01-10 01:10:02,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 25 statements. [2025-01-10 01:10:02,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:10:02,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-10 01:10:03,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:03,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374534747] [2025-01-10 01:10:03,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374534747] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:03,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737415976] [2025-01-10 01:10:03,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:10:03,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:03,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:03,176 INFO L229 MonitoredProcess]: Starting monitored process 22 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:10:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 01:10:03,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 5 equivalence classes. [2025-01-10 01:10:03,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 25 statements. [2025-01-10 01:10:03,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:10:03,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:03,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:10:03,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-10 01:10:03,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:03,572 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 50 treesize of output 46 [2025-01-10 01:10:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-10 01:10:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737415976] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:03,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:03,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2025-01-10 01:10:03,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617523685] [2025-01-10 01:10:03,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:03,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:10:03,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:03,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:10:03,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:10:03,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:10:03,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 155 transitions, 1312 flow. Second operand has 19 states, 19 states have (on average 13.473684210526315) internal successors, (256), 19 states have internal predecessors, (256), 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:10:03,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:03,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:10:03,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:05,923 INFO L124 PetriNetUnfolderBase]: 12040/17103 cut-off events. [2025-01-10 01:10:05,924 INFO L125 PetriNetUnfolderBase]: For 79969/81212 co-relation queries the response was YES. [2025-01-10 01:10:06,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83626 conditions, 17103 events. 12040/17103 cut-off events. For 79969/81212 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 92837 event pairs, 1469 based on Foata normal form. 256/17356 useless extension candidates. Maximal degree in co-relation 79191. Up to 4604 conditions per place. [2025-01-10 01:10:06,062 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 313 selfloop transitions, 28 changer transitions 0/349 dead transitions. [2025-01-10 01:10:06,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 349 transitions, 3301 flow [2025-01-10 01:10:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:10:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:10:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2025-01-10 01:10:06,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2025-01-10 01:10:06,063 INFO L175 Difference]: Start difference. First operand has 168 places, 155 transitions, 1312 flow. Second operand 8 states and 175 transitions. [2025-01-10 01:10:06,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 349 transitions, 3301 flow [2025-01-10 01:10:06,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 349 transitions, 3230 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:06,158 INFO L231 Difference]: Finished difference. Result has 168 places, 154 transitions, 1287 flow [2025-01-10 01:10:06,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1287, PETRI_PLACES=168, PETRI_TRANSITIONS=154} [2025-01-10 01:10:06,159 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 112 predicate places. [2025-01-10 01:10:06,159 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 154 transitions, 1287 flow [2025-01-10 01:10:06,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.473684210526315) internal successors, (256), 19 states have internal predecessors, (256), 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:10:06,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:06,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:06,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:06,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 01:10:06,364 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:10:06,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1176041549, now seen corresponding path program 1 times [2025-01-10 01:10:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:06,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427268253] [2025-01-10 01:10:06,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:06,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:06,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:10:06,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:10:06,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:06,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:06,415 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:10:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:06,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427268253] [2025-01-10 01:10:06,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427268253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:06,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178511833] [2025-01-10 01:10:06,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:06,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:06,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:06,423 INFO L229 MonitoredProcess]: Starting monitored process 23 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:10:06,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 01:10:06,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:10:06,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:10:06,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:06,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:06,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:10:06,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:06,549 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:10:06,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178511833] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:06,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:10:06,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-10 01:10:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078502331] [2025-01-10 01:10:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:06,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:10:06,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:06,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:10:06,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:10:06,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:10:06,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 154 transitions, 1287 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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:10:06,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:06,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:10:06,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:07,933 INFO L124 PetriNetUnfolderBase]: 11425/16586 cut-off events. [2025-01-10 01:10:07,933 INFO L125 PetriNetUnfolderBase]: For 90169/91225 co-relation queries the response was YES. [2025-01-10 01:10:08,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80109 conditions, 16586 events. 11425/16586 cut-off events. For 90169/91225 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 91246 event pairs, 2657 based on Foata normal form. 410/16966 useless extension candidates. Maximal degree in co-relation 75999. Up to 9030 conditions per place. [2025-01-10 01:10:08,066 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 187 selfloop transitions, 12 changer transitions 0/207 dead transitions. [2025-01-10 01:10:08,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 207 transitions, 2038 flow [2025-01-10 01:10:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:10:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:10:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-01-10 01:10:08,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36727272727272725 [2025-01-10 01:10:08,067 INFO L175 Difference]: Start difference. First operand has 168 places, 154 transitions, 1287 flow. Second operand 5 states and 101 transitions. [2025-01-10 01:10:08,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 207 transitions, 2038 flow [2025-01-10 01:10:08,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 207 transitions, 1938 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-01-10 01:10:08,176 INFO L231 Difference]: Finished difference. Result has 162 places, 151 transitions, 1180 flow [2025-01-10 01:10:08,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1180, PETRI_PLACES=162, PETRI_TRANSITIONS=151} [2025-01-10 01:10:08,176 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 106 predicate places. [2025-01-10 01:10:08,178 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 151 transitions, 1180 flow [2025-01-10 01:10:08,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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:10:08,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:08,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:08,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-01-10 01:10:08,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 01:10:08,383 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:10:08,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1859099937, now seen corresponding path program 1 times [2025-01-10 01:10:08,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:08,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874823358] [2025-01-10 01:10:08,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:08,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:10:08,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:10:08,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:08,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:10:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:08,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874823358] [2025-01-10 01:10:08,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874823358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:08,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:10:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527469252] [2025-01-10 01:10:08,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:08,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:08,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:08,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:08,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-10 01:10:08,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 151 transitions, 1180 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:10:08,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:08,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-10 01:10:08,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:10,124 INFO L124 PetriNetUnfolderBase]: 10456/15063 cut-off events. [2025-01-10 01:10:10,124 INFO L125 PetriNetUnfolderBase]: For 64966/66953 co-relation queries the response was YES. [2025-01-10 01:10:10,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68555 conditions, 15063 events. 10456/15063 cut-off events. For 64966/66953 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 81280 event pairs, 2512 based on Foata normal form. 446/15109 useless extension candidates. Maximal degree in co-relation 65382. Up to 7990 conditions per place. [2025-01-10 01:10:10,211 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 179 selfloop transitions, 17 changer transitions 0/202 dead transitions. [2025-01-10 01:10:10,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 202 transitions, 2008 flow [2025-01-10 01:10:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-01-10 01:10:10,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39545454545454545 [2025-01-10 01:10:10,216 INFO L175 Difference]: Start difference. First operand has 162 places, 151 transitions, 1180 flow. Second operand 4 states and 87 transitions. [2025-01-10 01:10:10,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 202 transitions, 2008 flow [2025-01-10 01:10:10,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 202 transitions, 1963 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:10,257 INFO L231 Difference]: Finished difference. Result has 158 places, 148 transitions, 1167 flow [2025-01-10 01:10:10,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1167, PETRI_PLACES=158, PETRI_TRANSITIONS=148} [2025-01-10 01:10:10,258 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 102 predicate places. [2025-01-10 01:10:10,258 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 148 transitions, 1167 flow [2025-01-10 01:10:10,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:10:10,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:10,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:10,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 01:10:10,259 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 01:10:10,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1538209724, now seen corresponding path program 1 times [2025-01-10 01:10:10,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:10,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728550598] [2025-01-10 01:10:10,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:10,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:10,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:10:10,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:10:10,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:10,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:10,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:10,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728550598] [2025-01-10 01:10:10,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728550598] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387780132] [2025-01-10 01:10:10,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:10,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:10,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:10,726 INFO L229 MonitoredProcess]: Starting monitored process 24 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:10:10,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-10 01:10:10,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:10:10,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:10:10,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:10,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:10,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-10 01:10:10,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:10,812 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:10:10,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:10:10,878 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:10:10,879 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:10:10,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:10:11,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-10 01:10:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:11,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:19,590 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2025-01-10 01:10:19,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 792 treesize of output 602 [2025-01-10 01:10:19,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:10:19,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 582 treesize of output 542 [2025-01-10 01:10:21,822 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-10 01:10:25,434 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-10 01:10:25,527 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-10 01:10:25,731 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-10 01:10:25,748 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-10 01:10:27,792 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.