./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-1.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/parallel-misc-1.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 faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:05:24,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:05:24,731 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:05:24,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:05:24,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:05:24,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:05:24,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:05:24,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:05:24,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:05:24,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:05:24,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:05:24,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:05:24,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:05:24,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:05:24,778 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:05:24,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:05:24,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:05:24,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:05:24,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:05:24,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:05:24,779 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:05:24,780 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:05:24,780 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:05:24,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:05:24,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:05:24,780 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:05:24,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:05:24,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:05:24,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:05:24,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:05:24,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:05:24,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:05:24,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:05:24,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:24,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:05:24,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:05:24,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:05:24,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:05:24,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:24,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:05:24,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:05:24,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:05:24,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:05:24,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:05:24,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:05:24,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:05:24,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:05:24,784 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2025-01-10 01:05:25,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:05:25,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:05:25,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:05:25,102 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:05:25,102 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:05:25,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-01-10 01:05:26,447 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e066a19da/566f82f7dac8461595631e0a7980e61d/FLAGf667aeccb [2025-01-10 01:05:26,740 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:05:26,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-01-10 01:05:26,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e066a19da/566f82f7dac8461595631e0a7980e61d/FLAGf667aeccb [2025-01-10 01:05:26,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e066a19da/566f82f7dac8461595631e0a7980e61d [2025-01-10 01:05:26,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:05:26,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:05:26,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:05:26,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:05:26,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:05:26,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:26" (1/1) ... [2025-01-10 01:05:26,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebee542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:26, skipping insertion in model container [2025-01-10 01:05:26,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:26" (1/1) ... [2025-01-10 01:05:26,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:05:27,014 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:05:27,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:05:27,034 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:05:27,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:05:27,085 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:05:27,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27 WrapperNode [2025-01-10 01:05:27,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:05:27,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:05:27,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:05:27,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:05:27,095 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:05:27" (1/1) ... [2025-01-10 01:05:27,107 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:05:27" (1/1) ... [2025-01-10 01:05:27,141 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 270 [2025-01-10 01:05:27,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:05:27,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:05:27,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:05:27,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:05:27,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,188 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:05:27,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:05:27,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:05:27,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:05:27,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:05:27,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (1/1) ... [2025-01-10 01:05:27,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:27,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:27,260 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:05:27,264 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:05:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:05:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:05:27,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:05:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:05:27,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:05:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:05:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:05:27,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:05:27,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:05:27,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:05:27,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:05:27,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:05:27,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:05:27,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:05:27,291 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:05:27,400 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:05:27,402 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:05:27,903 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:05:27,904 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:05:28,279 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:05:28,280 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:05:28,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:28 BoogieIcfgContainer [2025-01-10 01:05:28,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:05:28,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:05:28,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:05:28,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:05:28,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:05:26" (1/3) ... [2025-01-10 01:05:28,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c7a12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:28, skipping insertion in model container [2025-01-10 01:05:28,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:27" (2/3) ... [2025-01-10 01:05:28,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c7a12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:28, skipping insertion in model container [2025-01-10 01:05:28,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:28" (3/3) ... [2025-01-10 01:05:28,291 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-01-10 01:05:28,305 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:05:28,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 45 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-01-10 01:05:28,307 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:05:28,367 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:05:28,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 112 flow [2025-01-10 01:05:28,432 INFO L124 PetriNetUnfolderBase]: 5/47 cut-off events. [2025-01-10 01:05:28,437 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:05:28,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 47 events. 5/47 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 113 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-01-10 01:05:28,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 49 transitions, 112 flow [2025-01-10 01:05:28,444 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 46 transitions, 104 flow [2025-01-10 01:05:28,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:05:28,468 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;@18070406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:05:28,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-10 01:05:28,472 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:05:28,473 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:05:28,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:05:28,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:28,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:05:28,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:28,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:28,501 INFO L85 PathProgramCache]: Analyzing trace with hash 953400, now seen corresponding path program 1 times [2025-01-10 01:05:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:28,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948711653] [2025-01-10 01:05:28,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:28,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:28,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:05:28,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:05:28,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:28,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:28,756 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:05:28,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:28,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948711653] [2025-01-10 01:05:28,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948711653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:28,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:28,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:05:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324042042] [2025-01-10 01:05:28,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:28,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:05:28,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:28,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:05:28,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:05:28,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-10 01:05:28,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:28,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:28,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-10 01:05:28,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:29,007 INFO L124 PetriNetUnfolderBase]: 220/507 cut-off events. [2025-01-10 01:05:29,008 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-10 01:05:29,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 507 events. 220/507 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2758 event pairs, 130 based on Foata normal form. 1/396 useless extension candidates. Maximal degree in co-relation 806. Up to 338 conditions per place. [2025-01-10 01:05:29,022 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 23 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-01-10 01:05:29,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 148 flow [2025-01-10 01:05:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:05:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:05:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-01-10 01:05:29,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2025-01-10 01:05:29,036 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 104 flow. Second operand 3 states and 90 transitions. [2025-01-10 01:05:29,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 148 flow [2025-01-10 01:05:29,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:05:29,047 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 94 flow [2025-01-10 01:05:29,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-01-10 01:05:29,052 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-01-10 01:05:29,053 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 94 flow [2025-01-10 01:05:29,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:29,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:29,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:05:29,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:05:29,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:29,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:29,054 INFO L85 PathProgramCache]: Analyzing trace with hash 953401, now seen corresponding path program 1 times [2025-01-10 01:05:29,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:29,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183883578] [2025-01-10 01:05:29,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:29,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:29,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:05:29,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:05:29,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:29,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:29,410 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:05:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:29,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183883578] [2025-01-10 01:05:29,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183883578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:29,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:29,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:05:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422006591] [2025-01-10 01:05:29,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:29,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:29,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:29,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:29,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:29,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-10 01:05:29,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:05:29,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:29,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-10 01:05:29,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:29,611 INFO L124 PetriNetUnfolderBase]: 221/510 cut-off events. [2025-01-10 01:05:29,611 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:05:29,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 510 events. 221/510 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2780 event pairs, 130 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 846. Up to 343 conditions per place. [2025-01-10 01:05:29,615 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 25 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-01-10 01:05:29,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 160 flow [2025-01-10 01:05:29,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-01-10 01:05:29,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2025-01-10 01:05:29,617 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 94 flow. Second operand 4 states and 114 transitions. [2025-01-10 01:05:29,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 160 flow [2025-01-10 01:05:29,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:29,619 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 117 flow [2025-01-10 01:05:29,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-01-10 01:05:29,620 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-01-10 01:05:29,620 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 117 flow [2025-01-10 01:05:29,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:05:29,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:29,620 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:05:29,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:05:29,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:29,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:29,621 INFO L85 PathProgramCache]: Analyzing trace with hash 916249202, now seen corresponding path program 1 times [2025-01-10 01:05:29,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:29,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56995668] [2025-01-10 01:05:29,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:29,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:29,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:05:29,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:05:29,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:29,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:29,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:29,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56995668] [2025-01-10 01:05:29,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56995668] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502666600] [2025-01-10 01:05:29,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:29,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:29,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:29,949 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:05:29,951 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:05:30,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:05:30,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:05:30,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:30,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:30,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:05:30,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:30,084 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:05:30,228 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:05:30,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:30,318 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:05:30,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502666600] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:30,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:30,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:05:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744210462] [2025-01-10 01:05:30,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:30,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:05:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:30,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:05:30,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:05:30,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-10 01:05:30,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 117 flow. Second operand has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 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:05:30,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:30,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-10 01:05:30,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:30,810 INFO L124 PetriNetUnfolderBase]: 222/512 cut-off events. [2025-01-10 01:05:30,811 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:05:30,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 512 events. 222/512 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2795 event pairs, 130 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 853. Up to 340 conditions per place. [2025-01-10 01:05:30,814 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 21 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2025-01-10 01:05:30,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 187 flow [2025-01-10 01:05:30,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:05:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:05:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2025-01-10 01:05:30,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5127551020408163 [2025-01-10 01:05:30,817 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 117 flow. Second operand 8 states and 201 transitions. [2025-01-10 01:05:30,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 187 flow [2025-01-10 01:05:30,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:05:30,818 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 142 flow [2025-01-10 01:05:30,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=142, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-01-10 01:05:30,819 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2025-01-10 01:05:30,819 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 142 flow [2025-01-10 01:05:30,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 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:05:30,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:30,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:05:30,828 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:05:31,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:31,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1657942358, now seen corresponding path program 1 times [2025-01-10 01:05:31,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:31,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668154610] [2025-01-10 01:05:31,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:31,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:31,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:05:31,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:05:31,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:31,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:31,098 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:05:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668154610] [2025-01-10 01:05:31,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668154610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:31,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:31,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:05:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116655324] [2025-01-10 01:05:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:31,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:31,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:31,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:31,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-01-10 01:05:31,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:31,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:31,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-01-10 01:05:31,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:31,250 INFO L124 PetriNetUnfolderBase]: 222/443 cut-off events. [2025-01-10 01:05:31,250 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:05:31,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 443 events. 222/443 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2057 event pairs, 130 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 785. Up to 339 conditions per place. [2025-01-10 01:05:31,253 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 27 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-01-10 01:05:31,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 192 flow [2025-01-10 01:05:31,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-01-10 01:05:31,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-01-10 01:05:31,255 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 142 flow. Second operand 4 states and 91 transitions. [2025-01-10 01:05:31,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 192 flow [2025-01-10 01:05:31,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 150 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-01-10 01:05:31,256 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 96 flow [2025-01-10 01:05:31,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2025-01-10 01:05:31,257 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2025-01-10 01:05:31,257 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 96 flow [2025-01-10 01:05:31,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:31,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:31,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:05:31,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:05:31,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:31,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1657942357, now seen corresponding path program 1 times [2025-01-10 01:05:31,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:31,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557890499] [2025-01-10 01:05:31,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:31,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:31,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:05:31,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:05:31,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:31,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:31,330 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:05:31,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:31,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557890499] [2025-01-10 01:05:31,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557890499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:31,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:31,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:31,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499121280] [2025-01-10 01:05:31,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:31,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:31,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:31,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:31,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:31,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-10 01:05:31,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:05:31,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:31,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-10 01:05:31,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:31,516 INFO L124 PetriNetUnfolderBase]: 274/530 cut-off events. [2025-01-10 01:05:31,517 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:05:31,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 530 events. 274/530 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2352 event pairs, 157 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 760. Up to 316 conditions per place. [2025-01-10 01:05:31,521 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 40 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-01-10 01:05:31,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 210 flow [2025-01-10 01:05:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-01-10 01:05:31,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-01-10 01:05:31,524 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 96 flow. Second operand 4 states and 126 transitions. [2025-01-10 01:05:31,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 210 flow [2025-01-10 01:05:31,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:31,526 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 110 flow [2025-01-10 01:05:31,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-01-10 01:05:31,526 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-01-10 01:05:31,527 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 110 flow [2025-01-10 01:05:31,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:05:31,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:31,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:31,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:05:31,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:31,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1466870226, now seen corresponding path program 1 times [2025-01-10 01:05:31,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:31,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229519517] [2025-01-10 01:05:31,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:31,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:31,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:05:31,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:05:31,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:31,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:31,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229519517] [2025-01-10 01:05:31,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229519517] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:31,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635666975] [2025-01-10 01:05:31,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:31,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:31,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:31,724 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:05:31,726 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:05:31,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:05:31,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:05:31,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:31,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:31,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:05:31,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:31,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:31,942 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:05:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:31,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635666975] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:31,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:31,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 01:05:31,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718339343] [2025-01-10 01:05:31,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:31,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:05:31,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:31,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:05:31,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:05:32,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-01-10 01:05:32,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 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:05:32,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:32,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-01-10 01:05:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:32,457 INFO L124 PetriNetUnfolderBase]: 410/762 cut-off events. [2025-01-10 01:05:32,458 INFO L125 PetriNetUnfolderBase]: For 164/190 co-relation queries the response was YES. [2025-01-10 01:05:32,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 762 events. 410/762 cut-off events. For 164/190 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3647 event pairs, 167 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 1282. Up to 266 conditions per place. [2025-01-10 01:05:32,462 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 56 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2025-01-10 01:05:32,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 305 flow [2025-01-10 01:05:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:05:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:05:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2025-01-10 01:05:32,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608843537414966 [2025-01-10 01:05:32,464 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 110 flow. Second operand 6 states and 179 transitions. [2025-01-10 01:05:32,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 305 flow [2025-01-10 01:05:32,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:05:32,466 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 135 flow [2025-01-10 01:05:32,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-01-10 01:05:32,467 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-01-10 01:05:32,467 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 135 flow [2025-01-10 01:05:32,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 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:05:32,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:32,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:32,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:32,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:32,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:32,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:32,673 INFO L85 PathProgramCache]: Analyzing trace with hash 150332632, now seen corresponding path program 1 times [2025-01-10 01:05:32,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:32,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445919935] [2025-01-10 01:05:32,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:32,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:32,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:05:32,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:05:32,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:32,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:32,734 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:05:32,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:32,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445919935] [2025-01-10 01:05:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445919935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:32,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:32,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807921425] [2025-01-10 01:05:32,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:32,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:32,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:32,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:32,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:32,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-10 01:05:32,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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:05:32,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:32,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-10 01:05:32,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:32,917 INFO L124 PetriNetUnfolderBase]: 418/751 cut-off events. [2025-01-10 01:05:32,918 INFO L125 PetriNetUnfolderBase]: For 271/296 co-relation queries the response was YES. [2025-01-10 01:05:32,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 751 events. 418/751 cut-off events. For 271/296 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3364 event pairs, 250 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 1556. Up to 553 conditions per place. [2025-01-10 01:05:32,923 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 46 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-01-10 01:05:32,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 284 flow [2025-01-10 01:05:32,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-01-10 01:05:32,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6479591836734694 [2025-01-10 01:05:32,924 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 135 flow. Second operand 4 states and 127 transitions. [2025-01-10 01:05:32,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 284 flow [2025-01-10 01:05:32,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:32,926 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 148 flow [2025-01-10 01:05:32,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-01-10 01:05:32,929 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2025-01-10 01:05:32,929 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 148 flow [2025-01-10 01:05:32,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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:05:32,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:32,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:32,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:05:32,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash 913084991, now seen corresponding path program 1 times [2025-01-10 01:05:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654049969] [2025-01-10 01:05:32,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:32,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:05:32,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:05:32,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:32,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:33,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:33,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654049969] [2025-01-10 01:05:33,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654049969] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:33,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119822590] [2025-01-10 01:05:33,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:33,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:33,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:33,109 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:05:33,110 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:05:33,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:05:33,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:05:33,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:33,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:33,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:05:33,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:33,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:33,319 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:05:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:33,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119822590] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:33,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:33,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 01:05:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275471723] [2025-01-10 01:05:33,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:33,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:05:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:33,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:05:33,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:05:33,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-01-10 01:05:33,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 148 flow. Second operand has 9 states, 9 states have (on average 21.333333333333332) internal successors, (192), 9 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:33,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:33,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-01-10 01:05:33,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:33,798 INFO L124 PetriNetUnfolderBase]: 638/1070 cut-off events. [2025-01-10 01:05:33,799 INFO L125 PetriNetUnfolderBase]: For 618/684 co-relation queries the response was YES. [2025-01-10 01:05:33,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2562 conditions, 1070 events. 638/1070 cut-off events. For 618/684 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4815 event pairs, 247 based on Foata normal form. 0/916 useless extension candidates. Maximal degree in co-relation 2454. Up to 467 conditions per place. [2025-01-10 01:05:33,809 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 62 selfloop transitions, 8 changer transitions 0/76 dead transitions. [2025-01-10 01:05:33,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 393 flow [2025-01-10 01:05:33,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:05:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:05:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-01-10 01:05:33,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-01-10 01:05:33,813 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 148 flow. Second operand 6 states and 178 transitions. [2025-01-10 01:05:33,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 393 flow [2025-01-10 01:05:33,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:05:33,817 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 173 flow [2025-01-10 01:05:33,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-01-10 01:05:33,818 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2025-01-10 01:05:33,818 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 173 flow [2025-01-10 01:05:33,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.333333333333332) internal successors, (192), 9 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:33,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:33,819 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:33,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:34,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:34,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:34,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 504727716, now seen corresponding path program 1 times [2025-01-10 01:05:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748319421] [2025-01-10 01:05:34,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:34,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:05:34,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:05:34,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:34,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:34,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748319421] [2025-01-10 01:05:34,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748319421] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583476357] [2025-01-10 01:05:34,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:34,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:34,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:34,145 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:05:34,147 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:05:34,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:05:34,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:05:34,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:34,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:34,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:05:34,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:34,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:34,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583476357] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:34,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:34,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-01-10 01:05:34,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785525532] [2025-01-10 01:05:34,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:34,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:05:34,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:34,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:05:34,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:05:34,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-10 01:05:34,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 173 flow. Second operand has 14 states, 14 states have (on average 23.071428571428573) internal successors, (323), 14 states have internal predecessors, (323), 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:05:34,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:34,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-10 01:05:34,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:35,035 INFO L124 PetriNetUnfolderBase]: 1085/1894 cut-off events. [2025-01-10 01:05:35,035 INFO L125 PetriNetUnfolderBase]: For 1089/1130 co-relation queries the response was YES. [2025-01-10 01:05:35,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 1894 events. 1085/1894 cut-off events. For 1089/1130 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9838 event pairs, 646 based on Foata normal form. 26/1731 useless extension candidates. Maximal degree in co-relation 3928. Up to 873 conditions per place. [2025-01-10 01:05:35,045 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 93 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2025-01-10 01:05:35,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 109 transitions, 599 flow [2025-01-10 01:05:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:05:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:05:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 280 transitions. [2025-01-10 01:05:35,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2025-01-10 01:05:35,048 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 173 flow. Second operand 9 states and 280 transitions. [2025-01-10 01:05:35,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 109 transitions, 599 flow [2025-01-10 01:05:35,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:35,056 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 215 flow [2025-01-10 01:05:35,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=215, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-01-10 01:05:35,058 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2025-01-10 01:05:35,058 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 215 flow [2025-01-10 01:05:35,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 23.071428571428573) internal successors, (323), 14 states have internal predecessors, (323), 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:05:35,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:35,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:35,067 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:05:35,259 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,SelfDestructingSolverStorable8 [2025-01-10 01:05:35,259 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:35,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash -877066328, now seen corresponding path program 1 times [2025-01-10 01:05:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:35,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399836653] [2025-01-10 01:05:35,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:35,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:05:35,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:05:35,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:35,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:35,427 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:05:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:35,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399836653] [2025-01-10 01:05:35,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399836653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:35,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:35,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:05:35,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131871447] [2025-01-10 01:05:35,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:35,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:05:35,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:35,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:05:35,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:05:35,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:05:35,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:05:35,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:35,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:05:35,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:35,776 INFO L124 PetriNetUnfolderBase]: 1410/2415 cut-off events. [2025-01-10 01:05:35,776 INFO L125 PetriNetUnfolderBase]: For 2449/2592 co-relation queries the response was YES. [2025-01-10 01:05:35,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6570 conditions, 2415 events. 1410/2415 cut-off events. For 2449/2592 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13329 event pairs, 169 based on Foata normal form. 3/2144 useless extension candidates. Maximal degree in co-relation 5474. Up to 1227 conditions per place. [2025-01-10 01:05:35,792 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 76 selfloop transitions, 17 changer transitions 4/104 dead transitions. [2025-01-10 01:05:35,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 642 flow [2025-01-10 01:05:35,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:05:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:05:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2025-01-10 01:05:35,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746938775510204 [2025-01-10 01:05:35,794 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 215 flow. Second operand 5 states and 183 transitions. [2025-01-10 01:05:35,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 642 flow [2025-01-10 01:05:35,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 634 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:35,803 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 337 flow [2025-01-10 01:05:35,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2025-01-10 01:05:35,804 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2025-01-10 01:05:35,804 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 337 flow [2025-01-10 01:05:35,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:05:35,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:35,804 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:35,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:05:35,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:35,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1267548860, now seen corresponding path program 1 times [2025-01-10 01:05:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:35,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37836427] [2025-01-10 01:05:35,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:35,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:05:35,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:05:35,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:35,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:35,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:35,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37836427] [2025-01-10 01:05:35,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37836427] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:35,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2381062] [2025-01-10 01:05:35,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:35,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:35,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:35,904 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:05:35,907 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:05:35,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:05:35,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:05:35,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:35,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:35,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:05:35,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:36,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:36,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2381062] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:36,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:36,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-01-10 01:05:36,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932002185] [2025-01-10 01:05:36,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:36,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:05:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:36,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:05:36,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:05:36,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-10 01:05:36,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 337 flow. Second operand has 14 states, 14 states have (on average 23.5) internal successors, (329), 14 states have internal predecessors, (329), 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:05:36,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:36,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-10 01:05:36,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:36,781 INFO L124 PetriNetUnfolderBase]: 1310/2202 cut-off events. [2025-01-10 01:05:36,782 INFO L125 PetriNetUnfolderBase]: For 4050/4132 co-relation queries the response was YES. [2025-01-10 01:05:36,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7410 conditions, 2202 events. 1310/2202 cut-off events. For 4050/4132 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 11455 event pairs, 722 based on Foata normal form. 27/2221 useless extension candidates. Maximal degree in co-relation 6167. Up to 1423 conditions per place. [2025-01-10 01:05:36,800 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 111 selfloop transitions, 10 changer transitions 1/128 dead transitions. [2025-01-10 01:05:36,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 128 transitions, 952 flow [2025-01-10 01:05:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:05:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:05:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2025-01-10 01:05:36,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-01-10 01:05:36,802 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 337 flow. Second operand 9 states and 273 transitions. [2025-01-10 01:05:36,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 128 transitions, 952 flow [2025-01-10 01:05:36,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 128 transitions, 875 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 01:05:36,813 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 355 flow [2025-01-10 01:05:36,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=355, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2025-01-10 01:05:36,814 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2025-01-10 01:05:36,814 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 355 flow [2025-01-10 01:05:36,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 23.5) internal successors, (329), 14 states have internal predecessors, (329), 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:05:36,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:36,815 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:36,822 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:05:37,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:05:37,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:37,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash -796515427, now seen corresponding path program 2 times [2025-01-10 01:05:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219032799] [2025-01-10 01:05:37,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:37,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:05:37,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:05:37,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:37,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:05:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219032799] [2025-01-10 01:05:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219032799] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345772805] [2025-01-10 01:05:37,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:37,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:37,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:37,274 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:05:37,276 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:05:37,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:05:37,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:05:37,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:37,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:37,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:05:37,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:37,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:37,586 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 18 treesize of output 14 [2025-01-10 01:05:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:37,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345772805] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:37,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:37,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 6] total 14 [2025-01-10 01:05:37,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279735970] [2025-01-10 01:05:37,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:37,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:05:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:37,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:05:37,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:05:38,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2025-01-10 01:05:38,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 355 flow. Second operand has 16 states, 16 states have (on average 20.5) internal successors, (328), 16 states have internal predecessors, (328), 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:05:38,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:38,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2025-01-10 01:05:38,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:38,841 INFO L124 PetriNetUnfolderBase]: 1779/2950 cut-off events. [2025-01-10 01:05:38,841 INFO L125 PetriNetUnfolderBase]: For 3157/3157 co-relation queries the response was YES. [2025-01-10 01:05:38,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9905 conditions, 2950 events. 1779/2950 cut-off events. For 3157/3157 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 15221 event pairs, 620 based on Foata normal form. 84/3011 useless extension candidates. Maximal degree in co-relation 8073. Up to 882 conditions per place. [2025-01-10 01:05:38,863 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 133 selfloop transitions, 10 changer transitions 0/148 dead transitions. [2025-01-10 01:05:38,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 148 transitions, 1077 flow [2025-01-10 01:05:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:05:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:05:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 247 transitions. [2025-01-10 01:05:38,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5600907029478458 [2025-01-10 01:05:38,864 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 355 flow. Second operand 9 states and 247 transitions. [2025-01-10 01:05:38,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 148 transitions, 1077 flow [2025-01-10 01:05:38,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 148 transitions, 1066 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:05:38,871 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 376 flow [2025-01-10 01:05:38,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=376, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2025-01-10 01:05:38,872 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2025-01-10 01:05:38,872 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 376 flow [2025-01-10 01:05:38,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.5) internal successors, (328), 16 states have internal predecessors, (328), 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:05:38,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:38,872 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:38,880 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:05:39,073 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,SelfDestructingSolverStorable11 [2025-01-10 01:05:39,073 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:39,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:39,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1926726147, now seen corresponding path program 2 times [2025-01-10 01:05:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264273074] [2025-01-10 01:05:39,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:39,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 01:05:39,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:05:39,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:39,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:05:39,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264273074] [2025-01-10 01:05:39,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264273074] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414661644] [2025-01-10 01:05:39,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:39,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:39,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:39,340 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:05:39,342 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:05:39,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 01:05:39,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:05:39,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:39,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:39,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:05:39,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:39,437 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:05:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:05:39,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:39,925 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:05:39,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414661644] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:39,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:39,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-01-10 01:05:39,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236099199] [2025-01-10 01:05:39,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:39,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:05:39,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:39,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:05:39,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:05:40,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2025-01-10 01:05:40,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 376 flow. Second operand has 16 states, 16 states have (on average 20.625) internal successors, (330), 16 states have internal predecessors, (330), 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:05:40,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:40,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2025-01-10 01:05:40,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:40,860 INFO L124 PetriNetUnfolderBase]: 1778/2858 cut-off events. [2025-01-10 01:05:40,861 INFO L125 PetriNetUnfolderBase]: For 4223/4223 co-relation queries the response was YES. [2025-01-10 01:05:40,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9849 conditions, 2858 events. 1778/2858 cut-off events. For 4223/4223 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 14269 event pairs, 187 based on Foata normal form. 68/2912 useless extension candidates. Maximal degree in co-relation 8015. Up to 974 conditions per place. [2025-01-10 01:05:40,876 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 110 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-01-10 01:05:40,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 123 transitions, 958 flow [2025-01-10 01:05:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:05:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:05:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions. [2025-01-10 01:05:40,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5539358600583091 [2025-01-10 01:05:40,878 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 376 flow. Second operand 7 states and 190 transitions. [2025-01-10 01:05:40,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 123 transitions, 958 flow [2025-01-10 01:05:40,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 123 transitions, 918 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-01-10 01:05:40,886 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 368 flow [2025-01-10 01:05:40,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2025-01-10 01:05:40,887 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places. [2025-01-10 01:05:40,887 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 368 flow [2025-01-10 01:05:40,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.625) internal successors, (330), 16 states have internal predecessors, (330), 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:05:40,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:40,888 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] [2025-01-10 01:05:40,896 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:05:41,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:41,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:41,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1688185233, now seen corresponding path program 1 times [2025-01-10 01:05:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975695480] [2025-01-10 01:05:41,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:41,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:41,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:05:41,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:05:41,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:41,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:41,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975695480] [2025-01-10 01:05:41,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975695480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817261808] [2025-01-10 01:05:41,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:41,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:41,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:41,189 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:05:41,191 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:05:41,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:05:41,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:05:41,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:41,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:41,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:05:41,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:41,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:41,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817261808] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:41,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:05:41,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-01-10 01:05:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869484539] [2025-01-10 01:05:41,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:05:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:41,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:05:41,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:05:41,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-10 01:05:41,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 368 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:05:41,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:41,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-10 01:05:41,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:41,658 INFO L124 PetriNetUnfolderBase]: 1670/2700 cut-off events. [2025-01-10 01:05:41,658 INFO L125 PetriNetUnfolderBase]: For 4187/4187 co-relation queries the response was YES. [2025-01-10 01:05:41,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9275 conditions, 2700 events. 1670/2700 cut-off events. For 4187/4187 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 13240 event pairs, 955 based on Foata normal form. 61/2753 useless extension candidates. Maximal degree in co-relation 7673. Up to 2126 conditions per place. [2025-01-10 01:05:41,680 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 69 selfloop transitions, 8 changer transitions 0/82 dead transitions. [2025-01-10 01:05:41,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 82 transitions, 628 flow [2025-01-10 01:05:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:05:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:05:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-01-10 01:05:41,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5836734693877551 [2025-01-10 01:05:41,682 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 368 flow. Second operand 5 states and 143 transitions. [2025-01-10 01:05:41,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 82 transitions, 628 flow [2025-01-10 01:05:41,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 82 transitions, 614 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:05:41,689 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 370 flow [2025-01-10 01:05:41,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2025-01-10 01:05:41,690 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places. [2025-01-10 01:05:41,690 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 370 flow [2025-01-10 01:05:41,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:05:41,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:41,690 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] [2025-01-10 01:05:41,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:05:41,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:41,891 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:41,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 935099196, now seen corresponding path program 1 times [2025-01-10 01:05:41,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:41,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166377993] [2025-01-10 01:05:41,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:41,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:05:41,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:05:41,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:41,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:41,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:41,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166377993] [2025-01-10 01:05:41,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166377993] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:41,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328817380] [2025-01-10 01:05:41,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:41,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:41,985 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:05:41,988 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:05:42,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:05:42,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:05:42,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:42,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:05:42,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:42,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328817380] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:42,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:05:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-01-10 01:05:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262874426] [2025-01-10 01:05:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:42,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:05:42,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:42,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:05:42,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:05:42,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-10 01:05:42,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 370 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:05:42,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:42,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-10 01:05:42,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:42,386 INFO L124 PetriNetUnfolderBase]: 1546/2482 cut-off events. [2025-01-10 01:05:42,386 INFO L125 PetriNetUnfolderBase]: For 3632/3632 co-relation queries the response was YES. [2025-01-10 01:05:42,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8799 conditions, 2482 events. 1546/2482 cut-off events. For 3632/3632 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 11636 event pairs, 835 based on Foata normal form. 48/2518 useless extension candidates. Maximal degree in co-relation 7402. Up to 1844 conditions per place. [2025-01-10 01:05:42,400 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 67 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2025-01-10 01:05:42,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 82 transitions, 636 flow [2025-01-10 01:05:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:05:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:05:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-01-10 01:05:42,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5877551020408164 [2025-01-10 01:05:42,401 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 370 flow. Second operand 5 states and 144 transitions. [2025-01-10 01:05:42,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 82 transitions, 636 flow [2025-01-10 01:05:42,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 82 transitions, 614 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:05:42,409 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 395 flow [2025-01-10 01:05:42,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2025-01-10 01:05:42,410 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2025-01-10 01:05:42,411 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 395 flow [2025-01-10 01:05:42,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:05:42,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:42,411 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] [2025-01-10 01:05:42,419 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:05:42,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:42,615 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:42,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1758231218, now seen corresponding path program 1 times [2025-01-10 01:05:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:42,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583469171] [2025-01-10 01:05:42,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:42,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:05:42,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:05:42,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:42,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:05:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:43,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583469171] [2025-01-10 01:05:43,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583469171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:43,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:43,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:05:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921269578] [2025-01-10 01:05:43,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:43,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:05:43,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:43,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:05:43,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:05:43,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:05:43,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 395 flow. Second operand has 12 states, 12 states have (on average 23.75) internal successors, (285), 12 states have internal predecessors, (285), 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:05:43,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:43,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:05:43,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:44,111 INFO L124 PetriNetUnfolderBase]: 1766/2892 cut-off events. [2025-01-10 01:05:44,112 INFO L125 PetriNetUnfolderBase]: For 6025/6025 co-relation queries the response was YES. [2025-01-10 01:05:44,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10678 conditions, 2892 events. 1766/2892 cut-off events. For 6025/6025 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14424 event pairs, 152 based on Foata normal form. 2/2876 useless extension candidates. Maximal degree in co-relation 9266. Up to 1235 conditions per place. [2025-01-10 01:05:44,129 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 123 selfloop transitions, 55 changer transitions 3/190 dead transitions. [2025-01-10 01:05:44,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 190 transitions, 1478 flow [2025-01-10 01:05:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:05:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:05:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 429 transitions. [2025-01-10 01:05:44,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2025-01-10 01:05:44,132 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 395 flow. Second operand 13 states and 429 transitions. [2025-01-10 01:05:44,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 190 transitions, 1478 flow [2025-01-10 01:05:44,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 190 transitions, 1449 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:44,145 INFO L231 Difference]: Finished difference. Result has 91 places, 103 transitions, 920 flow [2025-01-10 01:05:44,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=920, PETRI_PLACES=91, PETRI_TRANSITIONS=103} [2025-01-10 01:05:44,146 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 43 predicate places. [2025-01-10 01:05:44,146 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 103 transitions, 920 flow [2025-01-10 01:05:44,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.75) internal successors, (285), 12 states have internal predecessors, (285), 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:05:44,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:44,146 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] [2025-01-10 01:05:44,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:05:44,146 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:44,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:44,147 INFO L85 PathProgramCache]: Analyzing trace with hash -466675698, now seen corresponding path program 2 times [2025-01-10 01:05:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:44,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413035712] [2025-01-10 01:05:44,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:44,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:44,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:05:44,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-01-10 01:05:44,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:44,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:44,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:44,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413035712] [2025-01-10 01:05:44,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413035712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:44,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:44,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:05:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458570865] [2025-01-10 01:05:44,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:44,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:05:44,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:44,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:05:44,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:05:44,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:05:44,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 103 transitions, 920 flow. Second operand has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 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:05:44,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:44,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:05:44,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:45,232 INFO L124 PetriNetUnfolderBase]: 2497/4047 cut-off events. [2025-01-10 01:05:45,232 INFO L125 PetriNetUnfolderBase]: For 12648/12648 co-relation queries the response was YES. [2025-01-10 01:05:45,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17959 conditions, 4047 events. 2497/4047 cut-off events. For 12648/12648 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 21469 event pairs, 403 based on Foata normal form. 2/4033 useless extension candidates. Maximal degree in co-relation 15916. Up to 2330 conditions per place. [2025-01-10 01:05:45,259 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 160 selfloop transitions, 98 changer transitions 5/272 dead transitions. [2025-01-10 01:05:45,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 272 transitions, 2826 flow [2025-01-10 01:05:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:05:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:05:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 429 transitions. [2025-01-10 01:05:45,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2025-01-10 01:05:45,262 INFO L175 Difference]: Start difference. First operand has 91 places, 103 transitions, 920 flow. Second operand 13 states and 429 transitions. [2025-01-10 01:05:45,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 272 transitions, 2826 flow [2025-01-10 01:05:45,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 272 transitions, 2742 flow, removed 25 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:45,303 INFO L231 Difference]: Finished difference. Result has 108 places, 196 transitions, 2255 flow [2025-01-10 01:05:45,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2255, PETRI_PLACES=108, PETRI_TRANSITIONS=196} [2025-01-10 01:05:45,304 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 60 predicate places. [2025-01-10 01:05:45,304 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 196 transitions, 2255 flow [2025-01-10 01:05:45,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 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:05:45,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:45,305 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] [2025-01-10 01:05:45,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:05:45,305 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:45,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:45,307 INFO L85 PathProgramCache]: Analyzing trace with hash 25172822, now seen corresponding path program 1 times [2025-01-10 01:05:45,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:45,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727154267] [2025-01-10 01:05:45,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:45,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:45,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:05:45,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:05:45,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:45,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:45,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:45,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727154267] [2025-01-10 01:05:45,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727154267] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:45,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137793022] [2025-01-10 01:05:45,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:45,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:45,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:45,977 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:05:45,980 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:05:46,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:05:46,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:05:46,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:46,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:46,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 01:05:46,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:46,080 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:05:46,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-01-10 01:05:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:46,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:46,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137793022] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:46,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:05:46,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 9] total 25 [2025-01-10 01:05:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416613161] [2025-01-10 01:05:46,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:46,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:05:46,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:46,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:05:46,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:05:46,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:05:46,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 196 transitions, 2255 flow. Second operand has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 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:05:46,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:46,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:05:46,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:47,435 INFO L124 PetriNetUnfolderBase]: 2778/4505 cut-off events. [2025-01-10 01:05:47,435 INFO L125 PetriNetUnfolderBase]: For 19747/19747 co-relation queries the response was YES. [2025-01-10 01:05:47,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22609 conditions, 4505 events. 2778/4505 cut-off events. For 19747/19747 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 24330 event pairs, 263 based on Foata normal form. 2/4493 useless extension candidates. Maximal degree in co-relation 20230. Up to 2417 conditions per place. [2025-01-10 01:05:47,472 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 185 selfloop transitions, 91 changer transitions 3/288 dead transitions. [2025-01-10 01:05:47,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 288 transitions, 3472 flow [2025-01-10 01:05:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:05:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:05:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 346 transitions. [2025-01-10 01:05:47,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7061224489795919 [2025-01-10 01:05:47,474 INFO L175 Difference]: Start difference. First operand has 108 places, 196 transitions, 2255 flow. Second operand 10 states and 346 transitions. [2025-01-10 01:05:47,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 288 transitions, 3472 flow [2025-01-10 01:05:47,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 288 transitions, 3388 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-01-10 01:05:47,553 INFO L231 Difference]: Finished difference. Result has 120 places, 210 transitions, 2620 flow [2025-01-10 01:05:47,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2620, PETRI_PLACES=120, PETRI_TRANSITIONS=210} [2025-01-10 01:05:47,555 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 72 predicate places. [2025-01-10 01:05:47,555 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 210 transitions, 2620 flow [2025-01-10 01:05:47,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 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:05:47,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:47,555 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] [2025-01-10 01:05:47,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:47,759 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,SelfDestructingSolverStorable17 [2025-01-10 01:05:47,759 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:47,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2040284564, now seen corresponding path program 2 times [2025-01-10 01:05:47,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:47,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775492472] [2025-01-10 01:05:47,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:47,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:47,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:05:47,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-01-10 01:05:47,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:47,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:48,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:48,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775492472] [2025-01-10 01:05:48,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775492472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:48,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:48,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 01:05:48,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746766033] [2025-01-10 01:05:48,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:48,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:05:48,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:48,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:05:48,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:05:48,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:05:48,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 210 transitions, 2620 flow. Second operand has 12 states, 12 states have (on average 23.75) internal successors, (285), 12 states have internal predecessors, (285), 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:05:48,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:48,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:05:48,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:49,062 INFO L124 PetriNetUnfolderBase]: 3038/4931 cut-off events. [2025-01-10 01:05:49,062 INFO L125 PetriNetUnfolderBase]: For 26649/26649 co-relation queries the response was YES. [2025-01-10 01:05:49,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26012 conditions, 4931 events. 3038/4931 cut-off events. For 26649/26649 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 27239 event pairs, 488 based on Foata normal form. 2/4907 useless extension candidates. Maximal degree in co-relation 23500. Up to 3002 conditions per place. [2025-01-10 01:05:49,089 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 191 selfloop transitions, 95 changer transitions 7/302 dead transitions. [2025-01-10 01:05:49,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 302 transitions, 3881 flow [2025-01-10 01:05:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:05:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:05:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 396 transitions. [2025-01-10 01:05:49,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2025-01-10 01:05:49,090 INFO L175 Difference]: Start difference. First operand has 120 places, 210 transitions, 2620 flow. Second operand 12 states and 396 transitions. [2025-01-10 01:05:49,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 302 transitions, 3881 flow [2025-01-10 01:05:49,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 302 transitions, 3785 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-01-10 01:05:49,161 INFO L231 Difference]: Finished difference. Result has 131 places, 220 transitions, 2946 flow [2025-01-10 01:05:49,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2946, PETRI_PLACES=131, PETRI_TRANSITIONS=220} [2025-01-10 01:05:49,162 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 83 predicate places. [2025-01-10 01:05:49,162 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 220 transitions, 2946 flow [2025-01-10 01:05:49,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.75) internal successors, (285), 12 states have internal predecessors, (285), 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:05:49,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:49,162 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] [2025-01-10 01:05:49,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:05:49,163 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:49,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:49,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1059091926, now seen corresponding path program 3 times [2025-01-10 01:05:49,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:49,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866877833] [2025-01-10 01:05:49,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:05:49,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:49,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:05:49,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-01-10 01:05:49,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:05:49,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:49,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:49,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866877833] [2025-01-10 01:05:49,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866877833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:49,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:49,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:05:49,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26725828] [2025-01-10 01:05:49,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:49,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:05:49,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:49,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:05:49,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:05:49,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:05:49,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 220 transitions, 2946 flow. Second operand has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 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:05:49,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:49,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:05:49,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:50,900 INFO L124 PetriNetUnfolderBase]: 3980/6412 cut-off events. [2025-01-10 01:05:50,900 INFO L125 PetriNetUnfolderBase]: For 41629/41629 co-relation queries the response was YES. [2025-01-10 01:05:50,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36238 conditions, 6412 events. 3980/6412 cut-off events. For 41629/41629 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 36956 event pairs, 674 based on Foata normal form. 2/6392 useless extension candidates. Maximal degree in co-relation 33340. Up to 3701 conditions per place. [2025-01-10 01:05:50,947 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 210 selfloop transitions, 133 changer transitions 5/357 dead transitions. [2025-01-10 01:05:50,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 357 transitions, 5172 flow [2025-01-10 01:05:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:05:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:05:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 374 transitions. [2025-01-10 01:05:50,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2025-01-10 01:05:50,949 INFO L175 Difference]: Start difference. First operand has 131 places, 220 transitions, 2946 flow. Second operand 11 states and 374 transitions. [2025-01-10 01:05:50,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 357 transitions, 5172 flow [2025-01-10 01:05:51,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 357 transitions, 5004 flow, removed 33 selfloop flow, removed 6 redundant places. [2025-01-10 01:05:51,044 INFO L231 Difference]: Finished difference. Result has 140 places, 282 transitions, 4274 flow [2025-01-10 01:05:51,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2802, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4274, PETRI_PLACES=140, PETRI_TRANSITIONS=282} [2025-01-10 01:05:51,045 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 92 predicate places. [2025-01-10 01:05:51,045 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 282 transitions, 4274 flow [2025-01-10 01:05:51,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 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:05:51,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:51,045 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] [2025-01-10 01:05:51,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:05:51,045 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:51,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:51,046 INFO L85 PathProgramCache]: Analyzing trace with hash 658700886, now seen corresponding path program 4 times [2025-01-10 01:05:51,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:51,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915348295] [2025-01-10 01:05:51,046 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:05:51,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:51,053 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:05:51,061 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:05:51,061 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:05:51,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:51,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:51,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915348295] [2025-01-10 01:05:51,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915348295] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:51,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302406532] [2025-01-10 01:05:51,558 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:05:51,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:51,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:51,560 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:05:51,563 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:05:51,616 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:05:51,643 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:05:51,643 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:05:51,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:51,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 01:05:51,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:51,662 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:05:51,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-01-10 01:05:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:51,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302406532] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:52,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:05:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 22 [2025-01-10 01:05:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65194079] [2025-01-10 01:05:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:05:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:52,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:05:52,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:05:52,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:05:52,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 282 transitions, 4274 flow. Second operand has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 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:05:52,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:52,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:05:52,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:53,451 INFO L124 PetriNetUnfolderBase]: 4335/6960 cut-off events. [2025-01-10 01:05:53,451 INFO L125 PetriNetUnfolderBase]: For 56074/56074 co-relation queries the response was YES. [2025-01-10 01:05:53,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42038 conditions, 6960 events. 4335/6960 cut-off events. For 56074/56074 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 40710 event pairs, 752 based on Foata normal form. 2/6946 useless extension candidates. Maximal degree in co-relation 39095. Up to 3978 conditions per place. [2025-01-10 01:05:53,509 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 205 selfloop transitions, 137 changer transitions 19/370 dead transitions. [2025-01-10 01:05:53,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 370 transitions, 5855 flow [2025-01-10 01:05:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:05:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:05:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 343 transitions. [2025-01-10 01:05:53,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-10 01:05:53,511 INFO L175 Difference]: Start difference. First operand has 140 places, 282 transitions, 4274 flow. Second operand 10 states and 343 transitions. [2025-01-10 01:05:53,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 370 transitions, 5855 flow [2025-01-10 01:05:53,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 370 transitions, 5750 flow, removed 32 selfloop flow, removed 4 redundant places. [2025-01-10 01:05:53,671 INFO L231 Difference]: Finished difference. Result has 148 places, 285 transitions, 4616 flow [2025-01-10 01:05:53,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4171, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4616, PETRI_PLACES=148, PETRI_TRANSITIONS=285} [2025-01-10 01:05:53,671 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 100 predicate places. [2025-01-10 01:05:53,671 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 285 transitions, 4616 flow [2025-01-10 01:05:53,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 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:05:53,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:53,672 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] [2025-01-10 01:05:53,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:53,875 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,SelfDestructingSolverStorable20 [2025-01-10 01:05:53,875 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:53,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:53,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1460292340, now seen corresponding path program 1 times [2025-01-10 01:05:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:53,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120877820] [2025-01-10 01:05:53,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:53,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:53,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:05:53,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:05:53,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:53,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:05:54,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:54,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120877820] [2025-01-10 01:05:54,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120877820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:54,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:54,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 01:05:54,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382019542] [2025-01-10 01:05:54,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:54,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:05:54,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:54,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:05:54,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:05:54,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:05:54,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 285 transitions, 4616 flow. Second operand has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 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:05:54,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:54,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:05:54,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:57,265 INFO L124 PetriNetUnfolderBase]: 7195/11482 cut-off events. [2025-01-10 01:05:57,265 INFO L125 PetriNetUnfolderBase]: For 113691/113691 co-relation queries the response was YES. [2025-01-10 01:05:57,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74774 conditions, 11482 events. 7195/11482 cut-off events. For 113691/113691 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 72401 event pairs, 1257 based on Foata normal form. 2/11466 useless extension candidates. Maximal degree in co-relation 69849. Up to 7026 conditions per place. [2025-01-10 01:05:57,387 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 444 selfloop transitions, 238 changer transitions 13/704 dead transitions. [2025-01-10 01:05:57,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 704 transitions, 12099 flow [2025-01-10 01:05:57,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:05:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-10 01:05:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 768 transitions. [2025-01-10 01:05:57,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2025-01-10 01:05:57,390 INFO L175 Difference]: Start difference. First operand has 148 places, 285 transitions, 4616 flow. Second operand 24 states and 768 transitions. [2025-01-10 01:05:57,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 704 transitions, 12099 flow [2025-01-10 01:05:57,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 704 transitions, 11774 flow, removed 41 selfloop flow, removed 5 redundant places. [2025-01-10 01:05:57,983 INFO L231 Difference]: Finished difference. Result has 182 places, 512 transitions, 9592 flow [2025-01-10 01:05:57,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4493, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=9592, PETRI_PLACES=182, PETRI_TRANSITIONS=512} [2025-01-10 01:05:57,984 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 134 predicate places. [2025-01-10 01:05:57,984 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 512 transitions, 9592 flow [2025-01-10 01:05:57,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 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:05:57,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:57,984 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] [2025-01-10 01:05:57,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:05:57,985 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:05:57,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1224202792, now seen corresponding path program 2 times [2025-01-10 01:05:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:57,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678944133] [2025-01-10 01:05:57,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:57,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:05:57,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-01-10 01:05:57,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:57,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:58,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:58,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678944133] [2025-01-10 01:05:58,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678944133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:58,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:58,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 01:05:58,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049569274] [2025-01-10 01:05:58,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:58,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:05:58,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:58,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:05:58,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:05:58,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:05:58,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 512 transitions, 9592 flow. Second operand has 12 states, 12 states have (on average 23.75) internal successors, (285), 12 states have internal predecessors, (285), 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:05:58,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:58,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:05:58,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:00,922 INFO L124 PetriNetUnfolderBase]: 7496/11936 cut-off events. [2025-01-10 01:06:00,922 INFO L125 PetriNetUnfolderBase]: For 135763/135787 co-relation queries the response was YES. [2025-01-10 01:06:01,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82265 conditions, 11936 events. 7496/11936 cut-off events. For 135763/135787 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 75757 event pairs, 770 based on Foata normal form. 2/11924 useless extension candidates. Maximal degree in co-relation 77459. Up to 4613 conditions per place. [2025-01-10 01:06:01,133 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 253 selfloop transitions, 352 changer transitions 6/620 dead transitions. [2025-01-10 01:06:01,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 620 transitions, 11831 flow [2025-01-10 01:06:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:06:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:06:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 385 transitions. [2025-01-10 01:06:01,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-01-10 01:06:01,135 INFO L175 Difference]: Start difference. First operand has 182 places, 512 transitions, 9592 flow. Second operand 11 states and 385 transitions. [2025-01-10 01:06:01,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 620 transitions, 11831 flow [2025-01-10 01:06:01,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 620 transitions, 11688 flow, removed 70 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:01,972 INFO L231 Difference]: Finished difference. Result has 196 places, 529 transitions, 10801 flow [2025-01-10 01:06:01,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9457, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10801, PETRI_PLACES=196, PETRI_TRANSITIONS=529} [2025-01-10 01:06:01,973 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 148 predicate places. [2025-01-10 01:06:01,973 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 529 transitions, 10801 flow [2025-01-10 01:06:01,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.75) internal successors, (285), 12 states have internal predecessors, (285), 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:06:01,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:01,973 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] [2025-01-10 01:06:01,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:06:01,973 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:06:01,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash -617776780, now seen corresponding path program 3 times [2025-01-10 01:06:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165351504] [2025-01-10 01:06:01,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:06:01,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:01,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:06:01,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 26 statements. [2025-01-10 01:06:01,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:06:01,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:02,438 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:06:02,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:02,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165351504] [2025-01-10 01:06:02,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165351504] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:02,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029435069] [2025-01-10 01:06:02,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:06:02,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:02,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:02,441 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:06:02,443 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:06:02,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:06:02,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 26 statements. [2025-01-10 01:06:02,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:06:02,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:02,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:06:02,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:02,537 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:06:02,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-01-10 01:06:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:06:02,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:02,859 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:06:02,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029435069] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:02,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:02,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 23 [2025-01-10 01:06:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995059726] [2025-01-10 01:06:02,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:02,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:06:02,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:02,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:06:02,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:06:03,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:06:03,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 529 transitions, 10801 flow. Second operand has 23 states, 23 states have (on average 24.347826086956523) internal successors, (560), 23 states have internal predecessors, (560), 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:06:03,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:03,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:06:03,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:06,423 INFO L124 PetriNetUnfolderBase]: 8740/13912 cut-off events. [2025-01-10 01:06:06,423 INFO L125 PetriNetUnfolderBase]: For 195654/195678 co-relation queries the response was YES. [2025-01-10 01:06:06,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103212 conditions, 13912 events. 8740/13912 cut-off events. For 195654/195678 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 90541 event pairs, 1071 based on Foata normal form. 2/13902 useless extension candidates. Maximal degree in co-relation 101109. Up to 6385 conditions per place. [2025-01-10 01:06:06,597 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 331 selfloop transitions, 394 changer transitions 18/752 dead transitions. [2025-01-10 01:06:06,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 752 transitions, 15580 flow [2025-01-10 01:06:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:06:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 01:06:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 620 transitions. [2025-01-10 01:06:06,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6659505907626209 [2025-01-10 01:06:06,599 INFO L175 Difference]: Start difference. First operand has 196 places, 529 transitions, 10801 flow. Second operand 19 states and 620 transitions. [2025-01-10 01:06:06,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 752 transitions, 15580 flow [2025-01-10 01:06:07,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 752 transitions, 14914 flow, removed 103 selfloop flow, removed 7 redundant places. [2025-01-10 01:06:07,831 INFO L231 Difference]: Finished difference. Result has 212 places, 625 transitions, 13450 flow [2025-01-10 01:06:07,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10250, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=13450, PETRI_PLACES=212, PETRI_TRANSITIONS=625} [2025-01-10 01:06:07,832 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 164 predicate places. [2025-01-10 01:06:07,832 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 625 transitions, 13450 flow [2025-01-10 01:06:07,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 24.347826086956523) internal successors, (560), 23 states have internal predecessors, (560), 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:06:07,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:07,832 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] [2025-01-10 01:06:07,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:06:08,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:08,033 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:06:08,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:08,034 INFO L85 PathProgramCache]: Analyzing trace with hash -424105496, now seen corresponding path program 1 times [2025-01-10 01:06:08,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:08,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309895526] [2025-01-10 01:06:08,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:08,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:06:08,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:06:08,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:08,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309895526] [2025-01-10 01:06:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309895526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583184511] [2025-01-10 01:06:08,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:08,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:08,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:08,541 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:06:08,542 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:06:08,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:06:08,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:06:08,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:08,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:08,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 01:06:08,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:08,632 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:06:08,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-01-10 01:06:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:06:08,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:06:08,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583184511] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:08,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:06:08,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13, 8] total 22 [2025-01-10 01:06:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896041990] [2025-01-10 01:06:08,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:08,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:06:08,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:08,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:06:08,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:06:09,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:06:09,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 625 transitions, 13450 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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:06:09,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:09,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:06:09,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:11,680 INFO L124 PetriNetUnfolderBase]: 10067/15943 cut-off events. [2025-01-10 01:06:11,681 INFO L125 PetriNetUnfolderBase]: For 270331/270355 co-relation queries the response was YES. [2025-01-10 01:06:11,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125459 conditions, 15943 events. 10067/15943 cut-off events. For 270331/270355 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 105738 event pairs, 1907 based on Foata normal form. 2/15925 useless extension candidates. Maximal degree in co-relation 121980. Up to 12395 conditions per place. [2025-01-10 01:06:11,903 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 637 selfloop transitions, 141 changer transitions 3/790 dead transitions. [2025-01-10 01:06:11,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 790 transitions, 18078 flow [2025-01-10 01:06:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:06:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:06:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 284 transitions. [2025-01-10 01:06:11,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674 [2025-01-10 01:06:11,904 INFO L175 Difference]: Start difference. First operand has 212 places, 625 transitions, 13450 flow. Second operand 8 states and 284 transitions. [2025-01-10 01:06:11,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 790 transitions, 18078 flow [2025-01-10 01:06:13,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 790 transitions, 17308 flow, removed 168 selfloop flow, removed 10 redundant places. [2025-01-10 01:06:13,775 INFO L231 Difference]: Finished difference. Result has 214 places, 706 transitions, 15402 flow [2025-01-10 01:06:13,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12795, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15402, PETRI_PLACES=214, PETRI_TRANSITIONS=706} [2025-01-10 01:06:13,776 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 166 predicate places. [2025-01-10 01:06:13,776 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 706 transitions, 15402 flow [2025-01-10 01:06:13,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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:06:13,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:13,776 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] [2025-01-10 01:06:13,784 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:06:13,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:13,977 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:06:13,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:13,978 INFO L85 PathProgramCache]: Analyzing trace with hash -397941072, now seen corresponding path program 2 times [2025-01-10 01:06:13,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:13,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275151863] [2025-01-10 01:06:13,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:06:13,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:13,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:06:13,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-01-10 01:06:13,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:06:13,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:06:14,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:14,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275151863] [2025-01-10 01:06:14,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275151863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:14,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:14,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:06:14,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409673764] [2025-01-10 01:06:14,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:14,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:06:14,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:14,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:06:14,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:06:14,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:06:14,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 706 transitions, 15402 flow. Second operand has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 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:06:14,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:14,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:06:14,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:18,063 INFO L124 PetriNetUnfolderBase]: 10894/17238 cut-off events. [2025-01-10 01:06:18,063 INFO L125 PetriNetUnfolderBase]: For 299015/299039 co-relation queries the response was YES. [2025-01-10 01:06:18,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136527 conditions, 17238 events. 10894/17238 cut-off events. For 299015/299039 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 115913 event pairs, 1835 based on Foata normal form. 2/17228 useless extension candidates. Maximal degree in co-relation 134222. Up to 11533 conditions per place. [2025-01-10 01:06:18,329 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 541 selfloop transitions, 282 changer transitions 15/847 dead transitions. [2025-01-10 01:06:18,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 847 transitions, 19709 flow [2025-01-10 01:06:18,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:06:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:06:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 370 transitions. [2025-01-10 01:06:18,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.686456400742115 [2025-01-10 01:06:18,330 INFO L175 Difference]: Start difference. First operand has 214 places, 706 transitions, 15402 flow. Second operand 11 states and 370 transitions. [2025-01-10 01:06:18,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 847 transitions, 19709 flow [2025-01-10 01:06:20,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 847 transitions, 19521 flow, removed 94 selfloop flow, removed 0 redundant places. [2025-01-10 01:06:20,127 INFO L231 Difference]: Finished difference. Result has 229 places, 763 transitions, 17698 flow [2025-01-10 01:06:20,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=15214, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17698, PETRI_PLACES=229, PETRI_TRANSITIONS=763} [2025-01-10 01:06:20,128 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 181 predicate places. [2025-01-10 01:06:20,128 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 763 transitions, 17698 flow [2025-01-10 01:06:20,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 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:06:20,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:20,128 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] [2025-01-10 01:06:20,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:06:20,128 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:06:20,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2044527560, now seen corresponding path program 3 times [2025-01-10 01:06:20,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:20,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842973607] [2025-01-10 01:06:20,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:06:20,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:20,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:06:20,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-01-10 01:06:20,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:06:20,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:06:20,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842973607] [2025-01-10 01:06:20,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842973607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:20,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:06:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557040241] [2025-01-10 01:06:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:20,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:06:20,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:20,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:06:20,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:06:20,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:06:20,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 763 transitions, 17698 flow. Second operand has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 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:06:20,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:20,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:06:20,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:24,611 INFO L124 PetriNetUnfolderBase]: 11529/18218 cut-off events. [2025-01-10 01:06:24,612 INFO L125 PetriNetUnfolderBase]: For 369551/369575 co-relation queries the response was YES. [2025-01-10 01:06:24,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149662 conditions, 18218 events. 11529/18218 cut-off events. For 369551/369575 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 122990 event pairs, 1685 based on Foata normal form. 2/18208 useless extension candidates. Maximal degree in co-relation 147195. Up to 10234 conditions per place. [2025-01-10 01:06:24,864 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 428 selfloop transitions, 398 changer transitions 21/856 dead transitions. [2025-01-10 01:06:24,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 856 transitions, 20585 flow [2025-01-10 01:06:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:06:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:06:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 371 transitions. [2025-01-10 01:06:24,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2025-01-10 01:06:24,865 INFO L175 Difference]: Start difference. First operand has 229 places, 763 transitions, 17698 flow. Second operand 11 states and 371 transitions. [2025-01-10 01:06:24,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 856 transitions, 20585 flow [2025-01-10 01:06:27,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 856 transitions, 20240 flow, removed 127 selfloop flow, removed 4 redundant places. [2025-01-10 01:06:27,084 INFO L231 Difference]: Finished difference. Result has 237 places, 765 transitions, 18518 flow [2025-01-10 01:06:27,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=17359, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=380, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18518, PETRI_PLACES=237, PETRI_TRANSITIONS=765} [2025-01-10 01:06:27,085 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 189 predicate places. [2025-01-10 01:06:27,085 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 765 transitions, 18518 flow [2025-01-10 01:06:27,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 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:06:27,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:27,085 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] [2025-01-10 01:06:27,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 01:06:27,085 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:06:27,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1741722830, now seen corresponding path program 3 times [2025-01-10 01:06:27,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:27,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570611196] [2025-01-10 01:06:27,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:06:27,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:27,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:06:27,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-01-10 01:06:27,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:06:27,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:06:27,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:27,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570611196] [2025-01-10 01:06:27,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570611196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:27,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:27,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:06:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790584532] [2025-01-10 01:06:27,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:27,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:06:27,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:27,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:06:27,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:06:27,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 01:06:27,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 765 transitions, 18518 flow. Second operand has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 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:06:27,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:27,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 01:06:27,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:31,487 INFO L124 PetriNetUnfolderBase]: 11821/18702 cut-off events. [2025-01-10 01:06:31,488 INFO L125 PetriNetUnfolderBase]: For 413441/413465 co-relation queries the response was YES. [2025-01-10 01:06:31,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157005 conditions, 18702 events. 11821/18702 cut-off events. For 413441/413465 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 127483 event pairs, 1924 based on Foata normal form. 2/18692 useless extension candidates. Maximal degree in co-relation 154457. Up to 12026 conditions per place. [2025-01-10 01:06:31,743 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 550 selfloop transitions, 287 changer transitions 13/858 dead transitions. [2025-01-10 01:06:31,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 858 transitions, 21497 flow [2025-01-10 01:06:31,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:06:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:06:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 371 transitions. [2025-01-10 01:06:31,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2025-01-10 01:06:31,744 INFO L175 Difference]: Start difference. First operand has 237 places, 765 transitions, 18518 flow. Second operand 11 states and 371 transitions. [2025-01-10 01:06:31,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 858 transitions, 21497 flow [2025-01-10 01:06:33,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 858 transitions, 21028 flow, removed 65 selfloop flow, removed 7 redundant places. [2025-01-10 01:06:33,948 INFO L231 Difference]: Finished difference. Result has 244 places, 771 transitions, 19122 flow [2025-01-10 01:06:33,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=18053, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=272, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19122, PETRI_PLACES=244, PETRI_TRANSITIONS=771} [2025-01-10 01:06:33,949 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 196 predicate places. [2025-01-10 01:06:33,949 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 771 transitions, 19122 flow [2025-01-10 01:06:33,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 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:06:33,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:33,949 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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:06:33,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 01:06:33,950 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:06:33,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:33,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2100333953, now seen corresponding path program 1 times [2025-01-10 01:06:33,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:33,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856569346] [2025-01-10 01:06:33,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:33,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:33,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:06:33,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:06:33,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:33,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:06:34,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:34,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856569346] [2025-01-10 01:06:34,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856569346] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:34,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978323459] [2025-01-10 01:06:34,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:34,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:34,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:34,079 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:06:34,082 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:06:34,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:06:34,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:06:34,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:34,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:34,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:06:34,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:06:34,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:06:34,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978323459] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:34,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:06:34,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-01-10 01:06:34,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151657033] [2025-01-10 01:06:34,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:34,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:06:34,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:34,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:06:34,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:06:34,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-10 01:06:34,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 771 transitions, 19122 flow. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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:06:34,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:34,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-10 01:06:34,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:38,843 INFO L124 PetriNetUnfolderBase]: 13230/20103 cut-off events. [2025-01-10 01:06:38,843 INFO L125 PetriNetUnfolderBase]: For 476007/476007 co-relation queries the response was YES. [2025-01-10 01:06:38,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166448 conditions, 20103 events. 13230/20103 cut-off events. For 476007/476007 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 129337 event pairs, 2031 based on Foata normal form. 460/20558 useless extension candidates. Maximal degree in co-relation 166316. Up to 13807 conditions per place. [2025-01-10 01:06:39,077 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 867 selfloop transitions, 34 changer transitions 0/907 dead transitions. [2025-01-10 01:06:39,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 907 transitions, 24060 flow [2025-01-10 01:06:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:06:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:06:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2025-01-10 01:06:39,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-01-10 01:06:39,078 INFO L175 Difference]: Start difference. First operand has 244 places, 771 transitions, 19122 flow. Second operand 7 states and 203 transitions. [2025-01-10 01:06:39,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 907 transitions, 24060 flow [2025-01-10 01:06:41,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 907 transitions, 22376 flow, removed 150 selfloop flow, removed 14 redundant places. [2025-01-10 01:06:41,515 INFO L231 Difference]: Finished difference. Result has 234 places, 731 transitions, 16506 flow [2025-01-10 01:06:41,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=16356, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=16506, PETRI_PLACES=234, PETRI_TRANSITIONS=731} [2025-01-10 01:06:41,517 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 186 predicate places. [2025-01-10 01:06:41,517 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 731 transitions, 16506 flow [2025-01-10 01:06:41,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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:06:41,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:41,517 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:41,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:06:41,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 01:06:41,718 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:06:41,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:41,718 INFO L85 PathProgramCache]: Analyzing trace with hash 387054442, now seen corresponding path program 4 times [2025-01-10 01:06:41,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:41,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015140317] [2025-01-10 01:06:41,718 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:06:41,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:41,726 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:06:41,732 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:06:41,732 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:06:41,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:06:41,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015140317] [2025-01-10 01:06:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015140317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:41,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:41,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:06:41,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535252628] [2025-01-10 01:06:41,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:41,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:06:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:41,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:06:41,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:06:41,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2025-01-10 01:06:41,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 731 transitions, 16506 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:06:41,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:41,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2025-01-10 01:06:41,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:46,909 INFO L124 PetriNetUnfolderBase]: 15186/22660 cut-off events. [2025-01-10 01:06:46,909 INFO L125 PetriNetUnfolderBase]: For 475565/475565 co-relation queries the response was YES. [2025-01-10 01:06:47,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178775 conditions, 22660 events. 15186/22660 cut-off events. For 475565/475565 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 140047 event pairs, 2981 based on Foata normal form. 27/22684 useless extension candidates. Maximal degree in co-relation 178650. Up to 19899 conditions per place. [2025-01-10 01:06:47,434 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 646 selfloop transitions, 109 changer transitions 66/824 dead transitions. [2025-01-10 01:06:47,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 824 transitions, 19301 flow [2025-01-10 01:06:47,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:06:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:06:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-01-10 01:06:47,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2025-01-10 01:06:47,435 INFO L175 Difference]: Start difference. First operand has 234 places, 731 transitions, 16506 flow. Second operand 6 states and 204 transitions. [2025-01-10 01:06:47,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 824 transitions, 19301 flow