./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive-alt.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 d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:12:24,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:12:24,799 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:12:24,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:12:24,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:12:24,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:12:24,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:12:24,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:12:24,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:12:24,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:12:24,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:12:24,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:12:24,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:12:24,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:12:24,829 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:12:24,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:12:24,830 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:12:24,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:12:24,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:12:24,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:12:24,830 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:12:24,830 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:12:24,830 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:12:24,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:12:24,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:12:24,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:12:24,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:12:24,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:12:24,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:12:24,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:12:24,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:12:24,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:12:24,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:12:24,832 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 -> d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 [2025-01-10 01:12:25,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:12:25,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:12:25,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:12:25,050 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:12:25,051 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:12:25,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-01-10 01:12:26,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80225de10/1f5ea693da0948949f8013a9b3b52a21/FLAG94bd5b10c [2025-01-10 01:12:26,398 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:12:26,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-01-10 01:12:26,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80225de10/1f5ea693da0948949f8013a9b3b52a21/FLAG94bd5b10c [2025-01-10 01:12:26,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80225de10/1f5ea693da0948949f8013a9b3b52a21 [2025-01-10 01:12:26,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:12:26,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:12:26,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:12:26,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:12:26,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:12:26,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:26,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6999377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26, skipping insertion in model container [2025-01-10 01:12:26,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:26,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:12:26,894 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:12:26,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:12:26,904 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:12:26,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:12:26,934 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:12:26,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26 WrapperNode [2025-01-10 01:12:26,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:12:26,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:12:26,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:12:26,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:12:26,942 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:12:26" (1/1) ... [2025-01-10 01:12:26,952 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:12:26" (1/1) ... [2025-01-10 01:12:26,969 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 136 [2025-01-10 01:12:26,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:12:26,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:12:26,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:12:26,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:12:26,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:26,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:26,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:27,000 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:12:27,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:27,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:27,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:27,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:27,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:27,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:27,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:27,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:12:27,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:12:27,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:12:27,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:12:27,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (1/1) ... [2025-01-10 01:12:27,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:12:27,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:27,045 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:12:27,047 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:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:12:27,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:12:27,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:12:27,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:12:27,063 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:12:27,141 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:12:27,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:12:27,337 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:12:27,337 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:12:27,491 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:12:27,491 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:12:27,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:12:27 BoogieIcfgContainer [2025-01-10 01:12:27,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:12:27,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:12:27,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:12:27,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:12:27,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:12:26" (1/3) ... [2025-01-10 01:12:27,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ade9243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:12:27, skipping insertion in model container [2025-01-10 01:12:27,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:26" (2/3) ... [2025-01-10 01:12:27,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ade9243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:12:27, skipping insertion in model container [2025-01-10 01:12:27,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:12:27" (3/3) ... [2025-01-10 01:12:27,501 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2025-01-10 01:12:27,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:12:27,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive-alt.wvr.c that has 3 procedures, 38 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-01-10 01:12:27,512 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:12:27,555 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:12:27,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 100 flow [2025-01-10 01:12:27,603 INFO L124 PetriNetUnfolderBase]: 6/41 cut-off events. [2025-01-10 01:12:27,606 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:12:27,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 6/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-01-10 01:12:27,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 100 flow [2025-01-10 01:12:27,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 40 transitions, 92 flow [2025-01-10 01:12:27,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:12:27,622 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;@6793ce97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:12:27,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-10 01:12:27,625 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:12:27,625 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:12:27,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:12:27,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:27,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:12:27,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:27,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash 449271, now seen corresponding path program 1 times [2025-01-10 01:12:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:27,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175191855] [2025-01-10 01:12:27,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:27,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:27,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:12:27,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:12:27,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:27,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:27,811 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:12:27,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:27,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175191855] [2025-01-10 01:12:27,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175191855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:27,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:27,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:12:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356194430] [2025-01-10 01:12:27,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:27,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:12:27,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:27,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:12:27,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:12:27,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-01-10 01:12:27,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:12:27,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:27,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-01-10 01:12:27,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:27,999 INFO L124 PetriNetUnfolderBase]: 308/550 cut-off events. [2025-01-10 01:12:27,999 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 01:12:28,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 550 events. 308/550 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2433 event pairs, 250 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 1005. Up to 497 conditions per place. [2025-01-10 01:12:28,004 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 27 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-01-10 01:12:28,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 140 flow [2025-01-10 01:12:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:12:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:12:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-01-10 01:12:28,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2025-01-10 01:12:28,013 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 92 flow. Second operand 3 states and 60 transitions. [2025-01-10 01:12:28,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 140 flow [2025-01-10 01:12:28,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:12:28,018 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 78 flow [2025-01-10 01:12:28,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2025-01-10 01:12:28,021 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2025-01-10 01:12:28,021 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 78 flow [2025-01-10 01:12:28,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:12:28,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:28,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:12:28,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:12:28,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:28,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:28,022 INFO L85 PathProgramCache]: Analyzing trace with hash 449272, now seen corresponding path program 1 times [2025-01-10 01:12:28,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:28,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611280971] [2025-01-10 01:12:28,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:28,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:28,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:12:28,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:12:28,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:28,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:28,236 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:12:28,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:28,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611280971] [2025-01-10 01:12:28,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611280971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:28,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:28,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:12:28,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889613646] [2025-01-10 01:12:28,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:28,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:28,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:28,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:28,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:28,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-01-10 01:12:28,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:12:28,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:28,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-01-10 01:12:28,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:28,403 INFO L124 PetriNetUnfolderBase]: 309/553 cut-off events. [2025-01-10 01:12:28,404 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 01:12:28,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 553 events. 309/553 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2443 event pairs, 250 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 1049. Up to 502 conditions per place. [2025-01-10 01:12:28,409 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 29 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-01-10 01:12:28,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 152 flow [2025-01-10 01:12:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-01-10 01:12:28,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4069767441860465 [2025-01-10 01:12:28,412 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 78 flow. Second operand 4 states and 70 transitions. [2025-01-10 01:12:28,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 152 flow [2025-01-10 01:12:28,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:28,413 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 101 flow [2025-01-10 01:12:28,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2025-01-10 01:12:28,414 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-01-10 01:12:28,414 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 101 flow [2025-01-10 01:12:28,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:12:28,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:28,414 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:12:28,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:12:28,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:28,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:28,414 INFO L85 PathProgramCache]: Analyzing trace with hash 431764331, now seen corresponding path program 1 times [2025-01-10 01:12:28,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:28,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051200803] [2025-01-10 01:12:28,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:28,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:28,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:12:28,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:12:28,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:28,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:28,572 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:12:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:28,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051200803] [2025-01-10 01:12:28,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051200803] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:28,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967627820] [2025-01-10 01:12:28,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:28,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:28,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:28,574 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:12:28,576 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:12:28,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:12:28,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:12:28,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:28,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:28,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:12:28,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:28,666 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:12:28,826 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:12:28,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:28,916 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:12:28,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967627820] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:28,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:28,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:12:28,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525312587] [2025-01-10 01:12:28,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:28,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:12:28,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:28,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:12:28,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:12:28,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-01-10 01:12:28,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 101 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 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:12:28,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:28,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-01-10 01:12:28,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:29,148 INFO L124 PetriNetUnfolderBase]: 310/555 cut-off events. [2025-01-10 01:12:29,149 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 01:12:29,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 555 events. 310/555 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2445 event pairs, 250 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 1056. Up to 499 conditions per place. [2025-01-10 01:12:29,152 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 25 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2025-01-10 01:12:29,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 179 flow [2025-01-10 01:12:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:12:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:12:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2025-01-10 01:12:29,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3168604651162791 [2025-01-10 01:12:29,153 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 101 flow. Second operand 8 states and 109 transitions. [2025-01-10 01:12:29,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 179 flow [2025-01-10 01:12:29,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:29,154 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 126 flow [2025-01-10 01:12:29,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-01-10 01:12:29,155 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-01-10 01:12:29,155 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 126 flow [2025-01-10 01:12:29,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 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:12:29,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:29,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:29,161 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:12:29,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:29,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:29,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1599712421, now seen corresponding path program 1 times [2025-01-10 01:12:29,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:29,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651785005] [2025-01-10 01:12:29,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:29,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:29,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:12:29,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:12:29,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:29,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:29,390 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:12:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651785005] [2025-01-10 01:12:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651785005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:29,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:29,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:12:29,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246628526] [2025-01-10 01:12:29,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:29,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:12:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:29,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:12:29,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:12:29,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:29,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:12:29,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:29,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:29,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:29,501 INFO L124 PetriNetUnfolderBase]: 405/745 cut-off events. [2025-01-10 01:12:29,502 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 01:12:29,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 745 events. 405/745 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3432 event pairs, 186 based on Foata normal form. 22/527 useless extension candidates. Maximal degree in co-relation 1428. Up to 420 conditions per place. [2025-01-10 01:12:29,505 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 50 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-01-10 01:12:29,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 270 flow [2025-01-10 01:12:29,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:12:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:12:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-01-10 01:12:29,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6201550387596899 [2025-01-10 01:12:29,507 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 126 flow. Second operand 3 states and 80 transitions. [2025-01-10 01:12:29,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 270 flow [2025-01-10 01:12:29,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 228 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-01-10 01:12:29,509 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 107 flow [2025-01-10 01:12:29,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=40, PETRI_TRANSITIONS=42} [2025-01-10 01:12:29,510 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-01-10 01:12:29,510 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 107 flow [2025-01-10 01:12:29,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:12:29,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:29,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:29,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:12:29,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:29,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash -299475094, now seen corresponding path program 1 times [2025-01-10 01:12:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:29,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957745741] [2025-01-10 01:12:29,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:29,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:12:29,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:12:29,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:29,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:29,578 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:12:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957745741] [2025-01-10 01:12:29,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957745741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:29,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:29,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:12:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548237601] [2025-01-10 01:12:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:29,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:29,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:29,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:29,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:29,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-01-10 01:12:29,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:12:29,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:29,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-01-10 01:12:29,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:29,655 INFO L124 PetriNetUnfolderBase]: 304/571 cut-off events. [2025-01-10 01:12:29,655 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 01:12:29,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 571 events. 304/571 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2462 event pairs, 246 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 466. Up to 511 conditions per place. [2025-01-10 01:12:29,657 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 30 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-01-10 01:12:29,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 167 flow [2025-01-10 01:12:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-01-10 01:12:29,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37790697674418605 [2025-01-10 01:12:29,659 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 107 flow. Second operand 4 states and 65 transitions. [2025-01-10 01:12:29,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 167 flow [2025-01-10 01:12:29,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:29,662 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 104 flow [2025-01-10 01:12:29,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2025-01-10 01:12:29,662 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-01-10 01:12:29,662 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 104 flow [2025-01-10 01:12:29,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:12:29,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:29,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:29,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:12:29,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:29,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash -299475093, now seen corresponding path program 1 times [2025-01-10 01:12:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:29,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500560814] [2025-01-10 01:12:29,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:29,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:12:29,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:12:29,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:29,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:29,714 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:12:29,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:29,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500560814] [2025-01-10 01:12:29,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500560814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:29,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:29,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:29,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061502204] [2025-01-10 01:12:29,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:29,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:29,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:29,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:29,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:29,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:29,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:29,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:29,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:29,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:29,828 INFO L124 PetriNetUnfolderBase]: 371/708 cut-off events. [2025-01-10 01:12:29,828 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-01-10 01:12:29,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 708 events. 371/708 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3150 event pairs, 314 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 1155. Up to 516 conditions per place. [2025-01-10 01:12:29,832 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 45 selfloop transitions, 3 changer transitions 1/54 dead transitions. [2025-01-10 01:12:29,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 236 flow [2025-01-10 01:12:29,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-01-10 01:12:29,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4941860465116279 [2025-01-10 01:12:29,833 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 104 flow. Second operand 4 states and 85 transitions. [2025-01-10 01:12:29,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 236 flow [2025-01-10 01:12:29,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:29,835 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 108 flow [2025-01-10 01:12:29,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-01-10 01:12:29,836 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2025-01-10 01:12:29,836 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 108 flow [2025-01-10 01:12:29,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:29,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:29,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:29,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:12:29,836 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:29,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2140852328, now seen corresponding path program 1 times [2025-01-10 01:12:29,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:29,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154286220] [2025-01-10 01:12:29,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:29,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:29,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:12:29,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:12:29,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:29,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:30,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154286220] [2025-01-10 01:12:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154286220] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548717608] [2025-01-10 01:12:30,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:30,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:30,023 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:12:30,024 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:12:30,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:12:30,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:12:30,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:30,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:30,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:12:30,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:30,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:12:30,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548717608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:30,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:12:30,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-01-10 01:12:30,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403846010] [2025-01-10 01:12:30,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:30,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:12:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:30,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:12:30,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:12:30,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:30,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:30,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:30,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:30,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:30,305 INFO L124 PetriNetUnfolderBase]: 282/565 cut-off events. [2025-01-10 01:12:30,305 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-10 01:12:30,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 565 events. 282/565 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2445 event pairs, 202 based on Foata normal form. 48/548 useless extension candidates. Maximal degree in co-relation 877. Up to 438 conditions per place. [2025-01-10 01:12:30,309 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 29 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2025-01-10 01:12:30,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 193 flow [2025-01-10 01:12:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:12:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:12:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-01-10 01:12:30,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39069767441860465 [2025-01-10 01:12:30,311 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 108 flow. Second operand 5 states and 84 transitions. [2025-01-10 01:12:30,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 193 flow [2025-01-10 01:12:30,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:30,312 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 113 flow [2025-01-10 01:12:30,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-01-10 01:12:30,312 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-01-10 01:12:30,312 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 113 flow [2025-01-10 01:12:30,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:30,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:30,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:30,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:12:30,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:30,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:30,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash -693183611, now seen corresponding path program 1 times [2025-01-10 01:12:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:30,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245078853] [2025-01-10 01:12:30,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:30,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:12:30,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:12:30,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:30,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:30,563 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:12:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:30,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245078853] [2025-01-10 01:12:30,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245078853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:30,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:30,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:12:30,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205077149] [2025-01-10 01:12:30,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:12:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:30,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:12:30,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:12:30,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:30,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:12:30,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:30,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:30,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:30,640 INFO L124 PetriNetUnfolderBase]: 356/673 cut-off events. [2025-01-10 01:12:30,641 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-01-10 01:12:30,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 673 events. 356/673 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2801 event pairs, 220 based on Foata normal form. 3/603 useless extension candidates. Maximal degree in co-relation 1228. Up to 462 conditions per place. [2025-01-10 01:12:30,644 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 38 selfloop transitions, 2 changer transitions 5/50 dead transitions. [2025-01-10 01:12:30,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 247 flow [2025-01-10 01:12:30,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:12:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:12:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-01-10 01:12:30,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5271317829457365 [2025-01-10 01:12:30,645 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 113 flow. Second operand 3 states and 68 transitions. [2025-01-10 01:12:30,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 247 flow [2025-01-10 01:12:30,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 223 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:12:30,648 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 104 flow [2025-01-10 01:12:30,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2025-01-10 01:12:30,649 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-01-10 01:12:30,650 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 104 flow [2025-01-10 01:12:30,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:12:30,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:30,650 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:30,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:12:30,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:30,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1606097100, now seen corresponding path program 1 times [2025-01-10 01:12:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:30,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043688031] [2025-01-10 01:12:30,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:30,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:12:30,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:12:30,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:30,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:31,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043688031] [2025-01-10 01:12:31,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043688031] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415682298] [2025-01-10 01:12:31,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:31,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:31,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:31,042 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:12:31,043 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:12:31,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:12:31,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:12:31,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:31,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:31,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:12:31,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:31,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:12:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:31,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:31,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-01-10 01:12:31,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:12:31,545 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 78 treesize of output 68 [2025-01-10 01:12:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:31,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415682298] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:31,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:31,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-01-10 01:12:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763328356] [2025-01-10 01:12:31,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:31,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:12:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:31,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:12:31,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:12:31,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:31,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 104 flow. Second operand has 19 states, 19 states have (on average 13.473684210526315) internal successors, (256), 19 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:31,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:31,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:31,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:32,638 INFO L124 PetriNetUnfolderBase]: 1418/2716 cut-off events. [2025-01-10 01:12:32,638 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2025-01-10 01:12:32,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5886 conditions, 2716 events. 1418/2716 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16830 event pairs, 331 based on Foata normal form. 3/2410 useless extension candidates. Maximal degree in co-relation 3764. Up to 500 conditions per place. [2025-01-10 01:12:32,646 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 141 selfloop transitions, 36 changer transitions 62/244 dead transitions. [2025-01-10 01:12:32,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 244 transitions, 1154 flow [2025-01-10 01:12:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:12:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 01:12:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 449 transitions. [2025-01-10 01:12:32,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49723145071982283 [2025-01-10 01:12:32,648 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 104 flow. Second operand 21 states and 449 transitions. [2025-01-10 01:12:32,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 244 transitions, 1154 flow [2025-01-10 01:12:32,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 244 transitions, 1120 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:32,651 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 380 flow [2025-01-10 01:12:32,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=380, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2025-01-10 01:12:32,651 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2025-01-10 01:12:32,651 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 380 flow [2025-01-10 01:12:32,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.473684210526315) internal successors, (256), 19 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:32,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:32,652 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:32,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:12:32,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:32,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:32,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash 220329454, now seen corresponding path program 1 times [2025-01-10 01:12:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:32,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301815968] [2025-01-10 01:12:32,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:32,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:12:32,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:12:32,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:32,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:32,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301815968] [2025-01-10 01:12:32,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301815968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:32,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:32,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:32,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805823485] [2025-01-10 01:12:32,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:32,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:12:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:32,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:12:32,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:12:32,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2025-01-10 01:12:32,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:32,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:32,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2025-01-10 01:12:32,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:33,075 INFO L124 PetriNetUnfolderBase]: 1592/2821 cut-off events. [2025-01-10 01:12:33,075 INFO L125 PetriNetUnfolderBase]: For 3490/3490 co-relation queries the response was YES. [2025-01-10 01:12:33,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7476 conditions, 2821 events. 1592/2821 cut-off events. For 3490/3490 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16097 event pairs, 896 based on Foata normal form. 44/2664 useless extension candidates. Maximal degree in co-relation 6655. Up to 2035 conditions per place. [2025-01-10 01:12:33,084 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 68 selfloop transitions, 2 changer transitions 3/76 dead transitions. [2025-01-10 01:12:33,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 546 flow [2025-01-10 01:12:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:12:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:12:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-01-10 01:12:33,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2025-01-10 01:12:33,086 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 380 flow. Second operand 3 states and 64 transitions. [2025-01-10 01:12:33,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 546 flow [2025-01-10 01:12:33,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 76 transitions, 511 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-01-10 01:12:33,106 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 288 flow [2025-01-10 01:12:33,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-01-10 01:12:33,107 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2025-01-10 01:12:33,108 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 288 flow [2025-01-10 01:12:33,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:33,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:33,108 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:33,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:12:33,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:33,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 692591600, now seen corresponding path program 2 times [2025-01-10 01:12:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:33,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954567353] [2025-01-10 01:12:33,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:33,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 01:12:33,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:12:33,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:33,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:33,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:33,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954567353] [2025-01-10 01:12:33,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954567353] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:33,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047663081] [2025-01-10 01:12:33,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:33,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:33,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:33,216 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:12:33,218 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:12:33,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 01:12:33,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:12:33,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:33,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:33,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:12:33,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:33,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:33,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047663081] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:33,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:33,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:12:33,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732121623] [2025-01-10 01:12:33,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:33,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:12:33,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:33,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:12:33,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:12:33,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:33,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 288 flow. Second operand has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:12:33,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:33,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:33,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:33,665 INFO L124 PetriNetUnfolderBase]: 1066/2054 cut-off events. [2025-01-10 01:12:33,665 INFO L125 PetriNetUnfolderBase]: For 2142/2142 co-relation queries the response was YES. [2025-01-10 01:12:33,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 2054 events. 1066/2054 cut-off events. For 2142/2142 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 12026 event pairs, 466 based on Foata normal form. 44/1950 useless extension candidates. Maximal degree in co-relation 4983. Up to 687 conditions per place. [2025-01-10 01:12:33,674 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 34 selfloop transitions, 10 changer transitions 49/99 dead transitions. [2025-01-10 01:12:33,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 568 flow [2025-01-10 01:12:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:12:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:12:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2025-01-10 01:12:33,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-01-10 01:12:33,675 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 288 flow. Second operand 9 states and 172 transitions. [2025-01-10 01:12:33,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 568 flow [2025-01-10 01:12:33,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 99 transitions, 549 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:33,683 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 222 flow [2025-01-10 01:12:33,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2025-01-10 01:12:33,684 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2025-01-10 01:12:33,684 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 222 flow [2025-01-10 01:12:33,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:12:33,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:33,684 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:33,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:12:33,889 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,SelfDestructingSolverStorable10 [2025-01-10 01:12:33,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:33,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:33,889 INFO L85 PathProgramCache]: Analyzing trace with hash 998927743, now seen corresponding path program 3 times [2025-01-10 01:12:33,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:33,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293028780] [2025-01-10 01:12:33,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:33,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:33,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:12:33,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 33 statements. [2025-01-10 01:12:33,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:12:33,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:12:33,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293028780] [2025-01-10 01:12:33,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293028780] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246270368] [2025-01-10 01:12:33,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:33,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:33,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:33,951 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:12:33,953 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:12:33,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:12:34,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 33 statements. [2025-01-10 01:12:34,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:12:34,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:34,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:12:34,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:12:34,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:12:34,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246270368] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:34,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:34,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2025-01-10 01:12:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372694852] [2025-01-10 01:12:34,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:34,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:12:34,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:34,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:12:34,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:12:34,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:34,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:12:34,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:34,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:34,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:34,288 INFO L124 PetriNetUnfolderBase]: 1184/2280 cut-off events. [2025-01-10 01:12:34,288 INFO L125 PetriNetUnfolderBase]: For 3200/3200 co-relation queries the response was YES. [2025-01-10 01:12:34,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6116 conditions, 2280 events. 1184/2280 cut-off events. For 3200/3200 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 12863 event pairs, 461 based on Foata normal form. 22/2155 useless extension candidates. Maximal degree in co-relation 6078. Up to 786 conditions per place. [2025-01-10 01:12:34,296 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 59 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2025-01-10 01:12:34,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 515 flow [2025-01-10 01:12:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-01-10 01:12:34,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5406976744186046 [2025-01-10 01:12:34,297 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 222 flow. Second operand 4 states and 93 transitions. [2025-01-10 01:12:34,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 515 flow [2025-01-10 01:12:34,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 451 flow, removed 24 selfloop flow, removed 12 redundant places. [2025-01-10 01:12:34,302 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 302 flow [2025-01-10 01:12:34,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-01-10 01:12:34,304 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-01-10 01:12:34,304 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 302 flow [2025-01-10 01:12:34,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:12:34,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:34,305 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 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:12:34,310 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:12:34,509 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,SelfDestructingSolverStorable11 [2025-01-10 01:12:34,509 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:34,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1229941995, now seen corresponding path program 4 times [2025-01-10 01:12:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:34,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733827662] [2025-01-10 01:12:34,509 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:12:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:34,515 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:12:34,545 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:12:34,545 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:12:34,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:12:35,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:35,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733827662] [2025-01-10 01:12:35,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733827662] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:35,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125705218] [2025-01-10 01:12:35,318 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:12:35,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:35,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:35,321 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:12:35,322 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:12:35,360 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:12:35,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:12:35,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:12:35,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:35,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:12:35,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:12:35,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:35,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:12:35,536 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 40 treesize of output 24 [2025-01-10 01:12:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:12:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125705218] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:35,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:12:35,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 5] total 15 [2025-01-10 01:12:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125654788] [2025-01-10 01:12:35,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:35,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:12:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:35,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:12:35,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:12:35,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:35,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:12:35,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:35,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:35,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:35,826 INFO L124 PetriNetUnfolderBase]: 1433/2666 cut-off events. [2025-01-10 01:12:35,826 INFO L125 PetriNetUnfolderBase]: For 2875/2883 co-relation queries the response was YES. [2025-01-10 01:12:35,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7060 conditions, 2666 events. 1433/2666 cut-off events. For 2875/2883 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 14678 event pairs, 381 based on Foata normal form. 7/2498 useless extension candidates. Maximal degree in co-relation 3919. Up to 862 conditions per place. [2025-01-10 01:12:35,849 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 66 selfloop transitions, 12 changer transitions 14/98 dead transitions. [2025-01-10 01:12:35,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 98 transitions, 662 flow [2025-01-10 01:12:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:12:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:12:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-01-10 01:12:35,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5302325581395348 [2025-01-10 01:12:35,849 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 302 flow. Second operand 5 states and 114 transitions. [2025-01-10 01:12:35,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 98 transitions, 662 flow [2025-01-10 01:12:35,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 98 transitions, 640 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-01-10 01:12:35,852 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 350 flow [2025-01-10 01:12:35,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2025-01-10 01:12:35,852 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2025-01-10 01:12:35,852 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 350 flow [2025-01-10 01:12:35,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:12:35,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:35,853 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:35,858 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:12:36,053 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,SelfDestructingSolverStorable12 [2025-01-10 01:12:36,053 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:36,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1825162847, now seen corresponding path program 5 times [2025-01-10 01:12:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:36,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213002858] [2025-01-10 01:12:36,054 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:12:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:36,059 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-01-10 01:12:36,065 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 38 statements. [2025-01-10 01:12:36,066 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:36,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:12:36,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:36,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213002858] [2025-01-10 01:12:36,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213002858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:36,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:36,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:12:36,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650677358] [2025-01-10 01:12:36,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:36,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:36,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:36,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:36,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:36,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-01-10 01:12:36,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:36,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:36,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-01-10 01:12:36,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:36,376 INFO L124 PetriNetUnfolderBase]: 2506/4357 cut-off events. [2025-01-10 01:12:36,376 INFO L125 PetriNetUnfolderBase]: For 5433/5433 co-relation queries the response was YES. [2025-01-10 01:12:36,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11675 conditions, 4357 events. 2506/4357 cut-off events. For 5433/5433 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 23590 event pairs, 437 based on Foata normal form. 220/4246 useless extension candidates. Maximal degree in co-relation 7042. Up to 2213 conditions per place. [2025-01-10 01:12:36,389 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 75 selfloop transitions, 4 changer transitions 3/84 dead transitions. [2025-01-10 01:12:36,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 707 flow [2025-01-10 01:12:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-01-10 01:12:36,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2025-01-10 01:12:36,391 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 350 flow. Second operand 4 states and 76 transitions. [2025-01-10 01:12:36,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 707 flow [2025-01-10 01:12:36,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 669 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-01-10 01:12:36,395 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 351 flow [2025-01-10 01:12:36,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-01-10 01:12:36,396 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2025-01-10 01:12:36,397 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 351 flow [2025-01-10 01:12:36,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:36,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:36,397 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:36,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:12:36,397 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:36,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:36,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1226706085, now seen corresponding path program 1 times [2025-01-10 01:12:36,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:36,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513361179] [2025-01-10 01:12:36,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:36,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:36,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:12:36,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:12:36,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:36,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513361179] [2025-01-10 01:12:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513361179] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376063084] [2025-01-10 01:12:37,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:37,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:37,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:37,080 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:12:37,081 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:12:37,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:12:37,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:12:37,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:37,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:37,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:12:37,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:37,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:12:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:37,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:37,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2025-01-10 01:12:37,985 INFO L349 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2025-01-10 01:12:37,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 237 treesize of output 198 [2025-01-10 01:12:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:38,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376063084] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:38,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:38,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-01-10 01:12:38,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124864150] [2025-01-10 01:12:38,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:38,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 01:12:38,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:38,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 01:12:38,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2025-01-10 01:12:38,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:38,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 351 flow. Second operand has 29 states, 29 states have (on average 13.0) internal successors, (377), 29 states have internal predecessors, (377), 0 states have call successors, (0), 0 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:12:38,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:38,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:38,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:42,268 INFO L124 PetriNetUnfolderBase]: 7874/15143 cut-off events. [2025-01-10 01:12:42,268 INFO L125 PetriNetUnfolderBase]: For 21465/21469 co-relation queries the response was YES. [2025-01-10 01:12:42,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41764 conditions, 15143 events. 7874/15143 cut-off events. For 21465/21469 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 114299 event pairs, 1306 based on Foata normal form. 44/14169 useless extension candidates. Maximal degree in co-relation 25196. Up to 2510 conditions per place. [2025-01-10 01:12:42,323 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 407 selfloop transitions, 140 changer transitions 127/681 dead transitions. [2025-01-10 01:12:42,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 681 transitions, 4280 flow [2025-01-10 01:12:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-01-10 01:12:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-01-10 01:12:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 1178 transitions. [2025-01-10 01:12:42,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4980972515856237 [2025-01-10 01:12:42,330 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 351 flow. Second operand 55 states and 1178 transitions. [2025-01-10 01:12:42,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 681 transitions, 4280 flow [2025-01-10 01:12:42,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 681 transitions, 4272 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:42,345 INFO L231 Difference]: Finished difference. Result has 139 places, 203 transitions, 2214 flow [2025-01-10 01:12:42,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=2214, PETRI_PLACES=139, PETRI_TRANSITIONS=203} [2025-01-10 01:12:42,345 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places. [2025-01-10 01:12:42,345 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 203 transitions, 2214 flow [2025-01-10 01:12:42,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 13.0) internal successors, (377), 29 states have internal predecessors, (377), 0 states have call successors, (0), 0 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:12:42,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:42,346 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:42,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:12:42,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:42,550 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:42,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:42,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1646870013, now seen corresponding path program 2 times [2025-01-10 01:12:42,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:42,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69435199] [2025-01-10 01:12:42,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:42,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 01:12:42,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:12:42,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:42,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:43,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:43,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69435199] [2025-01-10 01:12:43,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69435199] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:43,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517438446] [2025-01-10 01:12:43,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:43,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:43,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:43,131 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:12:43,133 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:12:43,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 01:12:43,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:12:43,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:43,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:43,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 01:12:43,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:43,554 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-01-10 01:12:43,554 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 47 treesize of output 20 [2025-01-10 01:12:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:43,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:43,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:12:43,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 131 [2025-01-10 01:12:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:45,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517438446] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:45,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:45,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-01-10 01:12:45,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524399122] [2025-01-10 01:12:45,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:45,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:12:45,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:45,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:12:45,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:12:45,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:45,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 203 transitions, 2214 flow. Second operand has 28 states, 28 states have (on average 13.214285714285714) internal successors, (370), 28 states have internal predecessors, (370), 0 states have call successors, (0), 0 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:12:45,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:45,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:45,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:48,192 INFO L124 PetriNetUnfolderBase]: 10222/19814 cut-off events. [2025-01-10 01:12:48,193 INFO L125 PetriNetUnfolderBase]: For 140865/140865 co-relation queries the response was YES. [2025-01-10 01:12:48,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69382 conditions, 19814 events. 10222/19814 cut-off events. For 140865/140865 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 155568 event pairs, 4227 based on Foata normal form. 281/18744 useless extension candidates. Maximal degree in co-relation 66786. Up to 6896 conditions per place. [2025-01-10 01:12:48,370 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 191 selfloop transitions, 53 changer transitions 185/436 dead transitions. [2025-01-10 01:12:48,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 436 transitions, 4315 flow [2025-01-10 01:12:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:12:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-10 01:12:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 484 transitions. [2025-01-10 01:12:48,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4689922480620155 [2025-01-10 01:12:48,373 INFO L175 Difference]: Start difference. First operand has 139 places, 203 transitions, 2214 flow. Second operand 24 states and 484 transitions. [2025-01-10 01:12:48,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 436 transitions, 4315 flow [2025-01-10 01:12:48,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 436 transitions, 3618 flow, removed 343 selfloop flow, removed 4 redundant places. [2025-01-10 01:12:48,554 INFO L231 Difference]: Finished difference. Result has 167 places, 187 transitions, 1916 flow [2025-01-10 01:12:48,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1916, PETRI_PLACES=167, PETRI_TRANSITIONS=187} [2025-01-10 01:12:48,555 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 126 predicate places. [2025-01-10 01:12:48,555 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 187 transitions, 1916 flow [2025-01-10 01:12:48,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.214285714285714) internal successors, (370), 28 states have internal predecessors, (370), 0 states have call successors, (0), 0 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:12:48,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:48,555 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:48,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:12:48,756 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,SelfDestructingSolverStorable15 [2025-01-10 01:12:48,756 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:48,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1864344934, now seen corresponding path program 3 times [2025-01-10 01:12:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527478305] [2025-01-10 01:12:48,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:48,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 4 equivalence classes. [2025-01-10 01:12:48,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 40 statements. [2025-01-10 01:12:48,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:12:48,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:12:49,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:49,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527478305] [2025-01-10 01:12:49,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527478305] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:49,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040970328] [2025-01-10 01:12:49,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:49,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:49,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:49,004 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:12:49,007 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:12:49,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 4 equivalence classes. [2025-01-10 01:12:49,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 40 statements. [2025-01-10 01:12:49,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:12:49,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:49,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:12:49,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:12:49,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:49,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:12:49,350 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 75 treesize of output 60 [2025-01-10 01:12:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:12:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040970328] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:49,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:49,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-01-10 01:12:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813600764] [2025-01-10 01:12:49,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:49,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:12:49,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:49,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:12:49,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:12:49,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:49,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 187 transitions, 1916 flow. Second operand has 16 states, 16 states have (on average 15.0625) internal successors, (241), 16 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:49,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:49,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:49,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:51,134 INFO L124 PetriNetUnfolderBase]: 8823/16912 cut-off events. [2025-01-10 01:12:51,134 INFO L125 PetriNetUnfolderBase]: For 190416/190416 co-relation queries the response was YES. [2025-01-10 01:12:51,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64290 conditions, 16912 events. 8823/16912 cut-off events. For 190416/190416 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 126622 event pairs, 3042 based on Foata normal form. 2/15775 useless extension candidates. Maximal degree in co-relation 62625. Up to 8361 conditions per place. [2025-01-10 01:12:51,228 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 213 selfloop transitions, 49 changer transitions 38/307 dead transitions. [2025-01-10 01:12:51,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 307 transitions, 3376 flow [2025-01-10 01:12:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:12:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:12:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2025-01-10 01:12:51,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2025-01-10 01:12:51,230 INFO L175 Difference]: Start difference. First operand has 167 places, 187 transitions, 1916 flow. Second operand 10 states and 230 transitions. [2025-01-10 01:12:51,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 307 transitions, 3376 flow [2025-01-10 01:12:51,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 307 transitions, 3029 flow, removed 139 selfloop flow, removed 17 redundant places. [2025-01-10 01:12:51,562 INFO L231 Difference]: Finished difference. Result has 144 places, 200 transitions, 2000 flow [2025-01-10 01:12:51,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1678, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2000, PETRI_PLACES=144, PETRI_TRANSITIONS=200} [2025-01-10 01:12:51,563 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 103 predicate places. [2025-01-10 01:12:51,563 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 200 transitions, 2000 flow [2025-01-10 01:12:51,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.0625) internal successors, (241), 16 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:51,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:51,564 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:51,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:12:51,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:51,768 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:51,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash 759668232, now seen corresponding path program 4 times [2025-01-10 01:12:51,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:51,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83585638] [2025-01-10 01:12:51,769 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:12:51,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:51,774 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-01-10 01:12:51,789 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:12:51,789 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:12:51,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:12:51,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:51,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83585638] [2025-01-10 01:12:51,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83585638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:51,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038442321] [2025-01-10 01:12:51,918 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:12:51,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:51,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:51,920 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:12:51,922 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:12:51,958 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-01-10 01:12:51,977 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:12:51,977 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:12:51,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:51,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:12:51,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:12:52,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:52,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:12:52,241 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 75 treesize of output 60 [2025-01-10 01:12:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:12:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038442321] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:52,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:52,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 16 [2025-01-10 01:12:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426380665] [2025-01-10 01:12:52,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:52,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:12:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:52,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:12:52,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:12:52,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:52,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 200 transitions, 2000 flow. Second operand has 17 states, 17 states have (on average 14.941176470588236) internal successors, (254), 17 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:12:52,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:52,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:52,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:54,267 INFO L124 PetriNetUnfolderBase]: 9453/18092 cut-off events. [2025-01-10 01:12:54,267 INFO L125 PetriNetUnfolderBase]: For 141193/141193 co-relation queries the response was YES. [2025-01-10 01:12:54,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64500 conditions, 18092 events. 9453/18092 cut-off events. For 141193/141193 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 136868 event pairs, 2803 based on Foata normal form. 4/16877 useless extension candidates. Maximal degree in co-relation 63056. Up to 7742 conditions per place. [2025-01-10 01:12:54,355 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 217 selfloop transitions, 60 changer transitions 42/326 dead transitions. [2025-01-10 01:12:54,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 326 transitions, 3391 flow [2025-01-10 01:12:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:12:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:12:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 277 transitions. [2025-01-10 01:12:54,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49552772808586765 [2025-01-10 01:12:54,356 INFO L175 Difference]: Start difference. First operand has 144 places, 200 transitions, 2000 flow. Second operand 13 states and 277 transitions. [2025-01-10 01:12:54,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 326 transitions, 3391 flow [2025-01-10 01:12:54,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 326 transitions, 3219 flow, removed 50 selfloop flow, removed 4 redundant places. [2025-01-10 01:12:54,481 INFO L231 Difference]: Finished difference. Result has 154 places, 206 transitions, 2083 flow [2025-01-10 01:12:54,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2083, PETRI_PLACES=154, PETRI_TRANSITIONS=206} [2025-01-10 01:12:54,481 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 113 predicate places. [2025-01-10 01:12:54,481 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 206 transitions, 2083 flow [2025-01-10 01:12:54,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.941176470588236) internal successors, (254), 17 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:12:54,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:54,482 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:54,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:12:54,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:12:54,682 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:54,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:54,683 INFO L85 PathProgramCache]: Analyzing trace with hash -740181014, now seen corresponding path program 5 times [2025-01-10 01:12:54,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:54,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582487546] [2025-01-10 01:12:54,683 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:12:54,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:54,689 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 4 equivalence classes. [2025-01-10 01:12:54,696 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:12:54,697 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:12:54,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:12:54,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582487546] [2025-01-10 01:12:54,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582487546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051222967] [2025-01-10 01:12:54,760 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:12:54,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:54,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:54,764 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:12:54,765 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:12:54,804 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 4 equivalence classes. [2025-01-10 01:12:54,828 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:12:54,828 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:12:54,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:54,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:12:54,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:12:54,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:12:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051222967] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:54,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-01-10 01:12:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463718644] [2025-01-10 01:12:54,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:54,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:12:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:54,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:12:54,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:12:54,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:12:54,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 206 transitions, 2083 flow. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:12:54,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:54,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:12:54,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:57,551 INFO L124 PetriNetUnfolderBase]: 13007/25081 cut-off events. [2025-01-10 01:12:57,551 INFO L125 PetriNetUnfolderBase]: For 198808/198808 co-relation queries the response was YES. [2025-01-10 01:12:57,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89331 conditions, 25081 events. 13007/25081 cut-off events. For 198808/198808 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 199656 event pairs, 3651 based on Foata normal form. 62/23472 useless extension candidates. Maximal degree in co-relation 85370. Up to 10576 conditions per place. [2025-01-10 01:12:57,708 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 187 selfloop transitions, 137 changer transitions 0/331 dead transitions. [2025-01-10 01:12:57,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 331 transitions, 3853 flow [2025-01-10 01:12:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:12:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:12:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-01-10 01:12:57,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5488372093023256 [2025-01-10 01:12:57,709 INFO L175 Difference]: Start difference. First operand has 154 places, 206 transitions, 2083 flow. Second operand 5 states and 118 transitions. [2025-01-10 01:12:57,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 331 transitions, 3853 flow [2025-01-10 01:12:57,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 331 transitions, 3626 flow, removed 53 selfloop flow, removed 13 redundant places. [2025-01-10 01:12:57,881 INFO L231 Difference]: Finished difference. Result has 148 places, 285 transitions, 3356 flow [2025-01-10 01:12:57,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3356, PETRI_PLACES=148, PETRI_TRANSITIONS=285} [2025-01-10 01:12:57,882 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 107 predicate places. [2025-01-10 01:12:57,882 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 285 transitions, 3356 flow [2025-01-10 01:12:57,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:12:57,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:57,882 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:57,887 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:12:58,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:58,082 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:12:58,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:58,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1851489210, now seen corresponding path program 6 times [2025-01-10 01:12:58,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:58,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175606286] [2025-01-10 01:12:58,083 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:12:58,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:58,088 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 5 equivalence classes. [2025-01-10 01:12:58,115 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:12:58,115 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-01-10 01:12:58,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:58,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:58,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175606286] [2025-01-10 01:12:58,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175606286] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:58,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973325697] [2025-01-10 01:12:58,909 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:12:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:58,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:58,910 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:12:58,911 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:12:58,945 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 5 equivalence classes. [2025-01-10 01:12:59,022 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:12:59,022 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-01-10 01:12:59,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:59,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-10 01:12:59,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:59,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:12:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:59,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:00,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 151 [2025-01-10 01:13:00,666 INFO L349 Elim1Store]: treesize reduction 42, result has 61.5 percent of original size [2025-01-10 01:13:00,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 544 treesize of output 432 [2025-01-10 01:13:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:02,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973325697] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:02,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:02,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2025-01-10 01:13:02,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884641668] [2025-01-10 01:13:02,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:02,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-10 01:13:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:02,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-10 01:13:02,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2025-01-10 01:13:02,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:13:02,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 285 transitions, 3356 flow. Second operand has 39 states, 39 states have (on average 12.846153846153847) internal successors, (501), 39 states have internal predecessors, (501), 0 states have call successors, (0), 0 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:13:02,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:02,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:13:02,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:12,778 INFO L124 PetriNetUnfolderBase]: 24284/46030 cut-off events. [2025-01-10 01:13:12,778 INFO L125 PetriNetUnfolderBase]: For 472567/472567 co-relation queries the response was YES. [2025-01-10 01:13:13,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179115 conditions, 46030 events. 24284/46030 cut-off events. For 472567/472567 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 399619 event pairs, 4424 based on Foata normal form. 371/43247 useless extension candidates. Maximal degree in co-relation 172303. Up to 7840 conditions per place. [2025-01-10 01:13:13,100 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 511 selfloop transitions, 463 changer transitions 214/1195 dead transitions. [2025-01-10 01:13:13,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1195 transitions, 13672 flow [2025-01-10 01:13:13,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-01-10 01:13:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2025-01-10 01:13:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 1520 transitions. [2025-01-10 01:13:13,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909560723514212 [2025-01-10 01:13:13,101 INFO L175 Difference]: Start difference. First operand has 148 places, 285 transitions, 3356 flow. Second operand 72 states and 1520 transitions. [2025-01-10 01:13:13,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 1195 transitions, 13672 flow [2025-01-10 01:13:13,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 1195 transitions, 12645 flow, removed 433 selfloop flow, removed 5 redundant places. [2025-01-10 01:13:13,599 INFO L231 Difference]: Finished difference. Result has 238 places, 604 transitions, 10318 flow [2025-01-10 01:13:13,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=10318, PETRI_PLACES=238, PETRI_TRANSITIONS=604} [2025-01-10 01:13:13,599 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 197 predicate places. [2025-01-10 01:13:13,599 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 604 transitions, 10318 flow [2025-01-10 01:13:13,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 12.846153846153847) internal successors, (501), 39 states have internal predecessors, (501), 0 states have call successors, (0), 0 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:13:13,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:13,600 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:13,605 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:13:13,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:13,800 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:13:13,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash -386229090, now seen corresponding path program 7 times [2025-01-10 01:13:13,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:13,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861526015] [2025-01-10 01:13:13,801 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:13:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:13,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:13:13,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:13:13,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:13,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861526015] [2025-01-10 01:13:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861526015] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110407896] [2025-01-10 01:13:14,557 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:13:14,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:14,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:14,558 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:13:14,559 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:13:14,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:13:14,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:13:14,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:14,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:14,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 01:13:14,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:13:15,210 INFO L349 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2025-01-10 01:13:15,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 24 [2025-01-10 01:13:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:15,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:16,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 151 [2025-01-10 01:13:16,276 INFO L349 Elim1Store]: treesize reduction 50, result has 54.1 percent of original size [2025-01-10 01:13:16,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 536 treesize of output 416 [2025-01-10 01:13:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:18,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110407896] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:18,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:18,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-01-10 01:13:18,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963475786] [2025-01-10 01:13:18,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:18,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-10 01:13:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:18,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-10 01:13:18,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2025-01-10 01:13:18,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-01-10 01:13:18,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 604 transitions, 10318 flow. Second operand has 40 states, 40 states have (on average 12.85) internal successors, (514), 40 states have internal predecessors, (514), 0 states have call successors, (0), 0 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:13:18,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:18,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-01-10 01:13:18,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:30,721 INFO L124 PetriNetUnfolderBase]: 29678/57555 cut-off events. [2025-01-10 01:13:30,721 INFO L125 PetriNetUnfolderBase]: For 670556/670556 co-relation queries the response was YES. [2025-01-10 01:13:31,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226441 conditions, 57555 events. 29678/57555 cut-off events. For 670556/670556 co-relation queries the response was YES. Maximal size of possible extension queue 895. Compared 517130 event pairs, 7325 based on Foata normal form. 1228/54791 useless extension candidates. Maximal degree in co-relation 224893. Up to 10992 conditions per place. [2025-01-10 01:13:31,238 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 462 selfloop transitions, 656 changer transitions 206/1331 dead transitions. [2025-01-10 01:13:31,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 1331 transitions, 23376 flow [2025-01-10 01:13:31,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-10 01:13:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-01-10 01:13:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 1048 transitions. [2025-01-10 01:13:31,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46869409660107336 [2025-01-10 01:13:31,240 INFO L175 Difference]: Start difference. First operand has 238 places, 604 transitions, 10318 flow. Second operand 52 states and 1048 transitions. [2025-01-10 01:13:31,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 1331 transitions, 23376 flow [2025-01-10 01:13:33,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1331 transitions, 14318 flow, removed 4210 selfloop flow, removed 21 redundant places. [2025-01-10 01:13:33,091 INFO L231 Difference]: Finished difference. Result has 288 places, 887 transitions, 12394 flow [2025-01-10 01:13:33,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5224, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=12394, PETRI_PLACES=288, PETRI_TRANSITIONS=887} [2025-01-10 01:13:33,091 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 247 predicate places. [2025-01-10 01:13:33,091 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 887 transitions, 12394 flow [2025-01-10 01:13:33,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 12.85) internal successors, (514), 40 states have internal predecessors, (514), 0 states have call successors, (0), 0 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:13:33,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:33,092 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:33,098 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:13:33,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:33,292 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:13:33,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1417874462, now seen corresponding path program 8 times [2025-01-10 01:13:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:33,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533263679] [2025-01-10 01:13:33,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:33,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:33,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 01:13:33,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:13:33,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:33,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:34,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:34,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533263679] [2025-01-10 01:13:34,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533263679] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:34,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325855041] [2025-01-10 01:13:34,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:34,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:34,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:34,106 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:13:34,108 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:13:34,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 01:13:34,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:13:34,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:34,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:34,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-10 01:13:34,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:34,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:13:34,781 INFO L349 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2025-01-10 01:13:34,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 24 [2025-01-10 01:13:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:34,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:37,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 182 [2025-01-10 01:13:37,537 INFO L349 Elim1Store]: treesize reduction 10, result has 95.5 percent of original size [2025-01-10 01:13:37,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 528 treesize of output 574