./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/array-eq-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/array-eq-symm.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 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:00:16,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:00:16,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:00:16,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:00:16,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:00:16,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:00:16,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:00:16,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:00:16,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:00:16,330 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:00:16,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:00:16,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:00:16,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:00:16,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:00:16,331 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:00:16,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:00:16,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:00:16,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:00:16,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:00:16,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:00:16,332 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:00:16,332 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:00:16,332 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:00:16,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:00:16,332 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:00:16,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:00:16,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:00:16,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:00:16,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:00:16,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:00:16,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:16,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:16,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:16,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:16,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:00:16,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:16,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:16,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:16,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:16,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:00:16,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:00:16,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:00:16,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:00:16,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:00:16,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:00:16,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:00:16,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:00:16,335 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 -> 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d [2025-01-10 01:00:16,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:00:16,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:00:16,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:00:16,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:00:16,591 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:00:16,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2025-01-10 01:00:17,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76b0e1cbe/f8cdae4557a5455880eeda804a835583/FLAG3bc17fa2f [2025-01-10 01:00:18,001 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:00:18,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2025-01-10 01:00:18,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76b0e1cbe/f8cdae4557a5455880eeda804a835583/FLAG3bc17fa2f [2025-01-10 01:00:18,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76b0e1cbe/f8cdae4557a5455880eeda804a835583 [2025-01-10 01:00:18,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:00:18,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:00:18,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:18,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:00:18,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:00:18,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dbad502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18, skipping insertion in model container [2025-01-10 01:00:18,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:00:18,483 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:00:18,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:18,494 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:00:18,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:18,523 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:00:18,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18 WrapperNode [2025-01-10 01:00:18,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:18,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:18,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:00:18,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:00:18,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,549 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 101 [2025-01-10 01:00:18,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:18,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:00:18,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:00:18,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:00:18,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,573 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:00:18,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:00:18,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:00:18,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:00:18,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:00:18,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:18,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:18,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:00:18,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:00:18,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:00:18,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:00:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:00:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:00:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:00:18,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:00:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:00:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:00:18,638 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:00:18,695 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:00:18,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:00:18,880 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:00:18,881 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:00:19,024 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:00:19,025 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:00:19,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:19 BoogieIcfgContainer [2025-01-10 01:00:19,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:00:19,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:00:19,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:00:19,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:00:19,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:00:18" (1/3) ... [2025-01-10 01:00:19,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562f2264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:19, skipping insertion in model container [2025-01-10 01:00:19,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (2/3) ... [2025-01-10 01:00:19,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562f2264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:19, skipping insertion in model container [2025-01-10 01:00:19,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:19" (3/3) ... [2025-01-10 01:00:19,035 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2025-01-10 01:00:19,046 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:00:19,047 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-symm.wvr.c that has 3 procedures, 43 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-01-10 01:00:19,047 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:00:19,104 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:00:19,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 110 flow [2025-01-10 01:00:19,165 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2025-01-10 01:00:19,167 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:00:19,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 6/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 97 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-01-10 01:00:19,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 48 transitions, 110 flow [2025-01-10 01:00:19,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 45 transitions, 102 flow [2025-01-10 01:00:19,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:00:19,194 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;@48b3433f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:00:19,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-01-10 01:00:19,199 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:00:19,201 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:00:19,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:00:19,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:19,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:00:19,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash 440504, now seen corresponding path program 1 times [2025-01-10 01:00:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:19,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439847107] [2025-01-10 01:00:19,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:19,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:00:19,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:00:19,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:19,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439847107] [2025-01-10 01:00:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439847107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:19,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:19,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:00:19,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143060300] [2025-01-10 01:00:19,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:19,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:19,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:19,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:19,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:19,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:00:19,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:19,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:19,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:00:19,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:19,525 INFO L124 PetriNetUnfolderBase]: 79/203 cut-off events. [2025-01-10 01:00:19,525 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 01:00:19,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 203 events. 79/203 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 895 event pairs, 26 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 283. Up to 110 conditions per place. [2025-01-10 01:00:19,531 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 18 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-01-10 01:00:19,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 134 flow [2025-01-10 01:00:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-01-10 01:00:19,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6597222222222222 [2025-01-10 01:00:19,549 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 102 flow. Second operand 3 states and 95 transitions. [2025-01-10 01:00:19,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 134 flow [2025-01-10 01:00:19,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:00:19,553 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 90 flow [2025-01-10 01:00:19,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2025-01-10 01:00:19,557 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2025-01-10 01:00:19,557 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 90 flow [2025-01-10 01:00:19,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:19,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:19,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:00:19,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:00:19,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:19,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash 440505, now seen corresponding path program 1 times [2025-01-10 01:00:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:19,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278694457] [2025-01-10 01:00:19,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:19,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:00:19,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:00:19,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:19,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:19,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:19,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278694457] [2025-01-10 01:00:19,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278694457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:19,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:19,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:19,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815923624] [2025-01-10 01:00:19,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:19,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:19,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:19,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:19,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:19,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:00:19,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:19,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:19,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:00:19,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:20,027 INFO L124 PetriNetUnfolderBase]: 80/206 cut-off events. [2025-01-10 01:00:20,028 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:00:20,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 206 events. 80/206 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 910 event pairs, 26 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 307. Up to 119 conditions per place. [2025-01-10 01:00:20,031 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 21 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2025-01-10 01:00:20,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 146 flow [2025-01-10 01:00:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-01-10 01:00:20,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2025-01-10 01:00:20,033 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 90 flow. Second operand 4 states and 122 transitions. [2025-01-10 01:00:20,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 146 flow [2025-01-10 01:00:20,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:20,035 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 113 flow [2025-01-10 01:00:20,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2025-01-10 01:00:20,038 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2025-01-10 01:00:20,038 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 113 flow [2025-01-10 01:00:20,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:20,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:20,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:00:20,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:00:20,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:20,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 13657187, now seen corresponding path program 1 times [2025-01-10 01:00:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:20,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122164273] [2025-01-10 01:00:20,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:20,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:20,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:00:20,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:00:20,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:20,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:20,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:20,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122164273] [2025-01-10 01:00:20,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122164273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:20,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:20,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325278580] [2025-01-10 01:00:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:20,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:20,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:20,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:20,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:20,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:00:20,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:20,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:20,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:00:20,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:20,451 INFO L124 PetriNetUnfolderBase]: 81/209 cut-off events. [2025-01-10 01:00:20,451 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:00:20,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 209 events. 81/209 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 924 event pairs, 26 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 328. Up to 118 conditions per place. [2025-01-10 01:00:20,453 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 21 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2025-01-10 01:00:20,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 175 flow [2025-01-10 01:00:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2025-01-10 01:00:20,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2025-01-10 01:00:20,455 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 113 flow. Second operand 5 states and 149 transitions. [2025-01-10 01:00:20,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 175 flow [2025-01-10 01:00:20,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:20,457 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 147 flow [2025-01-10 01:00:20,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2025-01-10 01:00:20,457 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2025-01-10 01:00:20,457 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 147 flow [2025-01-10 01:00:20,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:20,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:20,457 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:00:20,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:00:20,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:20,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash 423338165, now seen corresponding path program 1 times [2025-01-10 01:00:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188846939] [2025-01-10 01:00:20,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:20,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:00:20,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:00:20,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:20,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:20,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:20,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188846939] [2025-01-10 01:00:20,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188846939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:20,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567610762] [2025-01-10 01:00:20,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:20,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:20,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:20,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:20,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:00:20,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:00:20,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:00:20,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:20,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:20,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:00:20,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:20,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:00:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:20,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567610762] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:21,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:00:21,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105616713] [2025-01-10 01:00:21,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:21,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:00:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:21,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:00:21,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:00:21,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:00:21,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 147 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:21,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:21,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:00:21,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:21,473 INFO L124 PetriNetUnfolderBase]: 81/208 cut-off events. [2025-01-10 01:00:21,474 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:00:21,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 208 events. 81/208 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 895 event pairs, 26 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 338. Up to 118 conditions per place. [2025-01-10 01:00:21,477 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 20 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2025-01-10 01:00:21,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 197 flow [2025-01-10 01:00:21,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:00:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:00:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2025-01-10 01:00:21,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5868055555555556 [2025-01-10 01:00:21,478 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 147 flow. Second operand 6 states and 169 transitions. [2025-01-10 01:00:21,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 197 flow [2025-01-10 01:00:21,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:21,479 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 156 flow [2025-01-10 01:00:21,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-01-10 01:00:21,480 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2025-01-10 01:00:21,480 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 156 flow [2025-01-10 01:00:21,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:21,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:21,481 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:00:21,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:21,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:21,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:21,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash 239668689, now seen corresponding path program 1 times [2025-01-10 01:00:21,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:21,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631546979] [2025-01-10 01:00:21,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:21,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:00:21,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:00:21,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:21,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631546979] [2025-01-10 01:00:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631546979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377421687] [2025-01-10 01:00:21,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:21,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:21,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:21,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:21,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:00:21,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:00:21,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:00:21,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:21,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:21,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:00:21,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:21,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:00:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:22,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377421687] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:22,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:22,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:00:22,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463208435] [2025-01-10 01:00:22,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:22,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:00:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:22,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:00:22,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:00:22,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:00:22,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 156 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 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:00:22,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:22,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:00:22,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:23,059 INFO L124 PetriNetUnfolderBase]: 83/213 cut-off events. [2025-01-10 01:00:23,060 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 01:00:23,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 213 events. 83/213 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 920 event pairs, 26 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 346. Up to 111 conditions per place. [2025-01-10 01:00:23,063 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 14 selfloop transitions, 18 changer transitions 0/51 dead transitions. [2025-01-10 01:00:23,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 249 flow [2025-01-10 01:00:23,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:00:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:00:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 250 transitions. [2025-01-10 01:00:23,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5787037037037037 [2025-01-10 01:00:23,067 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 156 flow. Second operand 9 states and 250 transitions. [2025-01-10 01:00:23,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 249 flow [2025-01-10 01:00:23,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 202 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 01:00:23,069 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 174 flow [2025-01-10 01:00:23,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=51} [2025-01-10 01:00:23,070 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2025-01-10 01:00:23,071 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 51 transitions, 174 flow [2025-01-10 01:00:23,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 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:00:23,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:23,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:23,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:00:23,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:23,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:23,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:23,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1157599447, now seen corresponding path program 1 times [2025-01-10 01:00:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:23,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023002001] [2025-01-10 01:00:23,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:23,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:23,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:00:23,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:00:23,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:23,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:23,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:23,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023002001] [2025-01-10 01:00:23,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023002001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:23,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:23,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137640686] [2025-01-10 01:00:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:23,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:23,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:23,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:23,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2025-01-10 01:00:23,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:23,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:23,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2025-01-10 01:00:23,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:23,448 INFO L124 PetriNetUnfolderBase]: 119/329 cut-off events. [2025-01-10 01:00:23,448 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 01:00:23,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 329 events. 119/329 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1680 event pairs, 46 based on Foata normal form. 7/201 useless extension candidates. Maximal degree in co-relation 369. Up to 139 conditions per place. [2025-01-10 01:00:23,451 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 48 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2025-01-10 01:00:23,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 362 flow [2025-01-10 01:00:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2025-01-10 01:00:23,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2025-01-10 01:00:23,452 INFO L175 Difference]: Start difference. First operand has 50 places, 51 transitions, 174 flow. Second operand 5 states and 167 transitions. [2025-01-10 01:00:23,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 362 flow [2025-01-10 01:00:23,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 309 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-01-10 01:00:23,456 INFO L231 Difference]: Finished difference. Result has 51 places, 53 transitions, 170 flow [2025-01-10 01:00:23,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=51, PETRI_TRANSITIONS=53} [2025-01-10 01:00:23,457 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2025-01-10 01:00:23,457 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 170 flow [2025-01-10 01:00:23,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:23,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:23,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:23,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:00:23,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:23,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash -548865755, now seen corresponding path program 1 times [2025-01-10 01:00:23,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:23,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465763138] [2025-01-10 01:00:23,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:23,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:23,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:00:23,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:00:23,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:23,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:23,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:23,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465763138] [2025-01-10 01:00:23,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465763138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:23,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:23,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185118207] [2025-01-10 01:00:23,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:23,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:23,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:23,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:23,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2025-01-10 01:00:23,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:23,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:23,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2025-01-10 01:00:23,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:23,652 INFO L124 PetriNetUnfolderBase]: 171/497 cut-off events. [2025-01-10 01:00:23,652 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-10 01:00:23,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 497 events. 171/497 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3001 event pairs, 70 based on Foata normal form. 7/295 useless extension candidates. Maximal degree in co-relation 541. Up to 190 conditions per place. [2025-01-10 01:00:23,655 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 38 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2025-01-10 01:00:23,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 288 flow [2025-01-10 01:00:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-01-10 01:00:23,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6708333333333333 [2025-01-10 01:00:23,657 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 170 flow. Second operand 5 states and 161 transitions. [2025-01-10 01:00:23,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 288 flow [2025-01-10 01:00:23,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:23,660 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 185 flow [2025-01-10 01:00:23,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-01-10 01:00:23,661 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2025-01-10 01:00:23,662 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 185 flow [2025-01-10 01:00:23,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:23,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:23,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:23,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:00:23,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:23,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash -64085294, now seen corresponding path program 1 times [2025-01-10 01:00:23,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:23,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279186507] [2025-01-10 01:00:23,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:23,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:23,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:00:23,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:00:23,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:23,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:23,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:23,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279186507] [2025-01-10 01:00:23,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279186507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:23,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:23,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:23,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663041942] [2025-01-10 01:00:23,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:23,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:23,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:23,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:23,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2025-01-10 01:00:23,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:23,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:23,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2025-01-10 01:00:23,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:23,835 INFO L124 PetriNetUnfolderBase]: 140/348 cut-off events. [2025-01-10 01:00:23,835 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:00:23,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 348 events. 140/348 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1888 event pairs, 70 based on Foata normal form. 6/253 useless extension candidates. Maximal degree in co-relation 339. Up to 200 conditions per place. [2025-01-10 01:00:23,838 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 46 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-01-10 01:00:23,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 337 flow [2025-01-10 01:00:23,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-01-10 01:00:23,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-01-10 01:00:23,839 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 185 flow. Second operand 5 states and 165 transitions. [2025-01-10 01:00:23,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 337 flow [2025-01-10 01:00:23,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:23,842 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 192 flow [2025-01-10 01:00:23,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2025-01-10 01:00:23,842 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2025-01-10 01:00:23,842 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 192 flow [2025-01-10 01:00:23,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:23,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:23,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:23,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:00:23,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:23,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1680137737, now seen corresponding path program 1 times [2025-01-10 01:00:23,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:23,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743036833] [2025-01-10 01:00:23,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:23,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:00:23,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:00:23,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:23,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:23,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743036833] [2025-01-10 01:00:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743036833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:23,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859035766] [2025-01-10 01:00:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:23,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:23,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:23,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:24,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-10 01:00:24,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:24,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:24,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-10 01:00:24,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:24,074 INFO L124 PetriNetUnfolderBase]: 165/434 cut-off events. [2025-01-10 01:00:24,074 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 01:00:24,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 434 events. 165/434 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2332 event pairs, 85 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 646. Up to 265 conditions per place. [2025-01-10 01:00:24,076 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 28 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2025-01-10 01:00:24,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 260 flow [2025-01-10 01:00:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-01-10 01:00:24,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-01-10 01:00:24,077 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 192 flow. Second operand 5 states and 124 transitions. [2025-01-10 01:00:24,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 260 flow [2025-01-10 01:00:24,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:24,079 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 196 flow [2025-01-10 01:00:24,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2025-01-10 01:00:24,080 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2025-01-10 01:00:24,080 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 196 flow [2025-01-10 01:00:24,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:24,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:24,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:24,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:00:24,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:24,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1680137736, now seen corresponding path program 1 times [2025-01-10 01:00:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988719416] [2025-01-10 01:00:24,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:24,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:00:24,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:00:24,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:24,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:24,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988719416] [2025-01-10 01:00:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988719416] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594526189] [2025-01-10 01:00:24,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:24,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:24,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:24,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:24,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:00:24,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:00:24,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:00:24,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:24,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:24,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:00:24,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:24,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:24,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:00:24,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:24,334 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:00:24,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:00:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:24,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:24,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-01-10 01:00:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594526189] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:24,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:24,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:00:24,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875526198] [2025-01-10 01:00:24,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:24,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:00:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:24,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:00:24,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:00:25,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2025-01-10 01:00:25,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 196 flow. Second operand has 11 states, 11 states have (on average 24.454545454545453) internal successors, (269), 11 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:25,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:25,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2025-01-10 01:00:25,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:25,414 INFO L124 PetriNetUnfolderBase]: 234/591 cut-off events. [2025-01-10 01:00:25,414 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-10 01:00:25,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 591 events. 234/591 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3416 event pairs, 87 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 752. Up to 152 conditions per place. [2025-01-10 01:00:25,418 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 52 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-01-10 01:00:25,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 82 transitions, 417 flow [2025-01-10 01:00:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:00:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:00:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 235 transitions. [2025-01-10 01:00:25,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6119791666666666 [2025-01-10 01:00:25,421 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 196 flow. Second operand 8 states and 235 transitions. [2025-01-10 01:00:25,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 82 transitions, 417 flow [2025-01-10 01:00:25,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 82 transitions, 403 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:25,423 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 243 flow [2025-01-10 01:00:25,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=243, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2025-01-10 01:00:25,423 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2025-01-10 01:00:25,423 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 243 flow [2025-01-10 01:00:25,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.454545454545453) internal successors, (269), 11 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:25,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:25,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:25,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:00:25,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:25,629 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:25,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:25,630 INFO L85 PathProgramCache]: Analyzing trace with hash 813440461, now seen corresponding path program 1 times [2025-01-10 01:00:25,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:25,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379174952] [2025-01-10 01:00:25,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:25,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:25,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:00:25,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:00:25,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:25,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:25,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:25,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379174952] [2025-01-10 01:00:25,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379174952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:25,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:25,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:25,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912575388] [2025-01-10 01:00:25,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:25,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:25,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:25,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:25,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:25,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-10 01:00:25,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:25,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:25,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-10 01:00:25,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:25,767 INFO L124 PetriNetUnfolderBase]: 257/597 cut-off events. [2025-01-10 01:00:25,767 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-01-10 01:00:25,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 597 events. 257/597 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3210 event pairs, 154 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 866. Up to 417 conditions per place. [2025-01-10 01:00:25,771 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 32 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2025-01-10 01:00:25,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 317 flow [2025-01-10 01:00:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-01-10 01:00:25,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-10 01:00:25,772 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 243 flow. Second operand 4 states and 104 transitions. [2025-01-10 01:00:25,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 317 flow [2025-01-10 01:00:25,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 299 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:25,773 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 235 flow [2025-01-10 01:00:25,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2025-01-10 01:00:25,774 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2025-01-10 01:00:25,774 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 235 flow [2025-01-10 01:00:25,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:25,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:25,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:25,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:00:25,774 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:25,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:25,775 INFO L85 PathProgramCache]: Analyzing trace with hash 813440462, now seen corresponding path program 1 times [2025-01-10 01:00:25,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:25,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026474611] [2025-01-10 01:00:25,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:25,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:25,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:00:25,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:00:25,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:25,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026474611] [2025-01-10 01:00:25,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026474611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:25,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:25,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:25,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493767624] [2025-01-10 01:00:25,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:25,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:25,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:25,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:25,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2025-01-10 01:00:25,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:25,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:25,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2025-01-10 01:00:25,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:25,941 INFO L124 PetriNetUnfolderBase]: 248/616 cut-off events. [2025-01-10 01:00:25,942 INFO L125 PetriNetUnfolderBase]: For 154/165 co-relation queries the response was YES. [2025-01-10 01:00:25,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 616 events. 248/616 cut-off events. For 154/165 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3522 event pairs, 95 based on Foata normal form. 3/494 useless extension candidates. Maximal degree in co-relation 946. Up to 232 conditions per place. [2025-01-10 01:00:25,945 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 50 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2025-01-10 01:00:25,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 410 flow [2025-01-10 01:00:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-01-10 01:00:25,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-01-10 01:00:25,946 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 235 flow. Second operand 5 states and 170 transitions. [2025-01-10 01:00:25,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 410 flow [2025-01-10 01:00:25,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:25,947 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 260 flow [2025-01-10 01:00:25,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-01-10 01:00:25,948 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2025-01-10 01:00:25,949 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 260 flow [2025-01-10 01:00:25,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:25,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:25,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:25,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:00:25,950 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:25,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:25,950 INFO L85 PathProgramCache]: Analyzing trace with hash -544661900, now seen corresponding path program 1 times [2025-01-10 01:00:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:25,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657674994] [2025-01-10 01:00:25,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:25,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:00:25,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:00:25,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:25,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657674994] [2025-01-10 01:00:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657674994] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974163309] [2025-01-10 01:00:26,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:26,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:26,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:26,118 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:26,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:00:26,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:00:26,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:00:26,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:26,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:26,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:00:26,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:26,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:26,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 01:00:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:26,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974163309] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:26,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:26,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:00:26,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93551139] [2025-01-10 01:00:26,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:26,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:00:26,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:26,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:00:26,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:00:26,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:00:26,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 260 flow. Second operand has 12 states, 12 states have (on average 25.75) internal successors, (309), 12 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:26,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:26,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:00:26,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:26,726 INFO L124 PetriNetUnfolderBase]: 294/645 cut-off events. [2025-01-10 01:00:26,726 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-01-10 01:00:26,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 645 events. 294/645 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3561 event pairs, 79 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 1144. Up to 179 conditions per place. [2025-01-10 01:00:26,729 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 58 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2025-01-10 01:00:26,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 87 transitions, 492 flow [2025-01-10 01:00:26,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:00:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:00:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 229 transitions. [2025-01-10 01:00:26,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6815476190476191 [2025-01-10 01:00:26,730 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 260 flow. Second operand 7 states and 229 transitions. [2025-01-10 01:00:26,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 87 transitions, 492 flow [2025-01-10 01:00:26,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:26,733 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 296 flow [2025-01-10 01:00:26,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-01-10 01:00:26,734 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2025-01-10 01:00:26,734 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 296 flow [2025-01-10 01:00:26,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.75) internal successors, (309), 12 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:26,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:26,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:26,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:00:26,939 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,SelfDestructingSolverStorable12 [2025-01-10 01:00:26,939 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:26,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash 287791648, now seen corresponding path program 1 times [2025-01-10 01:00:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:26,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867643501] [2025-01-10 01:00:26,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:26,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:26,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:00:26,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:00:26,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:26,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:27,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867643501] [2025-01-10 01:00:27,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867643501] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:27,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215198547] [2025-01-10 01:00:27,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:27,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:27,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:27,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:27,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:00:27,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:00:27,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:00:27,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:27,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:27,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:00:27,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:27,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:27,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 01:00:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:27,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215198547] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:27,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:27,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:00:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059591249] [2025-01-10 01:00:27,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:27,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:00:27,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:27,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:00:27,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:00:27,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:00:27,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 296 flow. Second operand has 12 states, 12 states have (on average 26.25) internal successors, (315), 12 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:27,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:27,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:00:27,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:27,692 INFO L124 PetriNetUnfolderBase]: 309/713 cut-off events. [2025-01-10 01:00:27,693 INFO L125 PetriNetUnfolderBase]: For 629/680 co-relation queries the response was YES. [2025-01-10 01:00:27,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 713 events. 309/713 cut-off events. For 629/680 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4094 event pairs, 95 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 1292. Up to 215 conditions per place. [2025-01-10 01:00:27,697 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 54 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2025-01-10 01:00:27,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 84 transitions, 528 flow [2025-01-10 01:00:27,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:00:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:00:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2025-01-10 01:00:27,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2025-01-10 01:00:27,699 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 296 flow. Second operand 7 states and 225 transitions. [2025-01-10 01:00:27,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 84 transitions, 528 flow [2025-01-10 01:00:27,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 84 transitions, 507 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:27,701 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 322 flow [2025-01-10 01:00:27,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2025-01-10 01:00:27,701 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2025-01-10 01:00:27,701 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 322 flow [2025-01-10 01:00:27,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.25) internal successors, (315), 12 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:27,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:27,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:27,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:27,906 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,SelfDestructingSolverStorable13 [2025-01-10 01:00:27,906 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:27,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash 331606872, now seen corresponding path program 1 times [2025-01-10 01:00:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:27,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622512462] [2025-01-10 01:00:27,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:27,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:00:27,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:27,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:27,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:28,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:28,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622512462] [2025-01-10 01:00:28,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622512462] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:28,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906761016] [2025-01-10 01:00:28,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:28,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:28,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:28,054 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:28,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:00:28,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:00:28,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:28,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:28,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:28,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:00:28,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:28,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:28,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:00:28,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:00:28,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:28,160 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:00:28,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:00:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:28,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:28,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906761016] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:28,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:00:28,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 9 [2025-01-10 01:00:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420086842] [2025-01-10 01:00:28,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:28,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:28,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:28,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:00:28,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:00:28,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:28,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:28,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:00:28,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:28,587 INFO L124 PetriNetUnfolderBase]: 309/655 cut-off events. [2025-01-10 01:00:28,587 INFO L125 PetriNetUnfolderBase]: For 644/695 co-relation queries the response was YES. [2025-01-10 01:00:28,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 655 events. 309/655 cut-off events. For 644/695 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3550 event pairs, 148 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 1276. Up to 357 conditions per place. [2025-01-10 01:00:28,590 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 50 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2025-01-10 01:00:28,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 74 transitions, 501 flow [2025-01-10 01:00:28,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-01-10 01:00:28,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6708333333333333 [2025-01-10 01:00:28,591 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 322 flow. Second operand 5 states and 161 transitions. [2025-01-10 01:00:28,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 74 transitions, 501 flow [2025-01-10 01:00:28,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 74 transitions, 468 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 01:00:28,593 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 321 flow [2025-01-10 01:00:28,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2025-01-10 01:00:28,594 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2025-01-10 01:00:28,594 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 321 flow [2025-01-10 01:00:28,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:28,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:28,594 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:28,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:00:28,799 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,SelfDestructingSolverStorable14 [2025-01-10 01:00:28,799 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:28,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:28,800 INFO L85 PathProgramCache]: Analyzing trace with hash 364145565, now seen corresponding path program 1 times [2025-01-10 01:00:28,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:28,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299406023] [2025-01-10 01:00:28,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:28,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:28,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:00:28,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:00:28,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:28,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:28,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299406023] [2025-01-10 01:00:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299406023] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196566177] [2025-01-10 01:00:28,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:28,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:28,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:28,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:28,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:00:28,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:00:28,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:00:28,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:28,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:28,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:00:28,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:29,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:29,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196566177] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:29,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:29,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-01-10 01:00:29,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769021427] [2025-01-10 01:00:29,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:29,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:00:29,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:29,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:00:29,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:00:29,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2025-01-10 01:00:29,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 321 flow. Second operand has 15 states, 15 states have (on average 27.2) internal successors, (408), 15 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:29,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:29,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2025-01-10 01:00:29,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:29,665 INFO L124 PetriNetUnfolderBase]: 759/1755 cut-off events. [2025-01-10 01:00:29,665 INFO L125 PetriNetUnfolderBase]: For 2149/2323 co-relation queries the response was YES. [2025-01-10 01:00:29,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4460 conditions, 1755 events. 759/1755 cut-off events. For 2149/2323 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12740 event pairs, 448 based on Foata normal form. 47/1620 useless extension candidates. Maximal degree in co-relation 2067. Up to 426 conditions per place. [2025-01-10 01:00:29,674 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 140 selfloop transitions, 28 changer transitions 0/186 dead transitions. [2025-01-10 01:00:29,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 186 transitions, 1138 flow [2025-01-10 01:00:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 01:00:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-10 01:00:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 788 transitions. [2025-01-10 01:00:29,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6566666666666666 [2025-01-10 01:00:29,678 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 321 flow. Second operand 25 states and 788 transitions. [2025-01-10 01:00:29,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 186 transitions, 1138 flow [2025-01-10 01:00:29,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 186 transitions, 1115 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:29,685 INFO L231 Difference]: Finished difference. Result has 104 places, 70 transitions, 492 flow [2025-01-10 01:00:29,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=492, PETRI_PLACES=104, PETRI_TRANSITIONS=70} [2025-01-10 01:00:29,685 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places. [2025-01-10 01:00:29,685 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 70 transitions, 492 flow [2025-01-10 01:00:29,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 27.2) internal successors, (408), 15 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:29,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:29,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:29,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:29,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:29,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:29,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash 774939436, now seen corresponding path program 1 times [2025-01-10 01:00:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:29,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896416845] [2025-01-10 01:00:29,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:29,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:00:29,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:00:29,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:29,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:29,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:29,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896416845] [2025-01-10 01:00:29,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896416845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:29,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:29,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:29,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801910996] [2025-01-10 01:00:29,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:29,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:29,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:29,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:29,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:29,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 48 [2025-01-10 01:00:29,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 70 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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:00:29,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:29,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 48 [2025-01-10 01:00:29,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:30,089 INFO L124 PetriNetUnfolderBase]: 654/1695 cut-off events. [2025-01-10 01:00:30,089 INFO L125 PetriNetUnfolderBase]: For 2678/2984 co-relation queries the response was YES. [2025-01-10 01:00:30,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4319 conditions, 1695 events. 654/1695 cut-off events. For 2678/2984 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13254 event pairs, 176 based on Foata normal form. 9/1593 useless extension candidates. Maximal degree in co-relation 4270. Up to 844 conditions per place. [2025-01-10 01:00:30,097 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 49 selfloop transitions, 6 changer transitions 10/84 dead transitions. [2025-01-10 01:00:30,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 84 transitions, 703 flow [2025-01-10 01:00:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-01-10 01:00:30,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7638888888888888 [2025-01-10 01:00:30,098 INFO L175 Difference]: Start difference. First operand has 104 places, 70 transitions, 492 flow. Second operand 3 states and 110 transitions. [2025-01-10 01:00:30,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 84 transitions, 703 flow [2025-01-10 01:00:30,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 84 transitions, 690 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:00:30,103 INFO L231 Difference]: Finished difference. Result has 103 places, 66 transitions, 460 flow [2025-01-10 01:00:30,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=103, PETRI_TRANSITIONS=66} [2025-01-10 01:00:30,103 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 57 predicate places. [2025-01-10 01:00:30,103 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 66 transitions, 460 flow [2025-01-10 01:00:30,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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:00:30,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:30,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:30,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:00:30,104 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:30,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash 475919045, now seen corresponding path program 1 times [2025-01-10 01:00:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:30,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453434383] [2025-01-10 01:00:30,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:30,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:00:30,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:00:30,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:30,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:30,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:30,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453434383] [2025-01-10 01:00:30,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453434383] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:30,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91798206] [2025-01-10 01:00:30,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:30,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:30,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:30,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:30,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:00:30,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:00:30,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:00:30,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:30,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:30,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:00:30,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:30,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:00:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91798206] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:30,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-10 01:00:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340059381] [2025-01-10 01:00:30,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:30,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:00:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:30,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:00:30,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:00:30,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2025-01-10 01:00:30,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 66 transitions, 460 flow. Second operand has 15 states, 15 states have (on average 27.4) internal successors, (411), 15 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:30,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:30,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2025-01-10 01:00:30,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:30,802 INFO L124 PetriNetUnfolderBase]: 562/1238 cut-off events. [2025-01-10 01:00:30,802 INFO L125 PetriNetUnfolderBase]: For 2797/3010 co-relation queries the response was YES. [2025-01-10 01:00:30,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3449 conditions, 1238 events. 562/1238 cut-off events. For 2797/3010 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8665 event pairs, 312 based on Foata normal form. 36/1147 useless extension candidates. Maximal degree in co-relation 3403. Up to 435 conditions per place. [2025-01-10 01:00:30,807 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 86 selfloop transitions, 26 changer transitions 0/130 dead transitions. [2025-01-10 01:00:30,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 130 transitions, 922 flow [2025-01-10 01:00:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:00:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 01:00:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 608 transitions. [2025-01-10 01:00:30,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-01-10 01:00:30,809 INFO L175 Difference]: Start difference. First operand has 103 places, 66 transitions, 460 flow. Second operand 20 states and 608 transitions. [2025-01-10 01:00:30,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 130 transitions, 922 flow [2025-01-10 01:00:30,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 130 transitions, 866 flow, removed 10 selfloop flow, removed 9 redundant places. [2025-01-10 01:00:30,814 INFO L231 Difference]: Finished difference. Result has 104 places, 72 transitions, 554 flow [2025-01-10 01:00:30,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=554, PETRI_PLACES=104, PETRI_TRANSITIONS=72} [2025-01-10 01:00:30,815 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places. [2025-01-10 01:00:30,815 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 72 transitions, 554 flow [2025-01-10 01:00:30,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 27.4) internal successors, (411), 15 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:30,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:30,816 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:30,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:31,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:00:31,016 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1509322219, now seen corresponding path program 2 times [2025-01-10 01:00:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959183364] [2025-01-10 01:00:31,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:31,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:00:31,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:00:31,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:31,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959183364] [2025-01-10 01:00:31,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959183364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991384378] [2025-01-10 01:00:31,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:31,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:31,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:31,355 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:31,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:00:31,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:00:31,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:00:31,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:31,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:31,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:00:31,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:31,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:31,550 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:00:31,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:00:31,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:00:31,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:31,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-01-10 01:00:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:00:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991384378] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:32,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:32,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 20 [2025-01-10 01:00:32,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727344308] [2025-01-10 01:00:32,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:32,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:00:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:32,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:00:32,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:00:36,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:00:40,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:00:44,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:00:48,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:00:49,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:00:49,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 72 transitions, 554 flow. Second operand has 22 states, 22 states have (on average 20.136363636363637) internal successors, (443), 22 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:49,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:49,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:00:49,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:49,785 INFO L124 PetriNetUnfolderBase]: 1549/3090 cut-off events. [2025-01-10 01:00:49,785 INFO L125 PetriNetUnfolderBase]: For 6354/6701 co-relation queries the response was YES. [2025-01-10 01:00:49,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8666 conditions, 3090 events. 1549/3090 cut-off events. For 6354/6701 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 22400 event pairs, 612 based on Foata normal form. 56/2897 useless extension candidates. Maximal degree in co-relation 5839. Up to 661 conditions per place. [2025-01-10 01:00:49,797 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 135 selfloop transitions, 32 changer transitions 0/181 dead transitions. [2025-01-10 01:00:49,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 181 transitions, 1388 flow [2025-01-10 01:00:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:00:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:00:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 433 transitions. [2025-01-10 01:00:49,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5638020833333334 [2025-01-10 01:00:49,798 INFO L175 Difference]: Start difference. First operand has 104 places, 72 transitions, 554 flow. Second operand 16 states and 433 transitions. [2025-01-10 01:00:49,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 181 transitions, 1388 flow [2025-01-10 01:00:49,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 181 transitions, 1317 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-01-10 01:00:49,803 INFO L231 Difference]: Finished difference. Result has 110 places, 83 transitions, 689 flow [2025-01-10 01:00:49,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=689, PETRI_PLACES=110, PETRI_TRANSITIONS=83} [2025-01-10 01:00:49,804 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 64 predicate places. [2025-01-10 01:00:49,804 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 83 transitions, 689 flow [2025-01-10 01:00:49,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 20.136363636363637) internal successors, (443), 22 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:49,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:49,804 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:49,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:50,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:50,004 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:50,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash -455651103, now seen corresponding path program 1 times [2025-01-10 01:00:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401070557] [2025-01-10 01:00:50,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:50,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:00:50,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:00:50,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:50,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:00:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401070557] [2025-01-10 01:00:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401070557] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535203039] [2025-01-10 01:00:50,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:50,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:50,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:50,166 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:50,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:00:50,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:00:50,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:00:50,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:50,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:50,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:00:50,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:00:50,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:50,434 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 30 treesize of output 26 [2025-01-10 01:00:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:00:50,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535203039] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:50,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:50,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-01-10 01:00:50,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282255408] [2025-01-10 01:00:50,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:50,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:00:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:50,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:00:50,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:00:50,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:00:50,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 83 transitions, 689 flow. Second operand has 19 states, 19 states have (on average 25.894736842105264) internal successors, (492), 19 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:50,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:50,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:00:50,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:51,366 INFO L124 PetriNetUnfolderBase]: 1205/2587 cut-off events. [2025-01-10 01:00:51,366 INFO L125 PetriNetUnfolderBase]: For 6468/6794 co-relation queries the response was YES. [2025-01-10 01:00:51,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7400 conditions, 2587 events. 1205/2587 cut-off events. For 6468/6794 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19283 event pairs, 333 based on Foata normal form. 38/2466 useless extension candidates. Maximal degree in co-relation 6604. Up to 563 conditions per place. [2025-01-10 01:00:51,379 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 92 selfloop transitions, 30 changer transitions 0/141 dead transitions. [2025-01-10 01:00:51,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 141 transitions, 1144 flow [2025-01-10 01:00:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:00:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:00:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 333 transitions. [2025-01-10 01:00:51,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.69375 [2025-01-10 01:00:51,380 INFO L175 Difference]: Start difference. First operand has 110 places, 83 transitions, 689 flow. Second operand 10 states and 333 transitions. [2025-01-10 01:00:51,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 141 transitions, 1144 flow [2025-01-10 01:00:51,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 141 transitions, 1119 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 01:00:51,386 INFO L231 Difference]: Finished difference. Result has 118 places, 85 transitions, 760 flow [2025-01-10 01:00:51,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=760, PETRI_PLACES=118, PETRI_TRANSITIONS=85} [2025-01-10 01:00:51,386 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 72 predicate places. [2025-01-10 01:00:51,386 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 85 transitions, 760 flow [2025-01-10 01:00:51,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 25.894736842105264) internal successors, (492), 19 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:51,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:51,387 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:51,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:00:51,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:51,591 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:51,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:51,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1479055763, now seen corresponding path program 2 times [2025-01-10 01:00:51,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:51,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930060217] [2025-01-10 01:00:51,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:51,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:00:51,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:00:51,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:51,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:00:51,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:51,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930060217] [2025-01-10 01:00:51,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930060217] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:51,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339014875] [2025-01-10 01:00:51,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:51,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:51,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:51,808 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:51,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:00:51,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:00:51,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:00:51,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:51,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:51,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:00:51,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:51,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:00:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:52,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:00:52,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339014875] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:52,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:52,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2025-01-10 01:00:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922873933] [2025-01-10 01:00:52,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:52,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:00:52,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:52,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:00:52,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:00:53,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-10 01:00:53,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 85 transitions, 760 flow. Second operand has 26 states, 26 states have (on average 23.076923076923077) internal successors, (600), 26 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:53,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:53,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-10 01:00:53,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:54,489 INFO L124 PetriNetUnfolderBase]: 2690/5738 cut-off events. [2025-01-10 01:00:54,489 INFO L125 PetriNetUnfolderBase]: For 19859/20594 co-relation queries the response was YES. [2025-01-10 01:00:54,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16636 conditions, 5738 events. 2690/5738 cut-off events. For 19859/20594 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 49770 event pairs, 621 based on Foata normal form. 108/5676 useless extension candidates. Maximal degree in co-relation 15243. Up to 972 conditions per place. [2025-01-10 01:00:54,511 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 182 selfloop transitions, 47 changer transitions 0/249 dead transitions. [2025-01-10 01:00:54,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 249 transitions, 2334 flow [2025-01-10 01:00:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 01:00:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-10 01:00:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 762 transitions. [2025-01-10 01:00:54,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5669642857142857 [2025-01-10 01:00:54,513 INFO L175 Difference]: Start difference. First operand has 118 places, 85 transitions, 760 flow. Second operand 28 states and 762 transitions. [2025-01-10 01:00:54,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 249 transitions, 2334 flow [2025-01-10 01:00:54,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 249 transitions, 2248 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 01:00:54,522 INFO L231 Difference]: Finished difference. Result has 142 places, 108 transitions, 1048 flow [2025-01-10 01:00:54,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1048, PETRI_PLACES=142, PETRI_TRANSITIONS=108} [2025-01-10 01:00:54,523 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 96 predicate places. [2025-01-10 01:00:54,523 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 108 transitions, 1048 flow [2025-01-10 01:00:54,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 23.076923076923077) internal successors, (600), 26 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:54,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:54,524 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:54,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:00:54,728 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:00:54,728 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:00:54,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1393911227, now seen corresponding path program 1 times [2025-01-10 01:00:54,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:54,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130762015] [2025-01-10 01:00:54,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:54,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:54,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:00:54,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:00:54,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:54,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:00:54,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:54,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130762015] [2025-01-10 01:00:54,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130762015] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:54,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741416067] [2025-01-10 01:00:54,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:54,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:54,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:54,864 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:00:54,866 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:00:54,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:00:54,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:00:54,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:54,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:54,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:00:54,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:54,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:54,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:00:54,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:55,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:00:55,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:00:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:00:55,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:55,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-01-10 01:00:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:00:55,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741416067] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:55,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:55,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-01-10 01:00:55,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578073852] [2025-01-10 01:00:55,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:55,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:00:55,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:55,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:00:55,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:00:59,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:01:03,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:01:07,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:01:11,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:01:15,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:01:19,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:01:19,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:01:19,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 108 transitions, 1048 flow. Second operand has 17 states, 17 states have (on average 18.647058823529413) internal successors, (317), 17 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:19,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:19,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:01:19,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:20,355 INFO L124 PetriNetUnfolderBase]: 3108/6454 cut-off events. [2025-01-10 01:01:20,356 INFO L125 PetriNetUnfolderBase]: For 20606/21328 co-relation queries the response was YES. [2025-01-10 01:01:20,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18857 conditions, 6454 events. 3108/6454 cut-off events. For 20606/21328 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 55968 event pairs, 1188 based on Foata normal form. 108/6226 useless extension candidates. Maximal degree in co-relation 17199. Up to 1704 conditions per place. [2025-01-10 01:01:20,386 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 92 selfloop transitions, 38 changer transitions 0/156 dead transitions. [2025-01-10 01:01:20,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 156 transitions, 1680 flow [2025-01-10 01:01:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:01:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:01:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 250 transitions. [2025-01-10 01:01:20,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2025-01-10 01:01:20,387 INFO L175 Difference]: Start difference. First operand has 142 places, 108 transitions, 1048 flow. Second operand 11 states and 250 transitions. [2025-01-10 01:01:20,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 156 transitions, 1680 flow [2025-01-10 01:01:20,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 156 transitions, 1590 flow, removed 19 selfloop flow, removed 10 redundant places. [2025-01-10 01:01:20,401 INFO L231 Difference]: Finished difference. Result has 144 places, 112 transitions, 1092 flow [2025-01-10 01:01:20,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1092, PETRI_PLACES=144, PETRI_TRANSITIONS=112} [2025-01-10 01:01:20,402 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 98 predicate places. [2025-01-10 01:01:20,402 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 112 transitions, 1092 flow [2025-01-10 01:01:20,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.647058823529413) internal successors, (317), 17 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:20,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:20,402 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:20,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:01:20,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:20,606 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:20,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash 364789084, now seen corresponding path program 2 times [2025-01-10 01:01:20,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:20,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271975468] [2025-01-10 01:01:20,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:20,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:20,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:01:20,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:01:20,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:20,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:20,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:20,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271975468] [2025-01-10 01:01:20,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271975468] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:20,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175705067] [2025-01-10 01:01:20,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:20,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:20,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:20,699 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:20,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:01:20,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:01:20,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:01:20,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:20,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:20,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:01:20,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:01:20,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:01:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175705067] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:21,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:21,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2025-01-10 01:01:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072380608] [2025-01-10 01:01:21,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:21,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:01:21,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:21,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:01:21,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:01:21,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2025-01-10 01:01:21,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 112 transitions, 1092 flow. Second operand has 21 states, 21 states have (on average 27.0) internal successors, (567), 21 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:21,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:21,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2025-01-10 01:01:21,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:22,347 INFO L124 PetriNetUnfolderBase]: 2620/5800 cut-off events. [2025-01-10 01:01:22,348 INFO L125 PetriNetUnfolderBase]: For 22712/23484 co-relation queries the response was YES. [2025-01-10 01:01:22,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 5800 events. 2620/5800 cut-off events. For 22712/23484 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 51738 event pairs, 1597 based on Foata normal form. 90/5405 useless extension candidates. Maximal degree in co-relation 17819. Up to 1104 conditions per place. [2025-01-10 01:01:22,371 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 254 selfloop transitions, 59 changer transitions 0/342 dead transitions. [2025-01-10 01:01:22,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 342 transitions, 2848 flow [2025-01-10 01:01:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-10 01:01:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-01-10 01:01:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 1433 transitions. [2025-01-10 01:01:22,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6490036231884058 [2025-01-10 01:01:22,378 INFO L175 Difference]: Start difference. First operand has 144 places, 112 transitions, 1092 flow. Second operand 46 states and 1433 transitions. [2025-01-10 01:01:22,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 342 transitions, 2848 flow [2025-01-10 01:01:22,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 342 transitions, 2814 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-01-10 01:01:22,391 INFO L231 Difference]: Finished difference. Result has 185 places, 125 transitions, 1400 flow [2025-01-10 01:01:22,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1400, PETRI_PLACES=185, PETRI_TRANSITIONS=125} [2025-01-10 01:01:22,393 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 139 predicate places. [2025-01-10 01:01:22,393 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 125 transitions, 1400 flow [2025-01-10 01:01:22,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 27.0) internal successors, (567), 21 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:22,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:22,394 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] [2025-01-10 01:01:22,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:01:22,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:22,595 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:22,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash -627401057, now seen corresponding path program 1 times [2025-01-10 01:01:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:22,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802390015] [2025-01-10 01:01:22,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:22,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:01:22,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:01:22,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:22,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:22,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802390015] [2025-01-10 01:01:22,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802390015] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:22,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310617832] [2025-01-10 01:01:22,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:22,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:22,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:22,710 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:22,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:01:22,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:01:22,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:01:22,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:22,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:22,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:01:22,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:01:22,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:01:22,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310617832] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:01:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 15 [2025-01-10 01:01:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936102752] [2025-01-10 01:01:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:22,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:01:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:22,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:01:22,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:01:23,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:01:23,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 125 transitions, 1400 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:23,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:23,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:01:23,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:23,471 INFO L124 PetriNetUnfolderBase]: 2855/6258 cut-off events. [2025-01-10 01:01:23,471 INFO L125 PetriNetUnfolderBase]: For 23284/24036 co-relation queries the response was YES. [2025-01-10 01:01:23,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19473 conditions, 6258 events. 2855/6258 cut-off events. For 23284/24036 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 55781 event pairs, 871 based on Foata normal form. 110/5977 useless extension candidates. Maximal degree in co-relation 14758. Up to 2058 conditions per place. [2025-01-10 01:01:23,494 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 105 selfloop transitions, 27 changer transitions 0/154 dead transitions. [2025-01-10 01:01:23,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 154 transitions, 1946 flow [2025-01-10 01:01:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:01:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:01:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2025-01-10 01:01:23,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-01-10 01:01:23,495 INFO L175 Difference]: Start difference. First operand has 185 places, 125 transitions, 1400 flow. Second operand 7 states and 212 transitions. [2025-01-10 01:01:23,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 154 transitions, 1946 flow [2025-01-10 01:01:23,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 154 transitions, 1675 flow, removed 15 selfloop flow, removed 30 redundant places. [2025-01-10 01:01:23,508 INFO L231 Difference]: Finished difference. Result has 162 places, 125 transitions, 1228 flow [2025-01-10 01:01:23,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1228, PETRI_PLACES=162, PETRI_TRANSITIONS=125} [2025-01-10 01:01:23,509 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 116 predicate places. [2025-01-10 01:01:23,509 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 125 transitions, 1228 flow [2025-01-10 01:01:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:23,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:23,509 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] [2025-01-10 01:01:23,515 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:01:23,710 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,SelfDestructingSolverStorable23 [2025-01-10 01:01:23,710 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:23,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash -735276263, now seen corresponding path program 1 times [2025-01-10 01:01:23,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:23,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749485052] [2025-01-10 01:01:23,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:23,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:01:23,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:01:23,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:23,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:23,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:23,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749485052] [2025-01-10 01:01:23,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749485052] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:23,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113888395] [2025-01-10 01:01:23,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:23,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:23,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:23,803 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:23,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:01:23,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:01:23,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:01:23,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:23,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:23,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:01:23,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:01:23,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:01:23,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113888395] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:23,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:01:23,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 13 [2025-01-10 01:01:23,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73248191] [2025-01-10 01:01:23,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:23,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:01:23,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:23,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:01:23,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:01:24,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2025-01-10 01:01:24,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 125 transitions, 1228 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:24,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:24,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2025-01-10 01:01:24,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:24,519 INFO L124 PetriNetUnfolderBase]: 2558/5463 cut-off events. [2025-01-10 01:01:24,519 INFO L125 PetriNetUnfolderBase]: For 28920/29853 co-relation queries the response was YES. [2025-01-10 01:01:24,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18675 conditions, 5463 events. 2558/5463 cut-off events. For 28920/29853 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 47264 event pairs, 824 based on Foata normal form. 165/5253 useless extension candidates. Maximal degree in co-relation 14232. Up to 2167 conditions per place. [2025-01-10 01:01:24,548 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 95 selfloop transitions, 32 changer transitions 0/155 dead transitions. [2025-01-10 01:01:24,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 155 transitions, 1704 flow [2025-01-10 01:01:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:01:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:01:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2025-01-10 01:01:24,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-01-10 01:01:24,549 INFO L175 Difference]: Start difference. First operand has 162 places, 125 transitions, 1228 flow. Second operand 7 states and 216 transitions. [2025-01-10 01:01:24,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 155 transitions, 1704 flow [2025-01-10 01:01:24,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 155 transitions, 1643 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:01:24,563 INFO L231 Difference]: Finished difference. Result has 164 places, 126 transitions, 1303 flow [2025-01-10 01:01:24,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1303, PETRI_PLACES=164, PETRI_TRANSITIONS=126} [2025-01-10 01:01:24,564 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 118 predicate places. [2025-01-10 01:01:24,564 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 126 transitions, 1303 flow [2025-01-10 01:01:24,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:24,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:24,564 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:24,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 01:01:24,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 01:01:24,764 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:24,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1500784704, now seen corresponding path program 2 times [2025-01-10 01:01:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:24,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244947514] [2025-01-10 01:01:24,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:24,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:01:24,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:01:24,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:24,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:01:24,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:24,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244947514] [2025-01-10 01:01:24,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244947514] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:24,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84240933] [2025-01-10 01:01:24,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:24,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:24,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:24,863 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:24,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:01:24,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:01:24,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:01:24,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:24,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:24,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:01:24,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:01:25,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:01:25,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84240933] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:25,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:25,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-10 01:01:25,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214464264] [2025-01-10 01:01:25,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:25,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:01:25,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:25,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:01:25,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:01:25,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2025-01-10 01:01:25,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 126 transitions, 1303 flow. Second operand has 18 states, 18 states have (on average 27.666666666666668) internal successors, (498), 18 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:25,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:25,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2025-01-10 01:01:25,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:25,789 INFO L124 PetriNetUnfolderBase]: 2045/4767 cut-off events. [2025-01-10 01:01:25,789 INFO L125 PetriNetUnfolderBase]: For 22334/23184 co-relation queries the response was YES. [2025-01-10 01:01:25,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15725 conditions, 4767 events. 2045/4767 cut-off events. For 22334/23184 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 42801 event pairs, 1394 based on Foata normal form. 44/4519 useless extension candidates. Maximal degree in co-relation 12891. Up to 1979 conditions per place. [2025-01-10 01:01:25,814 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 105 selfloop transitions, 46 changer transitions 0/175 dead transitions. [2025-01-10 01:01:25,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 175 transitions, 1820 flow [2025-01-10 01:01:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:01:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:01:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 467 transitions. [2025-01-10 01:01:25,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486111111111111 [2025-01-10 01:01:25,815 INFO L175 Difference]: Start difference. First operand has 164 places, 126 transitions, 1303 flow. Second operand 15 states and 467 transitions. [2025-01-10 01:01:25,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 175 transitions, 1820 flow [2025-01-10 01:01:25,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 175 transitions, 1765 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-10 01:01:25,828 INFO L231 Difference]: Finished difference. Result has 173 places, 124 transitions, 1327 flow [2025-01-10 01:01:25,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1327, PETRI_PLACES=173, PETRI_TRANSITIONS=124} [2025-01-10 01:01:25,828 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 127 predicate places. [2025-01-10 01:01:25,828 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 124 transitions, 1327 flow [2025-01-10 01:01:25,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 27.666666666666668) internal successors, (498), 18 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:25,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:25,828 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:25,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 01:01:26,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:26,033 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:26,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:26,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1344288734, now seen corresponding path program 3 times [2025-01-10 01:01:26,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:26,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689688450] [2025-01-10 01:01:26,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:01:26,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:26,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 8 equivalence classes. [2025-01-10 01:01:26,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:01:26,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 01:01:26,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 28 proven. 51 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-10 01:01:26,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689688450] [2025-01-10 01:01:26,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689688450] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242329984] [2025-01-10 01:01:26,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:01:26,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:26,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:26,265 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:26,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:01:26,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 8 equivalence classes. [2025-01-10 01:01:26,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:01:26,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 01:01:26,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:26,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:01:26,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:26,439 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:01:26,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-10 01:01:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 38 proven. 69 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:26,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:26,939 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 38 treesize of output 34 [2025-01-10 01:01:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:27,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242329984] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:27,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:27,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 28 [2025-01-10 01:01:27,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087664798] [2025-01-10 01:01:27,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:27,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:01:27,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:27,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:01:27,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:01:28,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-10 01:01:28,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 124 transitions, 1327 flow. Second operand has 30 states, 30 states have (on average 23.166666666666668) internal successors, (695), 30 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:28,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:28,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-10 01:01:28,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:29,710 INFO L124 PetriNetUnfolderBase]: 2601/5866 cut-off events. [2025-01-10 01:01:29,710 INFO L125 PetriNetUnfolderBase]: For 27151/27928 co-relation queries the response was YES. [2025-01-10 01:01:29,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20368 conditions, 5866 events. 2601/5866 cut-off events. For 27151/27928 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 50879 event pairs, 429 based on Foata normal form. 75/5725 useless extension candidates. Maximal degree in co-relation 17065. Up to 918 conditions per place. [2025-01-10 01:01:29,734 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 137 selfloop transitions, 53 changer transitions 0/213 dead transitions. [2025-01-10 01:01:29,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 213 transitions, 2301 flow [2025-01-10 01:01:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 01:01:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 01:01:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 591 transitions. [2025-01-10 01:01:29,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5596590909090909 [2025-01-10 01:01:29,737 INFO L175 Difference]: Start difference. First operand has 173 places, 124 transitions, 1327 flow. Second operand 22 states and 591 transitions. [2025-01-10 01:01:29,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 213 transitions, 2301 flow [2025-01-10 01:01:29,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 213 transitions, 2168 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-01-10 01:01:29,760 INFO L231 Difference]: Finished difference. Result has 181 places, 126 transitions, 1354 flow [2025-01-10 01:01:29,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1354, PETRI_PLACES=181, PETRI_TRANSITIONS=126} [2025-01-10 01:01:29,760 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 135 predicate places. [2025-01-10 01:01:29,760 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 126 transitions, 1354 flow [2025-01-10 01:01:29,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 23.166666666666668) internal successors, (695), 30 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:29,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:29,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:29,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 01:01:29,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:29,965 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:29,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1928425847, now seen corresponding path program 1 times [2025-01-10 01:01:29,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:29,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961697644] [2025-01-10 01:01:29,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:29,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:29,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:01:29,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:29,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:29,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:30,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:30,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961697644] [2025-01-10 01:01:30,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961697644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:30,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:30,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:01:30,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674406925] [2025-01-10 01:01:30,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:30,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:01:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:30,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:01:30,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:01:30,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2025-01-10 01:01:30,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 126 transitions, 1354 flow. Second operand has 10 states, 10 states have (on average 24.2) internal successors, (242), 10 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:30,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:30,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2025-01-10 01:01:30,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:30,950 INFO L124 PetriNetUnfolderBase]: 3913/8155 cut-off events. [2025-01-10 01:01:30,951 INFO L125 PetriNetUnfolderBase]: For 29024/29081 co-relation queries the response was YES. [2025-01-10 01:01:30,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29022 conditions, 8155 events. 3913/8155 cut-off events. For 29024/29081 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 65036 event pairs, 1070 based on Foata normal form. 36/8137 useless extension candidates. Maximal degree in co-relation 24561. Up to 5782 conditions per place. [2025-01-10 01:01:30,989 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 118 selfloop transitions, 56 changer transitions 14/204 dead transitions. [2025-01-10 01:01:30,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 204 transitions, 2533 flow [2025-01-10 01:01:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:01:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:01:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 265 transitions. [2025-01-10 01:01:30,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6134259259259259 [2025-01-10 01:01:30,991 INFO L175 Difference]: Start difference. First operand has 181 places, 126 transitions, 1354 flow. Second operand 9 states and 265 transitions. [2025-01-10 01:01:30,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 204 transitions, 2533 flow [2025-01-10 01:01:31,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 204 transitions, 2366 flow, removed 29 selfloop flow, removed 16 redundant places. [2025-01-10 01:01:31,029 INFO L231 Difference]: Finished difference. Result has 179 places, 157 transitions, 2002 flow [2025-01-10 01:01:31,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2002, PETRI_PLACES=179, PETRI_TRANSITIONS=157} [2025-01-10 01:01:31,029 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 133 predicate places. [2025-01-10 01:01:31,029 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 157 transitions, 2002 flow [2025-01-10 01:01:31,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.2) internal successors, (242), 10 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:31,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:31,030 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:31,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 01:01:31,030 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:31,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash -330582972, now seen corresponding path program 3 times [2025-01-10 01:01:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:31,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246269642] [2025-01-10 01:01:31,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:01:31,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:31,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 7 equivalence classes. [2025-01-10 01:01:31,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 26 of 28 statements. [2025-01-10 01:01:31,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 01:01:31,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:01:31,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:31,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246269642] [2025-01-10 01:01:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246269642] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:31,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148437598] [2025-01-10 01:01:31,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:01:31,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:31,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:31,123 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:31,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 01:01:31,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 7 equivalence classes. [2025-01-10 01:01:31,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 26 of 28 statements. [2025-01-10 01:01:31,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 01:01:31,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:31,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:01:31,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:01:31,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 43 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:01:31,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148437598] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:31,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:31,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-01-10 01:01:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444643303] [2025-01-10 01:01:31,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:31,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:01:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:31,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:01:31,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:01:31,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2025-01-10 01:01:31,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 157 transitions, 2002 flow. Second operand has 20 states, 20 states have (on average 27.25) internal successors, (545), 20 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:31,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:31,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2025-01-10 01:01:31,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:32,165 INFO L124 PetriNetUnfolderBase]: 2289/5627 cut-off events. [2025-01-10 01:01:32,166 INFO L125 PetriNetUnfolderBase]: For 22037/22438 co-relation queries the response was YES. [2025-01-10 01:01:32,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19891 conditions, 5627 events. 2289/5627 cut-off events. For 22037/22438 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 50702 event pairs, 852 based on Foata normal form. 34/5367 useless extension candidates. Maximal degree in co-relation 16638. Up to 1422 conditions per place. [2025-01-10 01:01:32,197 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 153 selfloop transitions, 53 changer transitions 0/234 dead transitions. [2025-01-10 01:01:32,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 234 transitions, 2932 flow [2025-01-10 01:01:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:01:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:01:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 421 transitions. [2025-01-10 01:01:32,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746794871794872 [2025-01-10 01:01:32,202 INFO L175 Difference]: Start difference. First operand has 179 places, 157 transitions, 2002 flow. Second operand 13 states and 421 transitions. [2025-01-10 01:01:32,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 234 transitions, 2932 flow [2025-01-10 01:01:32,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 234 transitions, 2806 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-01-10 01:01:32,233 INFO L231 Difference]: Finished difference. Result has 186 places, 165 transitions, 2165 flow [2025-01-10 01:01:32,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2165, PETRI_PLACES=186, PETRI_TRANSITIONS=165} [2025-01-10 01:01:32,233 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 140 predicate places. [2025-01-10 01:01:32,233 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 165 transitions, 2165 flow [2025-01-10 01:01:32,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 27.25) internal successors, (545), 20 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:32,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:32,234 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:32,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-01-10 01:01:32,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 01:01:32,434 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:32,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1276721842, now seen corresponding path program 3 times [2025-01-10 01:01:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:32,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676895175] [2025-01-10 01:01:32,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:01:32,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:32,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 8 equivalence classes. [2025-01-10 01:01:32,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:32,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 01:01:32,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:01:32,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:32,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676895175] [2025-01-10 01:01:32,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676895175] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:32,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620137835] [2025-01-10 01:01:32,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:01:32,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:32,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:32,566 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:32,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 01:01:32,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 8 equivalence classes. [2025-01-10 01:01:32,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:32,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 01:01:32,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:32,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:01:32,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:01:32,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:32,846 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 11 treesize of output 9 [2025-01-10 01:01:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 26 proven. 65 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:01:32,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620137835] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:32,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:32,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2025-01-10 01:01:32,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51765049] [2025-01-10 01:01:32,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:01:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:32,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:01:32,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:01:33,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2025-01-10 01:01:33,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 165 transitions, 2165 flow. Second operand has 28 states, 28 states have (on average 24.714285714285715) internal successors, (692), 28 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:33,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:33,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2025-01-10 01:01:33,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:34,229 INFO L124 PetriNetUnfolderBase]: 2741/6017 cut-off events. [2025-01-10 01:01:34,229 INFO L125 PetriNetUnfolderBase]: For 22419/22600 co-relation queries the response was YES. [2025-01-10 01:01:34,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22025 conditions, 6017 events. 2741/6017 cut-off events. For 22419/22600 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 49564 event pairs, 160 based on Foata normal form. 96/6018 useless extension candidates. Maximal degree in co-relation 18612. Up to 1247 conditions per place. [2025-01-10 01:01:34,250 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 171 selfloop transitions, 81 changer transitions 0/278 dead transitions. [2025-01-10 01:01:34,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 278 transitions, 3594 flow [2025-01-10 01:01:34,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:01:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:01:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 421 transitions. [2025-01-10 01:01:34,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746794871794872 [2025-01-10 01:01:34,252 INFO L175 Difference]: Start difference. First operand has 186 places, 165 transitions, 2165 flow. Second operand 13 states and 421 transitions. [2025-01-10 01:01:34,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 278 transitions, 3594 flow [2025-01-10 01:01:34,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 278 transitions, 3543 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:01:34,285 INFO L231 Difference]: Finished difference. Result has 194 places, 168 transitions, 2346 flow [2025-01-10 01:01:34,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2117, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2346, PETRI_PLACES=194, PETRI_TRANSITIONS=168} [2025-01-10 01:01:34,285 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 148 predicate places. [2025-01-10 01:01:34,285 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 168 transitions, 2346 flow [2025-01-10 01:01:34,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 24.714285714285715) internal successors, (692), 28 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:34,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:34,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:34,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-01-10 01:01:34,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:34,486 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:34,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:34,487 INFO L85 PathProgramCache]: Analyzing trace with hash 90212617, now seen corresponding path program 1 times [2025-01-10 01:01:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:34,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511973774] [2025-01-10 01:01:34,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:34,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:34,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:01:34,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:34,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:34,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511973774] [2025-01-10 01:01:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511973774] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445816788] [2025-01-10 01:01:34,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:34,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:34,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:34,682 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:34,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 01:01:34,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:01:34,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:34,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:34,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:34,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:01:34,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:34,840 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-10 01:01:34,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-01-10 01:01:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:01:34,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:34,929 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-01-10 01:01:34,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-01-10 01:01:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:01:34,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445816788] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:34,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:34,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-01-10 01:01:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811667975] [2025-01-10 01:01:34,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:34,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:01:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:34,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:01:34,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:01:35,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2025-01-10 01:01:35,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 168 transitions, 2346 flow. Second operand has 20 states, 20 states have (on average 24.8) internal successors, (496), 20 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:35,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:35,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2025-01-10 01:01:35,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:36,323 INFO L124 PetriNetUnfolderBase]: 3855/8023 cut-off events. [2025-01-10 01:01:36,324 INFO L125 PetriNetUnfolderBase]: For 33001/33045 co-relation queries the response was YES. [2025-01-10 01:01:36,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31351 conditions, 8023 events. 3855/8023 cut-off events. For 33001/33045 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 63816 event pairs, 455 based on Foata normal form. 92/8061 useless extension candidates. Maximal degree in co-relation 25817. Up to 4355 conditions per place. [2025-01-10 01:01:36,369 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 151 selfloop transitions, 84 changer transitions 1/252 dead transitions. [2025-01-10 01:01:36,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 252 transitions, 3586 flow [2025-01-10 01:01:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:01:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:01:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 304 transitions. [2025-01-10 01:01:36,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-01-10 01:01:36,370 INFO L175 Difference]: Start difference. First operand has 194 places, 168 transitions, 2346 flow. Second operand 10 states and 304 transitions. [2025-01-10 01:01:36,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 252 transitions, 3586 flow [2025-01-10 01:01:36,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 252 transitions, 3431 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-01-10 01:01:36,481 INFO L231 Difference]: Finished difference. Result has 200 places, 183 transitions, 2678 flow [2025-01-10 01:01:36,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2227, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2678, PETRI_PLACES=200, PETRI_TRANSITIONS=183} [2025-01-10 01:01:36,482 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 154 predicate places. [2025-01-10 01:01:36,482 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 183 transitions, 2678 flow [2025-01-10 01:01:36,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 24.8) internal successors, (496), 20 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:36,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:36,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:36,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-10 01:01:36,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:36,687 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:36,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1884948379, now seen corresponding path program 2 times [2025-01-10 01:01:36,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:36,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984618070] [2025-01-10 01:01:36,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:36,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:36,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:01:36,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:36,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:36,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:37,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984618070] [2025-01-10 01:01:37,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984618070] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:37,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581912690] [2025-01-10 01:01:37,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:37,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:37,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:37,234 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:37,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 01:01:37,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:01:37,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:37,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:37,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:37,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:01:37,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:37,487 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-01-10 01:01:37,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-01-10 01:01:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:37,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:37,728 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-01-10 01:01:37,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-01-10 01:01:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:01:37,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581912690] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:37,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:01:37,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 8] total 23 [2025-01-10 01:01:37,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198746375] [2025-01-10 01:01:37,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:37,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:01:37,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:37,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:01:37,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:01:38,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2025-01-10 01:01:38,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 183 transitions, 2678 flow. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:38,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:38,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2025-01-10 01:01:38,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:41,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:01:42,166 INFO L124 PetriNetUnfolderBase]: 3945/8204 cut-off events. [2025-01-10 01:01:42,166 INFO L125 PetriNetUnfolderBase]: For 38642/38661 co-relation queries the response was YES. [2025-01-10 01:01:42,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33197 conditions, 8204 events. 3945/8204 cut-off events. For 38642/38661 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 65946 event pairs, 1198 based on Foata normal form. 45/8214 useless extension candidates. Maximal degree in co-relation 27383. Up to 5888 conditions per place. [2025-01-10 01:01:42,223 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 141 selfloop transitions, 80 changer transitions 17/254 dead transitions. [2025-01-10 01:01:42,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 254 transitions, 4054 flow [2025-01-10 01:01:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:01:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:01:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 248 transitions. [2025-01-10 01:01:42,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-01-10 01:01:42,224 INFO L175 Difference]: Start difference. First operand has 200 places, 183 transitions, 2678 flow. Second operand 8 states and 248 transitions. [2025-01-10 01:01:42,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 254 transitions, 4054 flow [2025-01-10 01:01:42,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 254 transitions, 3927 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-01-10 01:01:42,325 INFO L231 Difference]: Finished difference. Result has 208 places, 214 transitions, 3510 flow [2025-01-10 01:01:42,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3510, PETRI_PLACES=208, PETRI_TRANSITIONS=214} [2025-01-10 01:01:42,326 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 162 predicate places. [2025-01-10 01:01:42,326 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 214 transitions, 3510 flow [2025-01-10 01:01:42,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:42,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:42,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:42,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-10 01:01:42,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-01-10 01:01:42,527 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:42,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2132241311, now seen corresponding path program 3 times [2025-01-10 01:01:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:42,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799502403] [2025-01-10 01:01:42,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:01:42,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:42,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-01-10 01:01:42,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 28 statements. [2025-01-10 01:01:42,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:01:42,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:01:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:42,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799502403] [2025-01-10 01:01:42,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799502403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:42,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:42,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:01:42,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100061817] [2025-01-10 01:01:42,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:42,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:01:42,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:42,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:01:42,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:01:42,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2025-01-10 01:01:42,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 214 transitions, 3510 flow. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:42,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:42,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2025-01-10 01:01:42,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:43,496 INFO L124 PetriNetUnfolderBase]: 3963/8184 cut-off events. [2025-01-10 01:01:43,496 INFO L125 PetriNetUnfolderBase]: For 43289/43329 co-relation queries the response was YES. [2025-01-10 01:01:43,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34722 conditions, 8184 events. 3963/8184 cut-off events. For 43289/43329 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 65108 event pairs, 1427 based on Foata normal form. 45/8149 useless extension candidates. Maximal degree in co-relation 30625. Up to 5942 conditions per place. [2025-01-10 01:01:43,556 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 143 selfloop transitions, 112 changer transitions 9/280 dead transitions. [2025-01-10 01:01:43,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 280 transitions, 5051 flow [2025-01-10 01:01:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:01:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:01:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 243 transitions. [2025-01-10 01:01:43,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6328125 [2025-01-10 01:01:43,557 INFO L175 Difference]: Start difference. First operand has 208 places, 214 transitions, 3510 flow. Second operand 8 states and 243 transitions. [2025-01-10 01:01:43,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 280 transitions, 5051 flow [2025-01-10 01:01:43,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 280 transitions, 4823 flow, removed 31 selfloop flow, removed 4 redundant places. [2025-01-10 01:01:43,707 INFO L231 Difference]: Finished difference. Result has 212 places, 249 transitions, 4465 flow [2025-01-10 01:01:43,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3369, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4465, PETRI_PLACES=212, PETRI_TRANSITIONS=249} [2025-01-10 01:01:43,711 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 166 predicate places. [2025-01-10 01:01:43,711 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 249 transitions, 4465 flow [2025-01-10 01:01:43,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:43,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:43,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:43,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-10 01:01:43,711 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:43,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash -540375113, now seen corresponding path program 2 times [2025-01-10 01:01:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032257218] [2025-01-10 01:01:43,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:43,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:01:43,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:43,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:43,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:01:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032257218] [2025-01-10 01:01:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032257218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:43,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:01:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377276345] [2025-01-10 01:01:43,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:43,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:01:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:43,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:01:43,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:01:43,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2025-01-10 01:01:43,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 249 transitions, 4465 flow. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:43,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:43,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2025-01-10 01:01:43,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:44,769 INFO L124 PetriNetUnfolderBase]: 4224/8585 cut-off events. [2025-01-10 01:01:44,769 INFO L125 PetriNetUnfolderBase]: For 49023/49063 co-relation queries the response was YES. [2025-01-10 01:01:44,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38157 conditions, 8585 events. 4224/8585 cut-off events. For 49023/49063 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 67603 event pairs, 1438 based on Foata normal form. 36/8586 useless extension candidates. Maximal degree in co-relation 34796. Up to 6050 conditions per place. [2025-01-10 01:01:44,826 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 147 selfloop transitions, 158 changer transitions 10/331 dead transitions. [2025-01-10 01:01:44,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 331 transitions, 6609 flow [2025-01-10 01:01:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:01:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:01:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 243 transitions. [2025-01-10 01:01:44,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6328125 [2025-01-10 01:01:44,827 INFO L175 Difference]: Start difference. First operand has 212 places, 249 transitions, 4465 flow. Second operand 8 states and 243 transitions. [2025-01-10 01:01:44,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 331 transitions, 6609 flow [2025-01-10 01:01:45,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 331 transitions, 6177 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 01:01:45,074 INFO L231 Difference]: Finished difference. Result has 217 places, 300 transitions, 5833 flow [2025-01-10 01:01:45,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4170, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5833, PETRI_PLACES=217, PETRI_TRANSITIONS=300} [2025-01-10 01:01:45,075 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 171 predicate places. [2025-01-10 01:01:45,075 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 300 transitions, 5833 flow [2025-01-10 01:01:45,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:45,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:45,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:45,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-10 01:01:45,075 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:45,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash -64920873, now seen corresponding path program 4 times [2025-01-10 01:01:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:45,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152666124] [2025-01-10 01:01:45,076 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:01:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:45,083 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:01:45,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:45,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:01:45,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:01:45,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:45,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152666124] [2025-01-10 01:01:45,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152666124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:45,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:45,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:01:45,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627677572] [2025-01-10 01:01:45,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:45,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:01:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:45,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:01:45,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:01:45,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2025-01-10 01:01:45,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 300 transitions, 5833 flow. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:45,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:45,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2025-01-10 01:01:45,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:46,305 INFO L124 PetriNetUnfolderBase]: 4296/8733 cut-off events. [2025-01-10 01:01:46,305 INFO L125 PetriNetUnfolderBase]: For 53313/53353 co-relation queries the response was YES. [2025-01-10 01:01:46,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39878 conditions, 8733 events. 4296/8733 cut-off events. For 53313/53353 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 68906 event pairs, 1540 based on Foata normal form. 45/8702 useless extension candidates. Maximal degree in co-relation 36513. Up to 6095 conditions per place. [2025-01-10 01:01:46,351 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 145 selfloop transitions, 174 changer transitions 12/347 dead transitions. [2025-01-10 01:01:46,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 347 transitions, 7040 flow [2025-01-10 01:01:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:01:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:01:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 244 transitions. [2025-01-10 01:01:46,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2025-01-10 01:01:46,352 INFO L175 Difference]: Start difference. First operand has 217 places, 300 transitions, 5833 flow. Second operand 8 states and 244 transitions. [2025-01-10 01:01:46,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 347 transitions, 7040 flow [2025-01-10 01:01:46,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 347 transitions, 6839 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 01:01:46,556 INFO L231 Difference]: Finished difference. Result has 224 places, 316 transitions, 6451 flow [2025-01-10 01:01:46,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5654, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6451, PETRI_PLACES=224, PETRI_TRANSITIONS=316} [2025-01-10 01:01:46,556 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 178 predicate places. [2025-01-10 01:01:46,556 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 316 transitions, 6451 flow [2025-01-10 01:01:46,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:46,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:46,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:46,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-10 01:01:46,557 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:46,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1079724039, now seen corresponding path program 3 times [2025-01-10 01:01:46,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:46,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455929741] [2025-01-10 01:01:46,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:01:46,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:46,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-01-10 01:01:46,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 28 statements. [2025-01-10 01:01:46,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:01:46,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:01:46,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:46,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455929741] [2025-01-10 01:01:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455929741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:46,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:01:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840931676] [2025-01-10 01:01:46,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:46,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:01:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:46,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:01:46,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:01:46,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2025-01-10 01:01:46,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 316 transitions, 6451 flow. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:46,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:46,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2025-01-10 01:01:46,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:47,957 INFO L124 PetriNetUnfolderBase]: 4283/8885 cut-off events. [2025-01-10 01:01:47,958 INFO L125 PetriNetUnfolderBase]: For 59826/59826 co-relation queries the response was YES. [2025-01-10 01:01:48,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42011 conditions, 8885 events. 4283/8885 cut-off events. For 59826/59826 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 71122 event pairs, 521 based on Foata normal form. 124/8970 useless extension candidates. Maximal degree in co-relation 38643. Up to 4493 conditions per place. [2025-01-10 01:01:48,047 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 186 selfloop transitions, 197 changer transitions 1/400 dead transitions. [2025-01-10 01:01:48,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 400 transitions, 8111 flow [2025-01-10 01:01:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:01:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:01:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 283 transitions. [2025-01-10 01:01:48,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6550925925925926 [2025-01-10 01:01:48,048 INFO L175 Difference]: Start difference. First operand has 224 places, 316 transitions, 6451 flow. Second operand 9 states and 283 transitions. [2025-01-10 01:01:48,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 400 transitions, 8111 flow [2025-01-10 01:01:48,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 400 transitions, 7807 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-01-10 01:01:48,392 INFO L231 Difference]: Finished difference. Result has 228 places, 327 transitions, 6775 flow [2025-01-10 01:01:48,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6155, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6775, PETRI_PLACES=228, PETRI_TRANSITIONS=327} [2025-01-10 01:01:48,392 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 182 predicate places. [2025-01-10 01:01:48,393 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 327 transitions, 6775 flow [2025-01-10 01:01:48,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:48,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:48,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:48,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-10 01:01:48,393 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:01:48,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1459069297, now seen corresponding path program 5 times [2025-01-10 01:01:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:48,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618460914] [2025-01-10 01:01:48,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:01:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:48,403 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-01-10 01:01:48,410 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:48,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:01:48,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:01:48,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:48,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618460914] [2025-01-10 01:01:48,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618460914] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:48,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347459734] [2025-01-10 01:01:48,612 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:01:48,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:48,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:48,614 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:48,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 01:01:48,663 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-01-10 01:01:48,680 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:48,680 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:01:48,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:48,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:01:48,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:48,826 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-01-10 01:01:48,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-01-10 01:01:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:48,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:49,002 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-01-10 01:01:49,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-01-10 01:01:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:01:49,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347459734] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:49,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:01:49,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 20 [2025-01-10 01:01:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194171127] [2025-01-10 01:01:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:49,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:01:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:49,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:01:49,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:01:49,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2025-01-10 01:01:49,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 327 transitions, 6775 flow. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:49,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:49,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2025-01-10 01:01:49,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:53,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:01:54,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]