./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.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 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:10:59,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:10:59,902 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:10:59,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:10:59,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:10:59,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:10:59,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:10:59,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:10:59,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:10:59,931 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:10:59,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:10:59,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:10:59,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:10:59,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:10:59,933 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:10:59,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:10:59,933 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:10:59,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:10:59,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:10:59,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:10:59,933 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:10:59,933 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:10:59,934 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:10:59,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:10:59,934 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:10:59,934 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:10:59,934 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:10:59,934 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:10:59,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:10:59,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:10:59,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:10:59,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:10:59,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:10:59,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:59,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:10:59,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:10:59,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:10:59,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:10:59,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:59,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:10:59,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:10:59,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:10:59,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:10:59,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:10:59,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:10:59,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:10:59,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:10:59,936 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 -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2025-01-10 01:11:00,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:11:00,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:11:00,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:11:00,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:11:00,199 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:11:00,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-01-10 01:11:01,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abc3aae76/65a72996d9844a54949e4672696013ef/FLAGa398122d2 [2025-01-10 01:11:01,665 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:11:01,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-01-10 01:11:01,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abc3aae76/65a72996d9844a54949e4672696013ef/FLAGa398122d2 [2025-01-10 01:11:01,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abc3aae76/65a72996d9844a54949e4672696013ef [2025-01-10 01:11:01,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:11:01,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:11:01,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:11:01,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:11:01,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:11:01,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c913def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01, skipping insertion in model container [2025-01-10 01:11:01,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:11:01,830 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:11:01,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:11:01,841 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:11:01,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:11:01,877 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:11:01,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01 WrapperNode [2025-01-10 01:11:01,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:11:01,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:11:01,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:11:01,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:11:01,883 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:11:01" (1/1) ... [2025-01-10 01:11:01,888 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:11:01" (1/1) ... [2025-01-10 01:11:01,904 INFO L138 Inliner]: procedures = 24, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-01-10 01:11:01,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:11:01,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:11:01,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:11:01,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:11:01,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,926 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:11:01,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:11:01,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:11:01,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:11:01,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:11:01,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (1/1) ... [2025-01-10 01:11:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:11:01,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:01,965 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:11:01,970 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:11:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:11:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:11:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:11:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:11:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:11:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:11:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:11:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:11:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:11:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:11:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:11:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:11:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:11:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:11:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:11:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:11:01,985 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:11:02,077 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:11:02,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:11:02,274 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:11:02,274 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:11:02,411 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:11:02,412 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:11:02,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:11:02 BoogieIcfgContainer [2025-01-10 01:11:02,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:11:02,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:11:02,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:11:02,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:11:02,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:11:01" (1/3) ... [2025-01-10 01:11:02,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7883e0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:11:02, skipping insertion in model container [2025-01-10 01:11:02,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:01" (2/3) ... [2025-01-10 01:11:02,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7883e0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:11:02, skipping insertion in model container [2025-01-10 01:11:02,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:11:02" (3/3) ... [2025-01-10 01:11:02,419 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2025-01-10 01:11:02,428 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:11:02,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sum-array-hom.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-01-10 01:11:02,429 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:11:02,477 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:11:02,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 103 flow [2025-01-10 01:11:02,531 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-01-10 01:11:02,534 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:11:02,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 4/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-01-10 01:11:02,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 103 flow [2025-01-10 01:11:02,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 37 transitions, 92 flow [2025-01-10 01:11:02,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:11:02,557 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;@1cbc3bdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:11:02,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-10 01:11:02,560 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:11:02,561 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:11:02,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:11:02,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:02,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:11:02,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:02,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:02,566 INFO L85 PathProgramCache]: Analyzing trace with hash 380678, now seen corresponding path program 1 times [2025-01-10 01:11:02,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:02,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261189607] [2025-01-10 01:11:02,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:02,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:02,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:11:02,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:11:02,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:02,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:02,774 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:11:02,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:02,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261189607] [2025-01-10 01:11:02,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261189607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:02,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:02,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:11:02,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072519813] [2025-01-10 01:11:02,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:02,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:11:02,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:02,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:11:02,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:11:02,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:02,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:02,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:02,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:02,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:02,939 INFO L124 PetriNetUnfolderBase]: 200/339 cut-off events. [2025-01-10 01:11:02,939 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-10 01:11:02,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 339 events. 200/339 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1085 event pairs, 124 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 576. Up to 293 conditions per place. [2025-01-10 01:11:02,947 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 21 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2025-01-10 01:11:02,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 132 flow [2025-01-10 01:11:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:11:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:11:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-01-10 01:11:02,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2025-01-10 01:11:02,964 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 92 flow. Second operand 3 states and 70 transitions. [2025-01-10 01:11:02,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 132 flow [2025-01-10 01:11:02,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:02,968 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 78 flow [2025-01-10 01:11:02,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-01-10 01:11:02,971 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2025-01-10 01:11:02,972 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 78 flow [2025-01-10 01:11:02,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:02,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:02,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:11:02,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:11:02,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:02,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash 380679, now seen corresponding path program 1 times [2025-01-10 01:11:02,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:02,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068833806] [2025-01-10 01:11:02,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:02,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:02,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:11:02,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:11:02,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:02,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:03,204 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:11:03,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:03,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068833806] [2025-01-10 01:11:03,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068833806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:03,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:03,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:11:03,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159568099] [2025-01-10 01:11:03,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:03,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:03,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:03,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:03,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:03,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:03,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:03,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:03,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:03,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:03,333 INFO L124 PetriNetUnfolderBase]: 201/342 cut-off events. [2025-01-10 01:11:03,333 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:11:03,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 342 events. 201/342 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1093 event pairs, 124 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 638. Up to 298 conditions per place. [2025-01-10 01:11:03,336 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 23 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2025-01-10 01:11:03,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 140 flow [2025-01-10 01:11:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-01-10 01:11:03,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2025-01-10 01:11:03,337 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 78 flow. Second operand 4 states and 88 transitions. [2025-01-10 01:11:03,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 140 flow [2025-01-10 01:11:03,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:03,339 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 101 flow [2025-01-10 01:11:03,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-01-10 01:11:03,339 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-01-10 01:11:03,339 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 101 flow [2025-01-10 01:11:03,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:03,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:03,340 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:11:03,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:11:03,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:03,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 365844174, now seen corresponding path program 1 times [2025-01-10 01:11:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456671678] [2025-01-10 01:11:03,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:03,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:03,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:11:03,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:11:03,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:03,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:03,590 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:11:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:03,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456671678] [2025-01-10 01:11:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456671678] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534254562] [2025-01-10 01:11:03,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:03,597 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:11:03,599 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:11:03,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:11:03,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:11:03,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:03,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:03,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:11:03,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:03,705 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:11:03,888 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:11:03,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:04,001 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:11:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534254562] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:04,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:11:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24093527] [2025-01-10 01:11:04,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:04,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:04,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:04,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:04,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 101 flow. Second operand has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:04,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:04,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:04,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:04,252 INFO L124 PetriNetUnfolderBase]: 201/341 cut-off events. [2025-01-10 01:11:04,252 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:11:04,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 341 events. 201/341 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1100 event pairs, 124 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 645. Up to 294 conditions per place. [2025-01-10 01:11:04,257 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 19 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2025-01-10 01:11:04,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 149 flow [2025-01-10 01:11:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:11:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:11:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-01-10 01:11:04,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47560975609756095 [2025-01-10 01:11:04,259 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 101 flow. Second operand 6 states and 117 transitions. [2025-01-10 01:11:04,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 149 flow [2025-01-10 01:11:04,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:11:04,263 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 108 flow [2025-01-10 01:11:04,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-01-10 01:11:04,264 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2025-01-10 01:11:04,264 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 108 flow [2025-01-10 01:11:04,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:04,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:04,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:11:04,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:11:04,465 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:11:04,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:04,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1541531751, now seen corresponding path program 1 times [2025-01-10 01:11:04,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:04,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629537841] [2025-01-10 01:11:04,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:04,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:11:04,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:11:04,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:04,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:04,552 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:11:04,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:04,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629537841] [2025-01-10 01:11:04,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629537841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:04,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:04,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:11:04,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903536336] [2025-01-10 01:11:04,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:04,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:04,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:04,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:04,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:04,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-01-10 01:11:04,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:04,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:04,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-01-10 01:11:04,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:04,635 INFO L124 PetriNetUnfolderBase]: 201/327 cut-off events. [2025-01-10 01:11:04,636 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:11:04,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 327 events. 201/327 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 958 event pairs, 124 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 632. Up to 293 conditions per place. [2025-01-10 01:11:04,638 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-01-10 01:11:04,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 154 flow [2025-01-10 01:11:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-01-10 01:11:04,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2025-01-10 01:11:04,639 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 108 flow. Second operand 4 states and 74 transitions. [2025-01-10 01:11:04,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 154 flow [2025-01-10 01:11:04,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 124 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:04,640 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 78 flow [2025-01-10 01:11:04,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-01-10 01:11:04,640 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2025-01-10 01:11:04,640 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 78 flow [2025-01-10 01:11:04,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:04,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:04,640 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:11:04,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:11:04,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:04,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1541531750, now seen corresponding path program 1 times [2025-01-10 01:11:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:04,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631532765] [2025-01-10 01:11:04,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:04,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:04,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:11:04,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:11:04,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:04,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:04,692 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:11:04,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631532765] [2025-01-10 01:11:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631532765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:04,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:04,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:11:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484778562] [2025-01-10 01:11:04,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:04,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:04,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:04,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:04,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:04,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:04,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:04,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:04,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:04,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:04,840 INFO L124 PetriNetUnfolderBase]: 432/701 cut-off events. [2025-01-10 01:11:04,840 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:11:04,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 701 events. 432/701 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2584 event pairs, 248 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 805. Up to 381 conditions per place. [2025-01-10 01:11:04,844 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 51 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-01-10 01:11:04,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 62 transitions, 256 flow [2025-01-10 01:11:04,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-01-10 01:11:04,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6439024390243903 [2025-01-10 01:11:04,845 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 5 states and 132 transitions. [2025-01-10 01:11:04,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 62 transitions, 256 flow [2025-01-10 01:11:04,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:04,846 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 99 flow [2025-01-10 01:11:04,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-01-10 01:11:04,849 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-01-10 01:11:04,849 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 99 flow [2025-01-10 01:11:04,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:04,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:04,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:04,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:11:04,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:04,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:04,849 INFO L85 PathProgramCache]: Analyzing trace with hash 340249504, now seen corresponding path program 1 times [2025-01-10 01:11:04,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:04,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397572251] [2025-01-10 01:11:04,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:04,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:11:04,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:11:04,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:04,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:04,946 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:11:04,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:04,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397572251] [2025-01-10 01:11:04,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397572251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:04,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:04,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:11:04,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408213174] [2025-01-10 01:11:04,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:04,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:04,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:04,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:04,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:04,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:04,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:04,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:04,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:04,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:05,119 INFO L124 PetriNetUnfolderBase]: 409/674 cut-off events. [2025-01-10 01:11:05,120 INFO L125 PetriNetUnfolderBase]: For 222/253 co-relation queries the response was YES. [2025-01-10 01:11:05,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 674 events. 409/674 cut-off events. For 222/253 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2526 event pairs, 248 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 890. Up to 386 conditions per place. [2025-01-10 01:11:05,125 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 48 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-01-10 01:11:05,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 269 flow [2025-01-10 01:11:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-01-10 01:11:05,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6292682926829268 [2025-01-10 01:11:05,128 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 99 flow. Second operand 5 states and 129 transitions. [2025-01-10 01:11:05,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 269 flow [2025-01-10 01:11:05,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:05,131 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 119 flow [2025-01-10 01:11:05,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-01-10 01:11:05,132 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2025-01-10 01:11:05,133 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 119 flow [2025-01-10 01:11:05,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:05,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:05,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:05,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:11:05,133 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:05,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1760647565, now seen corresponding path program 1 times [2025-01-10 01:11:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:05,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994747217] [2025-01-10 01:11:05,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:05,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:11:05,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:11:05,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:05,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:05,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:05,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994747217] [2025-01-10 01:11:05,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994747217] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:05,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435199135] [2025-01-10 01:11:05,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:05,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:05,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:05,280 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:11:05,282 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:11:05,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:11:05,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:11:05,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:05,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:05,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:11:05,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:05,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:05,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-01-10 01:11:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:05,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435199135] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:05,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:05,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 01:11:05,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142946974] [2025-01-10 01:11:05,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:05,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:05,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:05,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:05,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:05,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:05,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 119 flow. Second operand has 11 states, 11 states have (on average 16.454545454545453) internal successors, (181), 11 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:05,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:05,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:05,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:05,906 INFO L124 PetriNetUnfolderBase]: 490/820 cut-off events. [2025-01-10 01:11:05,906 INFO L125 PetriNetUnfolderBase]: For 418/470 co-relation queries the response was YES. [2025-01-10 01:11:05,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2011 conditions, 820 events. 490/820 cut-off events. For 418/470 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3407 event pairs, 293 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 1271. Up to 403 conditions per place. [2025-01-10 01:11:05,911 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 50 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-01-10 01:11:05,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 299 flow [2025-01-10 01:11:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:11:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:11:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2025-01-10 01:11:05,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2025-01-10 01:11:05,912 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 119 flow. Second operand 6 states and 148 transitions. [2025-01-10 01:11:05,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 299 flow [2025-01-10 01:11:05,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:05,914 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 143 flow [2025-01-10 01:11:05,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2025-01-10 01:11:05,914 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-01-10 01:11:05,914 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 143 flow [2025-01-10 01:11:05,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.454545454545453) internal successors, (181), 11 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:05,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:05,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:05,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:11:06,115 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:11:06,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:06,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:06,116 INFO L85 PathProgramCache]: Analyzing trace with hash 554378094, now seen corresponding path program 1 times [2025-01-10 01:11:06,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:06,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024614098] [2025-01-10 01:11:06,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:06,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:06,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:11:06,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:11:06,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:06,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:06,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:06,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024614098] [2025-01-10 01:11:06,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024614098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:06,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:06,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:11:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450248478] [2025-01-10 01:11:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:06,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:06,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:06,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:06,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:06,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:06,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:06,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:06,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:06,313 INFO L124 PetriNetUnfolderBase]: 482/774 cut-off events. [2025-01-10 01:11:06,313 INFO L125 PetriNetUnfolderBase]: For 894/1065 co-relation queries the response was YES. [2025-01-10 01:11:06,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180 conditions, 774 events. 482/774 cut-off events. For 894/1065 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2955 event pairs, 306 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 1492. Up to 508 conditions per place. [2025-01-10 01:11:06,317 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 47 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-01-10 01:11:06,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 309 flow [2025-01-10 01:11:06,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-01-10 01:11:06,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6146341463414634 [2025-01-10 01:11:06,318 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 143 flow. Second operand 5 states and 126 transitions. [2025-01-10 01:11:06,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 309 flow [2025-01-10 01:11:06,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 295 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 01:11:06,320 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 156 flow [2025-01-10 01:11:06,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-01-10 01:11:06,320 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2025-01-10 01:11:06,320 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 156 flow [2025-01-10 01:11:06,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:06,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:06,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:06,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:11:06,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:06,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash 223348793, now seen corresponding path program 1 times [2025-01-10 01:11:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:06,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669009417] [2025-01-10 01:11:06,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:06,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:06,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:11:06,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:11:06,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:06,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:06,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669009417] [2025-01-10 01:11:06,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669009417] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546242235] [2025-01-10 01:11:06,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:06,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:06,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:06,424 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:11:06,426 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:11:06,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:11:06,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:11:06,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:06,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:06,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:11:06,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:06,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:06,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-01-10 01:11:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:06,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546242235] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:06,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:06,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 01:11:06,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006436689] [2025-01-10 01:11:06,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:06,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:06,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:06,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:06,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:06,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:06,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 156 flow. Second operand has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 11 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:06,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:06,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:06,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:06,980 INFO L124 PetriNetUnfolderBase]: 624/1022 cut-off events. [2025-01-10 01:11:06,981 INFO L125 PetriNetUnfolderBase]: For 999/1225 co-relation queries the response was YES. [2025-01-10 01:11:06,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2914 conditions, 1022 events. 624/1022 cut-off events. For 999/1225 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4431 event pairs, 358 based on Foata normal form. 0/980 useless extension candidates. Maximal degree in co-relation 2171. Up to 563 conditions per place. [2025-01-10 01:11:06,987 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 52 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-01-10 01:11:06,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 353 flow [2025-01-10 01:11:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:11:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:11:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-01-10 01:11:06,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2025-01-10 01:11:06,988 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 156 flow. Second operand 6 states and 146 transitions. [2025-01-10 01:11:06,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 353 flow [2025-01-10 01:11:06,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:06,990 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 180 flow [2025-01-10 01:11:06,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-01-10 01:11:06,991 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2025-01-10 01:11:06,991 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 180 flow [2025-01-10 01:11:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 11 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:06,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:06,991 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:07,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:11:07,199 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:11:07,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:07,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash 234817175, now seen corresponding path program 1 times [2025-01-10 01:11:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:07,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501329205] [2025-01-10 01:11:07,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:07,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:11:07,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:11:07,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:07,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:07,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:07,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501329205] [2025-01-10 01:11:07,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501329205] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:07,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931676439] [2025-01-10 01:11:07,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:07,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:07,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:07,303 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:11:07,307 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:11:07,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:11:07,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:11:07,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:07,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:07,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:11:07,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:07,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:07,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931676439] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:07,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:07,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:11:07,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115756527] [2025-01-10 01:11:07,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:07,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:11:07,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:07,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:11:07,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:11:07,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:07,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 180 flow. Second operand has 14 states, 14 states have (on average 16.714285714285715) internal successors, (234), 14 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:07,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:07,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:07,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:07,758 INFO L124 PetriNetUnfolderBase]: 1167/1870 cut-off events. [2025-01-10 01:11:07,759 INFO L125 PetriNetUnfolderBase]: For 2289/2586 co-relation queries the response was YES. [2025-01-10 01:11:07,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5856 conditions, 1870 events. 1167/1870 cut-off events. For 2289/2586 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8939 event pairs, 547 based on Foata normal form. 34/1900 useless extension candidates. Maximal degree in co-relation 3785. Up to 806 conditions per place. [2025-01-10 01:11:07,768 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 80 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2025-01-10 01:11:07,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 99 transitions, 594 flow [2025-01-10 01:11:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:11:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:11:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-01-10 01:11:07,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2025-01-10 01:11:07,771 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 180 flow. Second operand 8 states and 194 transitions. [2025-01-10 01:11:07,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 99 transitions, 594 flow [2025-01-10 01:11:07,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 99 transitions, 573 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 01:11:07,778 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 261 flow [2025-01-10 01:11:07,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=261, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-01-10 01:11:07,779 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2025-01-10 01:11:07,779 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 261 flow [2025-01-10 01:11:07,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.714285714285715) internal successors, (234), 14 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:07,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:07,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:07,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:11:07,984 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,SelfDestructingSolverStorable9 [2025-01-10 01:11:07,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:07,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash -118055481, now seen corresponding path program 1 times [2025-01-10 01:11:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:07,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068786820] [2025-01-10 01:11:07,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:07,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:11:07,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:11:07,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:07,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068786820] [2025-01-10 01:11:08,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068786820] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605219444] [2025-01-10 01:11:08,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:08,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:08,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:08,171 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:11:08,173 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:11:08,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:11:08,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:11:08,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:08,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:08,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:11:08,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:08,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:11:08,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605219444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:08,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:11:08,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2025-01-10 01:11:08,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629617344] [2025-01-10 01:11:08,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:08,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:08,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:08,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:11:08,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-01-10 01:11:08,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 261 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:08,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:08,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-01-10 01:11:08,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:08,647 INFO L124 PetriNetUnfolderBase]: 1113/1703 cut-off events. [2025-01-10 01:11:08,648 INFO L125 PetriNetUnfolderBase]: For 4271/4751 co-relation queries the response was YES. [2025-01-10 01:11:08,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6109 conditions, 1703 events. 1113/1703 cut-off events. For 4271/4751 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7669 event pairs, 409 based on Foata normal form. 0/1620 useless extension candidates. Maximal degree in co-relation 4228. Up to 896 conditions per place. [2025-01-10 01:11:08,657 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 72 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2025-01-10 01:11:08,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 87 transitions, 669 flow [2025-01-10 01:11:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:11:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:11:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-01-10 01:11:08,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.516260162601626 [2025-01-10 01:11:08,659 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 261 flow. Second operand 6 states and 127 transitions. [2025-01-10 01:11:08,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 87 transitions, 669 flow [2025-01-10 01:11:08,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 654 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 01:11:08,665 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 272 flow [2025-01-10 01:11:08,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2025-01-10 01:11:08,666 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-01-10 01:11:08,666 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 272 flow [2025-01-10 01:11:08,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:08,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:08,667 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:08,673 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:11:08,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:11:08,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:08,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash -110162019, now seen corresponding path program 1 times [2025-01-10 01:11:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:08,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598460159] [2025-01-10 01:11:08,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:08,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:11:08,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:11:08,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:08,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598460159] [2025-01-10 01:11:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598460159] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542229193] [2025-01-10 01:11:08,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:08,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:08,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:08,955 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:11:08,962 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:11:08,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:11:09,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:11:09,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:09,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:09,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:11:09,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:09,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:09,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542229193] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:09,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:09,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 01:11:09,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511652971] [2025-01-10 01:11:09,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:09,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:11:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:09,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:11:09,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:11:09,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:09,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 272 flow. Second operand has 15 states, 15 states have (on average 16.933333333333334) internal successors, (254), 15 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:11:09,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:09,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:09,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:09,524 INFO L124 PetriNetUnfolderBase]: 1136/1730 cut-off events. [2025-01-10 01:11:09,524 INFO L125 PetriNetUnfolderBase]: For 4455/4963 co-relation queries the response was YES. [2025-01-10 01:11:09,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6456 conditions, 1730 events. 1136/1730 cut-off events. For 4455/4963 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7465 event pairs, 544 based on Foata normal form. 35/1762 useless extension candidates. Maximal degree in co-relation 4579. Up to 816 conditions per place. [2025-01-10 01:11:09,536 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 75 selfloop transitions, 13 changer transitions 0/93 dead transitions. [2025-01-10 01:11:09,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 673 flow [2025-01-10 01:11:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:11:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:11:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2025-01-10 01:11:09,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-01-10 01:11:09,538 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 272 flow. Second operand 8 states and 192 transitions. [2025-01-10 01:11:09,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 673 flow [2025-01-10 01:11:09,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 631 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:09,543 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 325 flow [2025-01-10 01:11:09,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=325, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2025-01-10 01:11:09,543 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2025-01-10 01:11:09,544 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 325 flow [2025-01-10 01:11:09,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.933333333333334) internal successors, (254), 15 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:11:09,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:09,544 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:09,552 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:11:09,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:11:09,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:09,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash -437616400, now seen corresponding path program 2 times [2025-01-10 01:11:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122033020] [2025-01-10 01:11:09,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:09,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:11:09,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:11:09,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:09,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122033020] [2025-01-10 01:11:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122033020] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726597701] [2025-01-10 01:11:09,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:09,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:09,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:09,930 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:11:09,931 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:11:09,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:11:09,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:11:09,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:09,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:09,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:11:09,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:09,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:11:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:10,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:10,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726597701] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:10,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:10,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-01-10 01:11:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044599922] [2025-01-10 01:11:10,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:10,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:11:10,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:10,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:11:10,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:11:10,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 01:11:10,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 325 flow. Second operand has 20 states, 20 states have (on average 14.75) internal successors, (295), 20 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:10,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:10,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 01:11:10,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:11,444 INFO L124 PetriNetUnfolderBase]: 1330/1986 cut-off events. [2025-01-10 01:11:11,445 INFO L125 PetriNetUnfolderBase]: For 5037/5447 co-relation queries the response was YES. [2025-01-10 01:11:11,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7694 conditions, 1986 events. 1330/1986 cut-off events. For 5037/5447 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8700 event pairs, 296 based on Foata normal form. 0/1982 useless extension candidates. Maximal degree in co-relation 5228. Up to 416 conditions per place. [2025-01-10 01:11:11,456 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 137 selfloop transitions, 21 changer transitions 0/162 dead transitions. [2025-01-10 01:11:11,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 162 transitions, 1144 flow [2025-01-10 01:11:11,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:11:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:11:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 318 transitions. [2025-01-10 01:11:11,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.554006968641115 [2025-01-10 01:11:11,458 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 325 flow. Second operand 14 states and 318 transitions. [2025-01-10 01:11:11,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 162 transitions, 1144 flow [2025-01-10 01:11:11,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 162 transitions, 1116 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-01-10 01:11:11,463 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 384 flow [2025-01-10 01:11:11,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=384, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2025-01-10 01:11:11,464 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2025-01-10 01:11:11,464 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 384 flow [2025-01-10 01:11:11,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.75) internal successors, (295), 20 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:11,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:11,464 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:11,471 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:11:11,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:11,669 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:11,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2073733194, now seen corresponding path program 2 times [2025-01-10 01:11:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:11,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792861890] [2025-01-10 01:11:11,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:11,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 01:11:11,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:11:11,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:11,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792861890] [2025-01-10 01:11:11,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792861890] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972576939] [2025-01-10 01:11:11,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:11,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:11,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:11,798 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:11:11,800 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:11:11,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 01:11:11,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:11:11,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:11,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:11,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:11:11,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:11,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:12,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:11:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972576939] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:12,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:12,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-01-10 01:11:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482643965] [2025-01-10 01:11:12,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:12,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:11:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:12,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:11:12,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:11:12,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-01-10 01:11:12,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 56 transitions, 384 flow. Second operand has 20 states, 20 states have (on average 16.05) internal successors, (321), 20 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:12,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:12,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-01-10 01:11:12,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:13,160 INFO L124 PetriNetUnfolderBase]: 1587/2284 cut-off events. [2025-01-10 01:11:13,160 INFO L125 PetriNetUnfolderBase]: For 8999/9593 co-relation queries the response was YES. [2025-01-10 01:11:13,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9532 conditions, 2284 events. 1587/2284 cut-off events. For 8999/9593 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9538 event pairs, 312 based on Foata normal form. 0/2278 useless extension candidates. Maximal degree in co-relation 6555. Up to 481 conditions per place. [2025-01-10 01:11:13,172 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 140 selfloop transitions, 21 changer transitions 0/166 dead transitions. [2025-01-10 01:11:13,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 166 transitions, 1335 flow [2025-01-10 01:11:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:11:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:11:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 325 transitions. [2025-01-10 01:11:13,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5662020905923345 [2025-01-10 01:11:13,174 INFO L175 Difference]: Start difference. First operand has 79 places, 56 transitions, 384 flow. Second operand 14 states and 325 transitions. [2025-01-10 01:11:13,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 166 transitions, 1335 flow [2025-01-10 01:11:13,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 166 transitions, 1124 flow, removed 49 selfloop flow, removed 10 redundant places. [2025-01-10 01:11:13,182 INFO L231 Difference]: Finished difference. Result has 83 places, 59 transitions, 391 flow [2025-01-10 01:11:13,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=391, PETRI_PLACES=83, PETRI_TRANSITIONS=59} [2025-01-10 01:11:13,182 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2025-01-10 01:11:13,182 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 59 transitions, 391 flow [2025-01-10 01:11:13,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.05) internal successors, (321), 20 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:13,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:13,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:13,191 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:11:13,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:13,383 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:13,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:13,384 INFO L85 PathProgramCache]: Analyzing trace with hash 301961161, now seen corresponding path program 1 times [2025-01-10 01:11:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:13,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-01-10 01:11:13,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:13,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:11:13,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:11:13,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:13,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:13,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:13,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-01-10 01:11:13,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724961754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:13,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:13,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:11:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534736219] [2025-01-10 01:11:13,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:13,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:11:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:13,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:11:13,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:11:13,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2025-01-10 01:11:13,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 59 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:13,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:13,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2025-01-10 01:11:13,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:13,711 INFO L124 PetriNetUnfolderBase]: 1434/2297 cut-off events. [2025-01-10 01:11:13,712 INFO L125 PetriNetUnfolderBase]: For 8121/8471 co-relation queries the response was YES. [2025-01-10 01:11:13,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9387 conditions, 2297 events. 1434/2297 cut-off events. For 8121/8471 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11067 event pairs, 388 based on Foata normal form. 3/2281 useless extension candidates. Maximal degree in co-relation 6861. Up to 1405 conditions per place. [2025-01-10 01:11:13,725 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 60 selfloop transitions, 6 changer transitions 8/82 dead transitions. [2025-01-10 01:11:13,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 679 flow [2025-01-10 01:11:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:11:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:11:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-01-10 01:11:13,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7235772357723578 [2025-01-10 01:11:13,726 INFO L175 Difference]: Start difference. First operand has 83 places, 59 transitions, 391 flow. Second operand 3 states and 89 transitions. [2025-01-10 01:11:13,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 679 flow [2025-01-10 01:11:13,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 82 transitions, 591 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-01-10 01:11:13,735 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 331 flow [2025-01-10 01:11:13,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2025-01-10 01:11:13,735 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2025-01-10 01:11:13,736 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 331 flow [2025-01-10 01:11:13,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:13,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:13,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:13,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:11:13,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:13,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:13,737 INFO L85 PathProgramCache]: Analyzing trace with hash -948450798, now seen corresponding path program 1 times [2025-01-10 01:11:13,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:13,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011350651] [2025-01-10 01:11:13,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:13,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:13,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:13,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:13,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:13,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:13,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:13,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011350651] [2025-01-10 01:11:13,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011350651] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:13,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580884028] [2025-01-10 01:11:13,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:13,814 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:11:13,815 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:11:13,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:13,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:13,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:13,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:13,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:11:13,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:13,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:13,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580884028] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:13,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:13,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-01-10 01:11:13,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843681042] [2025-01-10 01:11:13,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:13,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:13,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:13,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:13,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:13,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:13,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:13,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:13,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:14,077 INFO L124 PetriNetUnfolderBase]: 1581/2356 cut-off events. [2025-01-10 01:11:14,077 INFO L125 PetriNetUnfolderBase]: For 5972/6272 co-relation queries the response was YES. [2025-01-10 01:11:14,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8768 conditions, 2356 events. 1581/2356 cut-off events. For 5972/6272 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10970 event pairs, 525 based on Foata normal form. 108/2391 useless extension candidates. Maximal degree in co-relation 5874. Up to 1179 conditions per place. [2025-01-10 01:11:14,089 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 61 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2025-01-10 01:11:14,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 593 flow [2025-01-10 01:11:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-01-10 01:11:14,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2025-01-10 01:11:14,090 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 331 flow. Second operand 5 states and 113 transitions. [2025-01-10 01:11:14,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 593 flow [2025-01-10 01:11:14,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 78 transitions, 500 flow, removed 18 selfloop flow, removed 9 redundant places. [2025-01-10 01:11:14,100 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 297 flow [2025-01-10 01:11:14,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-01-10 01:11:14,102 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2025-01-10 01:11:14,102 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 297 flow [2025-01-10 01:11:14,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:14,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:14,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:14,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:14,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:14,303 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:14,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash -879416454, now seen corresponding path program 1 times [2025-01-10 01:11:14,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:14,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095813900] [2025-01-10 01:11:14,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:14,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:14,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:14,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:14,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:14,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:14,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:14,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095813900] [2025-01-10 01:11:14,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095813900] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:14,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435325361] [2025-01-10 01:11:14,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:14,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:14,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:14,392 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:11:14,396 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:11:14,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:14,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:14,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:14,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:14,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:11:14,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:14,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435325361] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:14,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:14,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 14 [2025-01-10 01:11:14,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539157301] [2025-01-10 01:11:14,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:14,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:14,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:14,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:14,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:11:14,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-01-10 01:11:14,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:14,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:14,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-01-10 01:11:14,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:14,899 INFO L124 PetriNetUnfolderBase]: 2124/3057 cut-off events. [2025-01-10 01:11:14,899 INFO L125 PetriNetUnfolderBase]: For 7135/7427 co-relation queries the response was YES. [2025-01-10 01:11:14,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10092 conditions, 3057 events. 2124/3057 cut-off events. For 7135/7427 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14301 event pairs, 589 based on Foata normal form. 0/2754 useless extension candidates. Maximal degree in co-relation 6787. Up to 1365 conditions per place. [2025-01-10 01:11:14,908 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 126 selfloop transitions, 28 changer transitions 0/159 dead transitions. [2025-01-10 01:11:14,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 159 transitions, 1213 flow [2025-01-10 01:11:14,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:11:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:11:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2025-01-10 01:11:14,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5582655826558266 [2025-01-10 01:11:14,909 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 297 flow. Second operand 9 states and 206 transitions. [2025-01-10 01:11:14,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 159 transitions, 1213 flow [2025-01-10 01:11:14,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 159 transitions, 1154 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:14,915 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 420 flow [2025-01-10 01:11:14,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=420, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2025-01-10 01:11:14,915 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2025-01-10 01:11:14,915 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 420 flow [2025-01-10 01:11:14,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:14,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:14,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:14,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:11:15,116 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,SelfDestructingSolverStorable16 [2025-01-10 01:11:15,116 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:15,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -351056424, now seen corresponding path program 2 times [2025-01-10 01:11:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438685752] [2025-01-10 01:11:15,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:15,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:11:15,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:15,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:15,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:15,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:15,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438685752] [2025-01-10 01:11:15,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438685752] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:15,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38459071] [2025-01-10 01:11:15,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:15,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:15,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:15,170 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:11:15,172 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:11:15,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:11:15,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:15,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:15,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:15,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:11:15,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:15,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:15,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38459071] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:15,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:15,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 12 [2025-01-10 01:11:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878699227] [2025-01-10 01:11:15,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:15,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:15,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:15,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:11:15,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-01-10 01:11:15,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 420 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:15,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:15,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-01-10 01:11:15,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:15,649 INFO L124 PetriNetUnfolderBase]: 2767/3982 cut-off events. [2025-01-10 01:11:15,650 INFO L125 PetriNetUnfolderBase]: For 9033/9423 co-relation queries the response was YES. [2025-01-10 01:11:15,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14263 conditions, 3982 events. 2767/3982 cut-off events. For 9033/9423 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 19306 event pairs, 641 based on Foata normal form. 20/3920 useless extension candidates. Maximal degree in co-relation 11539. Up to 1452 conditions per place. [2025-01-10 01:11:15,662 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 131 selfloop transitions, 54 changer transitions 0/190 dead transitions. [2025-01-10 01:11:15,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 190 transitions, 1496 flow [2025-01-10 01:11:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:11:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:11:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2025-01-10 01:11:15,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5447154471544715 [2025-01-10 01:11:15,663 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 420 flow. Second operand 9 states and 201 transitions. [2025-01-10 01:11:15,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 190 transitions, 1496 flow [2025-01-10 01:11:15,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 190 transitions, 1493 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:15,675 INFO L231 Difference]: Finished difference. Result has 85 places, 105 transitions, 858 flow [2025-01-10 01:11:15,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=858, PETRI_PLACES=85, PETRI_TRANSITIONS=105} [2025-01-10 01:11:15,675 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2025-01-10 01:11:15,675 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 105 transitions, 858 flow [2025-01-10 01:11:15,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:15,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:15,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:15,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:15,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:11:15,880 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:15,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1351148806, now seen corresponding path program 3 times [2025-01-10 01:11:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:15,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223930966] [2025-01-10 01:11:15,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:15,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:11:15,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 23 statements. [2025-01-10 01:11:15,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:15,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223930966] [2025-01-10 01:11:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223930966] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698531406] [2025-01-10 01:11:15,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:15,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:15,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:15,972 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:11:15,975 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:11:16,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:11:16,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 23 statements. [2025-01-10 01:11:16,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:16,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:16,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:11:16,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:16,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:16,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698531406] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:16,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:16,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-10 01:11:16,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636526696] [2025-01-10 01:11:16,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:16,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:16,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:16,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:16,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:16,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 01:11:16,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 105 transitions, 858 flow. Second operand has 11 states, 11 states have (on average 16.09090909090909) internal successors, (177), 11 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:16,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:16,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 01:11:16,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:17,250 INFO L124 PetriNetUnfolderBase]: 6414/9064 cut-off events. [2025-01-10 01:11:17,250 INFO L125 PetriNetUnfolderBase]: For 34414/34414 co-relation queries the response was YES. [2025-01-10 01:11:17,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41759 conditions, 9064 events. 6414/9064 cut-off events. For 34414/34414 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 45786 event pairs, 373 based on Foata normal form. 22/9086 useless extension candidates. Maximal degree in co-relation 33087. Up to 2594 conditions per place. [2025-01-10 01:11:17,289 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 352 selfloop transitions, 430 changer transitions 0/783 dead transitions. [2025-01-10 01:11:17,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 783 transitions, 8210 flow [2025-01-10 01:11:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 01:11:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-10 01:11:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 661 transitions. [2025-01-10 01:11:17,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5200629425649095 [2025-01-10 01:11:17,293 INFO L175 Difference]: Start difference. First operand has 85 places, 105 transitions, 858 flow. Second operand 31 states and 661 transitions. [2025-01-10 01:11:17,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 783 transitions, 8210 flow [2025-01-10 01:11:17,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 783 transitions, 8135 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:17,485 INFO L231 Difference]: Finished difference. Result has 137 places, 554 transitions, 6974 flow [2025-01-10 01:11:17,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=6974, PETRI_PLACES=137, PETRI_TRANSITIONS=554} [2025-01-10 01:11:17,486 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 94 predicate places. [2025-01-10 01:11:17,486 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 554 transitions, 6974 flow [2025-01-10 01:11:17,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.09090909090909) internal successors, (177), 11 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:17,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:17,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:17,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:17,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:17,687 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:17,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:17,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1837825580, now seen corresponding path program 4 times [2025-01-10 01:11:17,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:17,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087301111] [2025-01-10 01:11:17,688 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:17,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:17,693 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:11:17,695 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-01-10 01:11:17,696 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:11:17,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:17,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:17,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087301111] [2025-01-10 01:11:17,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087301111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:17,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:17,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:11:17,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43343860] [2025-01-10 01:11:17,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:17,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:17,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:17,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:11:17,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 01:11:17,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 554 transitions, 6974 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:17,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:17,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 01:11:17,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:18,847 INFO L124 PetriNetUnfolderBase]: 6998/9888 cut-off events. [2025-01-10 01:11:18,847 INFO L125 PetriNetUnfolderBase]: For 73195/73195 co-relation queries the response was YES. [2025-01-10 01:11:18,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57870 conditions, 9888 events. 6998/9888 cut-off events. For 73195/73195 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 50110 event pairs, 1736 based on Foata normal form. 4/9892 useless extension candidates. Maximal degree in co-relation 56364. Up to 5726 conditions per place. [2025-01-10 01:11:18,918 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 502 selfloop transitions, 283 changer transitions 3/789 dead transitions. [2025-01-10 01:11:18,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 789 transitions, 11105 flow [2025-01-10 01:11:18,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:11:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:11:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2025-01-10 01:11:18,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5749128919860628 [2025-01-10 01:11:18,919 INFO L175 Difference]: Start difference. First operand has 137 places, 554 transitions, 6974 flow. Second operand 7 states and 165 transitions. [2025-01-10 01:11:18,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 789 transitions, 11105 flow [2025-01-10 01:11:19,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 789 transitions, 10786 flow, removed 128 selfloop flow, removed 1 redundant places. [2025-01-10 01:11:19,564 INFO L231 Difference]: Finished difference. Result has 147 places, 626 transitions, 8705 flow [2025-01-10 01:11:19,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6753, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8705, PETRI_PLACES=147, PETRI_TRANSITIONS=626} [2025-01-10 01:11:19,565 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places. [2025-01-10 01:11:19,565 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 626 transitions, 8705 flow [2025-01-10 01:11:19,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:19,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:19,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:19,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:11:19,566 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:19,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1732226314, now seen corresponding path program 5 times [2025-01-10 01:11:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:19,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942802285] [2025-01-10 01:11:19,567 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:19,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:19,575 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:11:19,580 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:19,580 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:19,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942802285] [2025-01-10 01:11:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942802285] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463957828] [2025-01-10 01:11:19,642 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:19,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:19,645 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:11:19,647 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:11:19,684 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:11:19,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:19,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:19,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:19,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:11:19,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:19,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463957828] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:19,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-01-10 01:11:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777589470] [2025-01-10 01:11:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:19,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:19,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:19,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:19,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:11:19,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-01-10 01:11:19,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 626 transitions, 8705 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:19,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:19,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-01-10 01:11:19,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:21,044 INFO L124 PetriNetUnfolderBase]: 5744/8210 cut-off events. [2025-01-10 01:11:21,045 INFO L125 PetriNetUnfolderBase]: For 67421/67870 co-relation queries the response was YES. [2025-01-10 01:11:21,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50263 conditions, 8210 events. 5744/8210 cut-off events. For 67421/67870 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 43315 event pairs, 667 based on Foata normal form. 22/8220 useless extension candidates. Maximal degree in co-relation 49004. Up to 2710 conditions per place. [2025-01-10 01:11:21,104 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 419 selfloop transitions, 350 changer transitions 0/780 dead transitions. [2025-01-10 01:11:21,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 780 transitions, 11904 flow [2025-01-10 01:11:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:11:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:11:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2025-01-10 01:11:21,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5701219512195121 [2025-01-10 01:11:21,105 INFO L175 Difference]: Start difference. First operand has 147 places, 626 transitions, 8705 flow. Second operand 8 states and 187 transitions. [2025-01-10 01:11:21,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 780 transitions, 11904 flow [2025-01-10 01:11:21,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 780 transitions, 11592 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:21,543 INFO L231 Difference]: Finished difference. Result has 154 places, 682 transitions, 10488 flow [2025-01-10 01:11:21,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8431, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10488, PETRI_PLACES=154, PETRI_TRANSITIONS=682} [2025-01-10 01:11:21,544 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places. [2025-01-10 01:11:21,544 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 682 transitions, 10488 flow [2025-01-10 01:11:21,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:21,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:21,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:21,550 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:11:21,744 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:11:21,745 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:21,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash 516648824, now seen corresponding path program 6 times [2025-01-10 01:11:21,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:21,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410342983] [2025-01-10 01:11:21,746 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:11:21,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:21,750 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:11:21,753 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:21,753 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:11:21,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:21,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410342983] [2025-01-10 01:11:21,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410342983] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:21,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209054996] [2025-01-10 01:11:21,792 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:11:21,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:21,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:21,795 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:11:21,803 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:11:21,840 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:11:21,856 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:21,856 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:11:21,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:21,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:11:21,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:21,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:21,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209054996] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:21,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-01-10 01:11:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740023880] [2025-01-10 01:11:21,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:21,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:21,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:21,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:11:22,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-01-10 01:11:22,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 682 transitions, 10488 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:22,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:22,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-01-10 01:11:22,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:23,307 INFO L124 PetriNetUnfolderBase]: 6084/8710 cut-off events. [2025-01-10 01:11:23,308 INFO L125 PetriNetUnfolderBase]: For 84437/84844 co-relation queries the response was YES. [2025-01-10 01:11:23,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56340 conditions, 8710 events. 6084/8710 cut-off events. For 84437/84844 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 46249 event pairs, 770 based on Foata normal form. 40/8724 useless extension candidates. Maximal degree in co-relation 54984. Up to 3231 conditions per place. [2025-01-10 01:11:23,366 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 356 selfloop transitions, 511 changer transitions 0/878 dead transitions. [2025-01-10 01:11:23,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 878 transitions, 14286 flow [2025-01-10 01:11:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:11:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:11:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2025-01-10 01:11:23,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5826558265582655 [2025-01-10 01:11:23,371 INFO L175 Difference]: Start difference. First operand has 154 places, 682 transitions, 10488 flow. Second operand 9 states and 215 transitions. [2025-01-10 01:11:23,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 878 transitions, 14286 flow [2025-01-10 01:11:23,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 878 transitions, 13796 flow, removed 70 selfloop flow, removed 4 redundant places. [2025-01-10 01:11:23,924 INFO L231 Difference]: Finished difference. Result has 161 places, 745 transitions, 12628 flow [2025-01-10 01:11:23,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10015, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=444, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12628, PETRI_PLACES=161, PETRI_TRANSITIONS=745} [2025-01-10 01:11:23,925 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places. [2025-01-10 01:11:23,925 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 745 transitions, 12628 flow [2025-01-10 01:11:23,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:23,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:23,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:23,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:24,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-10 01:11:24,130 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:24,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:24,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1465761658, now seen corresponding path program 7 times [2025-01-10 01:11:24,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:24,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142155817] [2025-01-10 01:11:24,131 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:11:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:24,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:24,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:24,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:24,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:24,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:24,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142155817] [2025-01-10 01:11:24,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142155817] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:24,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528993355] [2025-01-10 01:11:24,216 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:11:24,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:24,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:24,220 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:24,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:11:24,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:24,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:24,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:24,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:24,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:11:24,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:24,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528993355] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:24,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:24,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-01-10 01:11:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831908620] [2025-01-10 01:11:24,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:24,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:24,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:24,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:24,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:11:24,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-01-10 01:11:24,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 745 transitions, 12628 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:24,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:24,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-01-10 01:11:24,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:25,775 INFO L124 PetriNetUnfolderBase]: 6062/8672 cut-off events. [2025-01-10 01:11:25,776 INFO L125 PetriNetUnfolderBase]: For 96736/97129 co-relation queries the response was YES. [2025-01-10 01:11:25,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57796 conditions, 8672 events. 6062/8672 cut-off events. For 96736/97129 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 45891 event pairs, 789 based on Foata normal form. 22/8664 useless extension candidates. Maximal degree in co-relation 57369. Up to 3118 conditions per place. [2025-01-10 01:11:25,856 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 255 selfloop transitions, 561 changer transitions 0/827 dead transitions. [2025-01-10 01:11:25,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 827 transitions, 14871 flow [2025-01-10 01:11:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:11:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:11:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2025-01-10 01:11:25,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2025-01-10 01:11:25,858 INFO L175 Difference]: Start difference. First operand has 161 places, 745 transitions, 12628 flow. Second operand 9 states and 210 transitions. [2025-01-10 01:11:25,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 827 transitions, 14871 flow [2025-01-10 01:11:26,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 827 transitions, 14667 flow, removed 92 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:26,738 INFO L231 Difference]: Finished difference. Result has 163 places, 748 transitions, 13573 flow [2025-01-10 01:11:26,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12417, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=557, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13573, PETRI_PLACES=163, PETRI_TRANSITIONS=748} [2025-01-10 01:11:26,739 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 120 predicate places. [2025-01-10 01:11:26,739 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 748 transitions, 13573 flow [2025-01-10 01:11:26,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:26,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:26,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:26,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 01:11:26,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:26,944 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:26,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash 249001030, now seen corresponding path program 8 times [2025-01-10 01:11:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:26,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86321855] [2025-01-10 01:11:26,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:26,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:11:26,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:26,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:26,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86321855] [2025-01-10 01:11:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86321855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:27,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:11:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269144330] [2025-01-10 01:11:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:27,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:27,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:27,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:27,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:11:27,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 01:11:27,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 748 transitions, 13573 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:27,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:27,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 01:11:27,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:28,732 INFO L124 PetriNetUnfolderBase]: 8599/12120 cut-off events. [2025-01-10 01:11:28,733 INFO L125 PetriNetUnfolderBase]: For 142868/142868 co-relation queries the response was YES. [2025-01-10 01:11:28,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85016 conditions, 12120 events. 8599/12120 cut-off events. For 142868/142868 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 62660 event pairs, 2157 based on Foata normal form. 4/12124 useless extension candidates. Maximal degree in co-relation 83521. Up to 7877 conditions per place. [2025-01-10 01:11:28,862 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 806 selfloop transitions, 235 changer transitions 5/1047 dead transitions. [2025-01-10 01:11:28,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1047 transitions, 19742 flow [2025-01-10 01:11:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:11:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:11:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-01-10 01:11:28,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5679442508710801 [2025-01-10 01:11:28,863 INFO L175 Difference]: Start difference. First operand has 163 places, 748 transitions, 13573 flow. Second operand 7 states and 163 transitions. [2025-01-10 01:11:28,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1047 transitions, 19742 flow [2025-01-10 01:11:30,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 1047 transitions, 19410 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:30,294 INFO L231 Difference]: Finished difference. Result has 171 places, 846 transitions, 16258 flow [2025-01-10 01:11:30,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13289, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=16258, PETRI_PLACES=171, PETRI_TRANSITIONS=846} [2025-01-10 01:11:30,295 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 128 predicate places. [2025-01-10 01:11:30,295 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 846 transitions, 16258 flow [2025-01-10 01:11:30,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:30,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:30,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:30,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 01:11:30,296 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:30,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:30,296 INFO L85 PathProgramCache]: Analyzing trace with hash -480157500, now seen corresponding path program 9 times [2025-01-10 01:11:30,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:30,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73071222] [2025-01-10 01:11:30,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:30,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:30,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:11:30,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-01-10 01:11:30,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:11:30,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:30,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73071222] [2025-01-10 01:11:30,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73071222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:30,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:30,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:11:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574455343] [2025-01-10 01:11:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:30,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:30,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:30,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:30,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:11:30,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 01:11:30,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 846 transitions, 16258 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:30,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:30,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 01:11:30,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:32,584 INFO L124 PetriNetUnfolderBase]: 10564/14798 cut-off events. [2025-01-10 01:11:32,589 INFO L125 PetriNetUnfolderBase]: For 177320/177320 co-relation queries the response was YES. [2025-01-10 01:11:32,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110218 conditions, 14798 events. 10564/14798 cut-off events. For 177320/177320 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 78363 event pairs, 696 based on Foata normal form. 20/14818 useless extension candidates. Maximal degree in co-relation 108283. Up to 4252 conditions per place. [2025-01-10 01:11:32,790 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 505 selfloop transitions, 816 changer transitions 0/1322 dead transitions. [2025-01-10 01:11:32,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 1322 transitions, 26338 flow [2025-01-10 01:11:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:11:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 01:11:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 458 transitions. [2025-01-10 01:11:32,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5319396051103368 [2025-01-10 01:11:32,793 INFO L175 Difference]: Start difference. First operand has 171 places, 846 transitions, 16258 flow. Second operand 21 states and 458 transitions. [2025-01-10 01:11:32,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 1322 transitions, 26338 flow [2025-01-10 01:11:35,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 1322 transitions, 25968 flow, removed 80 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:35,440 INFO L231 Difference]: Finished difference. Result has 202 places, 1133 transitions, 24390 flow [2025-01-10 01:11:35,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=16027, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=529, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=24390, PETRI_PLACES=202, PETRI_TRANSITIONS=1133} [2025-01-10 01:11:35,441 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places. [2025-01-10 01:11:35,441 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 1133 transitions, 24390 flow [2025-01-10 01:11:35,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:35,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:35,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:35,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:11:35,442 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:35,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:35,443 INFO L85 PathProgramCache]: Analyzing trace with hash 246375254, now seen corresponding path program 10 times [2025-01-10 01:11:35,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:35,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461534768] [2025-01-10 01:11:35,443 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:35,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:35,451 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:11:35,458 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-01-10 01:11:35,458 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:11:35,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:35,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:35,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461534768] [2025-01-10 01:11:35,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461534768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:35,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:35,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:11:35,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894331538] [2025-01-10 01:11:35,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:35,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:35,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:35,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:35,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:11:35,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 01:11:35,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 1133 transitions, 24390 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:35,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:35,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 01:11:35,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:38,612 INFO L124 PetriNetUnfolderBase]: 10649/14937 cut-off events. [2025-01-10 01:11:38,612 INFO L125 PetriNetUnfolderBase]: For 248163/248163 co-relation queries the response was YES. [2025-01-10 01:11:38,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121883 conditions, 14937 events. 10649/14937 cut-off events. For 248163/248163 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 78857 event pairs, 2230 based on Foata normal form. 8/14945 useless extension candidates. Maximal degree in co-relation 120745. Up to 8581 conditions per place. [2025-01-10 01:11:38,786 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 1028 selfloop transitions, 354 changer transitions 2/1385 dead transitions. [2025-01-10 01:11:38,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1385 transitions, 30675 flow [2025-01-10 01:11:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:11:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:11:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-01-10 01:11:38,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5679442508710801 [2025-01-10 01:11:38,788 INFO L175 Difference]: Start difference. First operand has 202 places, 1133 transitions, 24390 flow. Second operand 7 states and 163 transitions. [2025-01-10 01:11:38,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 1385 transitions, 30675 flow [2025-01-10 01:11:42,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 1385 transitions, 30045 flow, removed 308 selfloop flow, removed 1 redundant places. [2025-01-10 01:11:42,935 INFO L231 Difference]: Finished difference. Result has 210 places, 1154 transitions, 25103 flow [2025-01-10 01:11:42,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=23892, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=333, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=25103, PETRI_PLACES=210, PETRI_TRANSITIONS=1154} [2025-01-10 01:11:42,937 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places. [2025-01-10 01:11:42,937 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 1154 transitions, 25103 flow [2025-01-10 01:11:42,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:42,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:42,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:42,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:11:42,938 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:42,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1402871904, now seen corresponding path program 11 times [2025-01-10 01:11:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-01-10 01:11:42,938 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:42,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:11:42,958 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:42,958 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:42,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:43,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-01-10 01:11:43,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979352228] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053153281] [2025-01-10 01:11:43,111 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:43,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:43,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:43,118 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:43,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:11:43,161 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:11:43,177 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:43,177 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:43,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:11:43,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:43,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:43,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053153281] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:43,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:43,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-01-10 01:11:43,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506321187] [2025-01-10 01:11:43,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:43,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:43,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:43,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:11:43,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-01-10 01:11:43,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 1154 transitions, 25103 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:43,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:43,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-01-10 01:11:43,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:45,543 INFO L124 PetriNetUnfolderBase]: 8486/12035 cut-off events. [2025-01-10 01:11:45,544 INFO L125 PetriNetUnfolderBase]: For 204097/204912 co-relation queries the response was YES. [2025-01-10 01:11:45,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100656 conditions, 12035 events. 8486/12035 cut-off events. For 204097/204912 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 65573 event pairs, 557 based on Foata normal form. 50/12075 useless extension candidates. Maximal degree in co-relation 99325. Up to 2900 conditions per place. [2025-01-10 01:11:45,713 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 419 selfloop transitions, 798 changer transitions 0/1232 dead transitions. [2025-01-10 01:11:45,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1232 transitions, 28066 flow [2025-01-10 01:11:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:11:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:11:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2025-01-10 01:11:45,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-01-10 01:11:45,715 INFO L175 Difference]: Start difference. First operand has 210 places, 1154 transitions, 25103 flow. Second operand 8 states and 184 transitions. [2025-01-10 01:11:45,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1232 transitions, 28066 flow [2025-01-10 01:11:48,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 1232 transitions, 27376 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:48,470 INFO L231 Difference]: Finished difference. Result has 210 places, 1139 transitions, 25642 flow [2025-01-10 01:11:48,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=24046, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=798, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=25642, PETRI_PLACES=210, PETRI_TRANSITIONS=1139} [2025-01-10 01:11:48,471 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places. [2025-01-10 01:11:48,471 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 1139 transitions, 25642 flow [2025-01-10 01:11:48,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:48,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:48,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:48,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:48,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:48,672 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:48,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1352817942, now seen corresponding path program 1 times [2025-01-10 01:11:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:48,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632693049] [2025-01-10 01:11:48,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:48,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:48,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:11:48,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:11:48,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:48,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:49,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:49,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632693049] [2025-01-10 01:11:49,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632693049] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:49,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729027045] [2025-01-10 01:11:49,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:49,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:49,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:49,010 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:49,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:11:49,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:11:49,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:11:49,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:49,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:49,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 01:11:49,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:49,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:11:49,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:11:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:49,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:49,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729027045] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:49,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 25 [2025-01-10 01:11:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235400272] [2025-01-10 01:11:49,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:49,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:11:49,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:49,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:11:49,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:11:50,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:11:50,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 1139 transitions, 25642 flow. Second operand has 26 states, 26 states have (on average 17.53846153846154) internal successors, (456), 26 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:50,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:50,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:11:50,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:53,116 INFO L124 PetriNetUnfolderBase]: 9632/14267 cut-off events. [2025-01-10 01:11:53,116 INFO L125 PetriNetUnfolderBase]: For 299288/300431 co-relation queries the response was YES. [2025-01-10 01:11:53,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125541 conditions, 14267 events. 9632/14267 cut-off events. For 299288/300431 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 87337 event pairs, 486 based on Foata normal form. 400/14526 useless extension candidates. Maximal degree in co-relation 124035. Up to 9429 conditions per place. [2025-01-10 01:11:53,289 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 880 selfloop transitions, 712 changer transitions 1/1704 dead transitions. [2025-01-10 01:11:53,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1704 transitions, 40869 flow [2025-01-10 01:11:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:11:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:11:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 276 transitions. [2025-01-10 01:11:53,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-01-10 01:11:53,291 INFO L175 Difference]: Start difference. First operand has 210 places, 1139 transitions, 25642 flow. Second operand 12 states and 276 transitions. [2025-01-10 01:11:53,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 1704 transitions, 40869 flow [2025-01-10 01:11:56,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 1704 transitions, 40072 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:56,766 INFO L231 Difference]: Finished difference. Result has 222 places, 1527 transitions, 38109 flow [2025-01-10 01:11:56,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=25043, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=327, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=38109, PETRI_PLACES=222, PETRI_TRANSITIONS=1527} [2025-01-10 01:11:56,767 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 179 predicate places. [2025-01-10 01:11:56,767 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 1527 transitions, 38109 flow [2025-01-10 01:11:56,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 17.53846153846154) internal successors, (456), 26 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:56,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:56,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:56,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:56,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 01:11:56,968 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:11:56,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:56,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1987728812, now seen corresponding path program 2 times [2025-01-10 01:11:56,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:56,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982606795] [2025-01-10 01:11:56,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:56,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:11:56,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:11:56,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:56,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982606795] [2025-01-10 01:11:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982606795] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561370982] [2025-01-10 01:11:57,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:57,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:57,443 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:57,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 01:11:57,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:11:57,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:11:57,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:57,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:57,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:11:57,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:57,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:11:58,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:11:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:58,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:58,397 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 38 treesize of output 34 [2025-01-10 01:11:58,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:11:58,409 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 94 treesize of output 86 [2025-01-10 01:12:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:00,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561370982] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:00,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:00,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2025-01-10 01:12:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729068344] [2025-01-10 01:12:00,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:00,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 01:12:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:00,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 01:12:00,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-01-10 01:12:01,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-01-10 01:12:01,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1527 transitions, 38109 flow. Second operand has 27 states, 27 states have (on average 16.555555555555557) internal successors, (447), 27 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call 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:01,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:01,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-01-10 01:12:01,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:08,429 INFO L124 PetriNetUnfolderBase]: 15166/22038 cut-off events. [2025-01-10 01:12:08,429 INFO L125 PetriNetUnfolderBase]: For 503823/504563 co-relation queries the response was YES. [2025-01-10 01:12:08,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202755 conditions, 22038 events. 15166/22038 cut-off events. For 503823/504563 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 135670 event pairs, 1077 based on Foata normal form. 5/22031 useless extension candidates. Maximal degree in co-relation 200429. Up to 14861 conditions per place. [2025-01-10 01:12:08,796 INFO L140 encePairwiseOnDemand]: 25/41 looper letters, 1953 selfloop transitions, 1434 changer transitions 9/3411 dead transitions. [2025-01-10 01:12:08,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 3411 transitions, 87679 flow [2025-01-10 01:12:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-10 01:12:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-01-10 01:12:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 882 transitions. [2025-01-10 01:12:08,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551594746716698 [2025-01-10 01:12:08,798 INFO L175 Difference]: Start difference. First operand has 222 places, 1527 transitions, 38109 flow. Second operand 39 states and 882 transitions. [2025-01-10 01:12:08,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 3411 transitions, 87679 flow [2025-01-10 01:12:16,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 3411 transitions, 86596 flow, removed 309 selfloop flow, removed 3 redundant places. [2025-01-10 01:12:16,863 INFO L231 Difference]: Finished difference. Result has 284 places, 2746 transitions, 73687 flow [2025-01-10 01:12:16,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=37634, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=397, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=877, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=73687, PETRI_PLACES=284, PETRI_TRANSITIONS=2746} [2025-01-10 01:12:16,865 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 241 predicate places. [2025-01-10 01:12:16,865 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 2746 transitions, 73687 flow [2025-01-10 01:12:16,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.555555555555557) internal successors, (447), 27 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call 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:16,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:16,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:16,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 01:12:17,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 01:12:17,067 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:17,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2121825094, now seen corresponding path program 3 times [2025-01-10 01:12:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:17,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876434120] [2025-01-10 01:12:17,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:17,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:17,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-01-10 01:12:17,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 25 statements. [2025-01-10 01:12:17,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:12:17,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:17,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:17,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876434120] [2025-01-10 01:12:17,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876434120] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:17,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917707776] [2025-01-10 01:12:17,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:17,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:17,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:17,354 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:17,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 01:12:17,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-01-10 01:12:17,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 25 statements. [2025-01-10 01:12:17,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:12:17,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:17,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 01:12:17,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:17,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:12:17,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:12:17,595 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 17 treesize of output 15 [2025-01-10 01:12:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:17,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:17,886 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 38 treesize of output 34 [2025-01-10 01:12:17,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:12:17,901 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 94 treesize of output 86 [2025-01-10 01:12:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:18,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917707776] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:18,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:18,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2025-01-10 01:12:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732734828] [2025-01-10 01:12:18,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:18,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 01:12:18,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:18,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 01:12:18,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:12:18,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 01:12:18,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 2746 transitions, 73687 flow. Second operand has 25 states, 25 states have (on average 17.32) internal successors, (433), 25 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call 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:18,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:18,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 01:12:18,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:27,175 INFO L124 PetriNetUnfolderBase]: 15620/23099 cut-off events. [2025-01-10 01:12:27,176 INFO L125 PetriNetUnfolderBase]: For 630608/631884 co-relation queries the response was YES. [2025-01-10 01:12:27,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237053 conditions, 23099 events. 15620/23099 cut-off events. For 630608/631884 co-relation queries the response was YES. Maximal size of possible extension queue 1144. Compared 149422 event pairs, 626 based on Foata normal form. 186/23037 useless extension candidates. Maximal degree in co-relation 235979. Up to 13835 conditions per place. [2025-01-10 01:12:27,462 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 1370 selfloop transitions, 1775 changer transitions 1/3431 dead transitions. [2025-01-10 01:12:27,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 3431 transitions, 95165 flow [2025-01-10 01:12:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:12:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 01:12:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 407 transitions. [2025-01-10 01:12:27,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551490514905149 [2025-01-10 01:12:27,465 INFO L175 Difference]: Start difference. First operand has 284 places, 2746 transitions, 73687 flow. Second operand 18 states and 407 transitions. [2025-01-10 01:12:27,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 3431 transitions, 95165 flow