./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:07:18,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:07:18,635 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:07:18,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:07:18,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:07:18,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:07:18,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:07:18,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:07:18,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:07:18,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:07:18,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:07:18,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:07:18,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:07:18,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:07:18,656 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:07:18,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:07:18,657 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:07:18,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:07:18,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:07:18,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:07:18,657 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:07:18,657 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:07:18,657 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:07:18,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:07:18,657 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:07:18,658 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:07:18,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:07:18,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:07:18,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:07:18,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:07:18,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:07:18,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:07:18,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:07:18,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:18,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:07:18,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:07:18,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:07:18,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:07:18,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:18,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:07:18,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:07:18,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:07:18,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:07:18,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:07:18,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:07:18,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:07:18,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:07:18,659 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-01-10 01:07:18,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:07:18,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:07:18,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:07:18,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:07:18,873 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:07:18,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-01-10 01:07:20,084 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a288a165/b7608ac8ef8f4bdda2e55643eb91e3c4/FLAG8a6b2a7f7 [2025-01-10 01:07:20,404 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:07:20,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-01-10 01:07:20,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a288a165/b7608ac8ef8f4bdda2e55643eb91e3c4/FLAG8a6b2a7f7 [2025-01-10 01:07:20,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a288a165/b7608ac8ef8f4bdda2e55643eb91e3c4 [2025-01-10 01:07:20,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:07:20,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:07:20,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:07:20,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:07:20,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:07:20,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4218afdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20, skipping insertion in model container [2025-01-10 01:07:20,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:07:20,587 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:07:20,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:07:20,603 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:07:20,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:07:20,643 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:07:20,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20 WrapperNode [2025-01-10 01:07:20,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:07:20,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:07:20,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:07:20,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:07:20,650 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:07:20" (1/1) ... [2025-01-10 01:07:20,659 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:07:20" (1/1) ... [2025-01-10 01:07:20,682 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-01-10 01:07:20,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:07:20,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:07:20,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:07:20,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:07:20,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,703 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-10 01:07:20,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:07:20,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:07:20,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:07:20,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:07:20,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (1/1) ... [2025-01-10 01:07:20,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:20,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:20,752 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:07:20,758 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:07:20,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:07:20,773 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:07:20,773 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:07:20,773 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:07:20,774 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:07:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:07:20,774 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:07:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:07:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:07:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:07:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:07:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:07:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:07:20,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:07:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:07:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:07:20,775 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:07:20,850 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:07:20,852 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:07:21,240 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:07:21,240 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:07:21,566 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:07:21,566 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:07:21,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:21 BoogieIcfgContainer [2025-01-10 01:07:21,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:07:21,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:07:21,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:07:21,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:07:21,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:07:20" (1/3) ... [2025-01-10 01:07:21,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d980b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:21, skipping insertion in model container [2025-01-10 01:07:21,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:20" (2/3) ... [2025-01-10 01:07:21,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d980b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:21, skipping insertion in model container [2025-01-10 01:07:21,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:21" (3/3) ... [2025-01-10 01:07:21,575 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-01-10 01:07:21,586 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:07:21,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 55 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-01-10 01:07:21,588 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:07:21,645 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:07:21,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 60 transitions, 141 flow [2025-01-10 01:07:21,706 INFO L124 PetriNetUnfolderBase]: 6/57 cut-off events. [2025-01-10 01:07:21,712 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:07:21,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 6/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 105 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-01-10 01:07:21,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 60 transitions, 141 flow [2025-01-10 01:07:21,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 56 transitions, 130 flow [2025-01-10 01:07:21,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:07:21,731 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;@18bef0b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:07:21,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-01-10 01:07:21,734 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:07:21,734 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:07:21,734 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:07:21,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:21,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:07:21,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:21,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash 856597, now seen corresponding path program 1 times [2025-01-10 01:07:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202172072] [2025-01-10 01:07:21,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:21,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:07:21,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:07:21,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:21,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:21,963 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:07:21,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202172072] [2025-01-10 01:07:21,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202172072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:21,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:21,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:07:21,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21586830] [2025-01-10 01:07:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:21,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:21,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:22,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:22,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:22,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 01:07:22,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:22,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:22,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 01:07:22,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:22,267 INFO L124 PetriNetUnfolderBase]: 306/582 cut-off events. [2025-01-10 01:07:22,269 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-10 01:07:22,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 582 events. 306/582 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2503 event pairs, 202 based on Foata normal form. 1/502 useless extension candidates. Maximal degree in co-relation 909. Up to 441 conditions per place. [2025-01-10 01:07:22,280 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 29 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-01-10 01:07:22,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 182 flow [2025-01-10 01:07:22,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-01-10 01:07:22,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2025-01-10 01:07:22,295 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 130 flow. Second operand 3 states and 107 transitions. [2025-01-10 01:07:22,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 182 flow [2025-01-10 01:07:22,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 170 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:07:22,305 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 112 flow [2025-01-10 01:07:22,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2025-01-10 01:07:22,309 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2025-01-10 01:07:22,309 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 112 flow [2025-01-10 01:07:22,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:22,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:22,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:07:22,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:07:22,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:22,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash 856598, now seen corresponding path program 1 times [2025-01-10 01:07:22,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:22,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714841464] [2025-01-10 01:07:22,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:22,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:22,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:07:22,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:07:22,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:22,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:22,585 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:07:22,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:22,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714841464] [2025-01-10 01:07:22,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714841464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:22,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:22,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:22,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888654605] [2025-01-10 01:07:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:22,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:22,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:22,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:22,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:22,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 01:07:22,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:22,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:22,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 01:07:22,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:22,787 INFO L124 PetriNetUnfolderBase]: 307/585 cut-off events. [2025-01-10 01:07:22,787 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:07:22,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 585 events. 307/585 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2515 event pairs, 202 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 1021. Up to 454 conditions per place. [2025-01-10 01:07:22,794 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 33 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-01-10 01:07:22,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 192 flow [2025-01-10 01:07:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-01-10 01:07:22,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2025-01-10 01:07:22,797 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 112 flow. Second operand 4 states and 134 transitions. [2025-01-10 01:07:22,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 192 flow [2025-01-10 01:07:22,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:22,800 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 135 flow [2025-01-10 01:07:22,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2025-01-10 01:07:22,801 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-01-10 01:07:22,801 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 135 flow [2025-01-10 01:07:22,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:22,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:22,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:07:22,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:07:22,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:22,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:22,803 INFO L85 PathProgramCache]: Analyzing trace with hash 26556443, now seen corresponding path program 1 times [2025-01-10 01:07:22,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:22,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202968063] [2025-01-10 01:07:22,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:22,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:22,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:07:22,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:07:22,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:22,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:22,917 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:07:22,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:22,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202968063] [2025-01-10 01:07:22,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202968063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:22,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:22,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641337754] [2025-01-10 01:07:22,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:22,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:22,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:22,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:22,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:22,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-01-10 01:07:22,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:22,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:22,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-01-10 01:07:22,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:23,064 INFO L124 PetriNetUnfolderBase]: 309/595 cut-off events. [2025-01-10 01:07:23,064 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:07:23,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 595 events. 309/595 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2575 event pairs, 202 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 1032. Up to 452 conditions per place. [2025-01-10 01:07:23,068 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 32 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2025-01-10 01:07:23,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 235 flow [2025-01-10 01:07:23,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-01-10 01:07:23,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-01-10 01:07:23,069 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 135 flow. Second operand 4 states and 152 transitions. [2025-01-10 01:07:23,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 235 flow [2025-01-10 01:07:23,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:23,071 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 188 flow [2025-01-10 01:07:23,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2025-01-10 01:07:23,072 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2025-01-10 01:07:23,072 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 188 flow [2025-01-10 01:07:23,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:23,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:23,072 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:07:23,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:07:23,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:23,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash 823218894, now seen corresponding path program 1 times [2025-01-10 01:07:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:23,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334784129] [2025-01-10 01:07:23,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:23,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:23,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:07:23,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:07:23,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:23,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:23,230 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:07:23,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:23,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334784129] [2025-01-10 01:07:23,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334784129] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:23,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110881331] [2025-01-10 01:07:23,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:23,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:23,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:23,233 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:07:23,235 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:07:23,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:07:23,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:07:23,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:23,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:23,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:07:23,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:23,331 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:07:23,479 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:07:23,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:23,550 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:07:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110881331] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:23,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:23,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:07:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051812093] [2025-01-10 01:07:23,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:23,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:07:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:23,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:07:23,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:07:23,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 01:07:23,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 188 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:23,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:23,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 01:07:23,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:23,969 INFO L124 PetriNetUnfolderBase]: 310/597 cut-off events. [2025-01-10 01:07:23,970 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 01:07:23,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 597 events. 310/597 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2582 event pairs, 202 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 1037. Up to 461 conditions per place. [2025-01-10 01:07:23,973 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 35 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2025-01-10 01:07:23,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 289 flow [2025-01-10 01:07:23,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:07:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:07:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2025-01-10 01:07:23,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48541666666666666 [2025-01-10 01:07:23,975 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 188 flow. Second operand 8 states and 233 transitions. [2025-01-10 01:07:23,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 289 flow [2025-01-10 01:07:23,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:07:23,977 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 219 flow [2025-01-10 01:07:23,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=219, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-01-10 01:07:23,978 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2025-01-10 01:07:23,978 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 219 flow [2025-01-10 01:07:23,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:23,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:23,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:07:23,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:24,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:24,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:24,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash -250016157, now seen corresponding path program 1 times [2025-01-10 01:07:24,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:24,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227752008] [2025-01-10 01:07:24,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:24,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:07:24,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:07:24,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:24,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227752008] [2025-01-10 01:07:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227752008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935315103] [2025-01-10 01:07:24,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:24,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:24,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:24,467 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:07:24,469 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:07:24,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:07:24,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:07:24,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:24,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:24,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:07:24,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:24,548 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:07:24,642 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:07:24,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 01:07:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:24,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:24,738 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:07:24,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935315103] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:24,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:07:24,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-01-10 01:07:24,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158401800] [2025-01-10 01:07:24,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:24,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:24,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:24,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:24,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:07:24,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 01:07:24,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:24,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:24,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 01:07:24,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:25,049 INFO L124 PetriNetUnfolderBase]: 612/1165 cut-off events. [2025-01-10 01:07:25,050 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 01:07:25,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2153 conditions, 1165 events. 612/1165 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6039 event pairs, 404 based on Foata normal form. 2/1018 useless extension candidates. Maximal degree in co-relation 1078. Up to 455 conditions per place. [2025-01-10 01:07:25,057 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 59 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2025-01-10 01:07:25,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 418 flow [2025-01-10 01:07:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-01-10 01:07:25,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233333333333333 [2025-01-10 01:07:25,059 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 219 flow. Second operand 5 states and 187 transitions. [2025-01-10 01:07:25,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 418 flow [2025-01-10 01:07:25,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 376 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-01-10 01:07:25,062 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 213 flow [2025-01-10 01:07:25,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-01-10 01:07:25,062 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2025-01-10 01:07:25,063 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 213 flow [2025-01-10 01:07:25,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:25,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:25,063 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:25,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:25,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:25,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:25,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash 252669737, now seen corresponding path program 1 times [2025-01-10 01:07:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:25,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612115508] [2025-01-10 01:07:25,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:25,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:07:25,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:07:25,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:25,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:25,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612115508] [2025-01-10 01:07:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612115508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488755486] [2025-01-10 01:07:25,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:25,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:25,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:25,410 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:07:25,413 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:07:25,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:07:25,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:07:25,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:25,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:25,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:07:25,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:25,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:25,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488755486] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:25,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:25,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:07:25,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227571727] [2025-01-10 01:07:25,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:25,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:07:25,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:25,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:07:25,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:07:25,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-01-10 01:07:25,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 213 flow. Second operand has 13 states, 13 states have (on average 28.53846153846154) internal successors, (371), 13 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:25,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:25,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-01-10 01:07:25,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:25,982 INFO L124 PetriNetUnfolderBase]: 918/1750 cut-off events. [2025-01-10 01:07:25,982 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 01:07:25,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3224 conditions, 1750 events. 918/1750 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8802 event pairs, 606 based on Foata normal form. 2/1525 useless extension candidates. Maximal degree in co-relation 1052. Up to 884 conditions per place. [2025-01-10 01:07:25,993 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 52 selfloop transitions, 29 changer transitions 0/100 dead transitions. [2025-01-10 01:07:25,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 509 flow [2025-01-10 01:07:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:07:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:07:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 325 transitions. [2025-01-10 01:07:25,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2025-01-10 01:07:25,994 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 213 flow. Second operand 9 states and 325 transitions. [2025-01-10 01:07:25,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 509 flow [2025-01-10 01:07:25,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:25,998 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 365 flow [2025-01-10 01:07:25,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2025-01-10 01:07:25,999 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2025-01-10 01:07:25,999 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 365 flow [2025-01-10 01:07:26,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 28.53846153846154) internal successors, (371), 13 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:26,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:26,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:26,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:26,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:26,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:26,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1258009954, now seen corresponding path program 1 times [2025-01-10 01:07:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:26,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851969026] [2025-01-10 01:07:26,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:26,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:07:26,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:07:26,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:26,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:26,292 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:07:26,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:26,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851969026] [2025-01-10 01:07:26,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851969026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:26,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:26,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:07:26,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124936893] [2025-01-10 01:07:26,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:26,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:26,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:26,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:26,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:07:26,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:26,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:26,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:07:26,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:26,687 INFO L124 PetriNetUnfolderBase]: 1322/2485 cut-off events. [2025-01-10 01:07:26,687 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 01:07:26,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4647 conditions, 2485 events. 1322/2485 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 13569 event pairs, 808 based on Foata normal form. 0/2111 useless extension candidates. Maximal degree in co-relation 1867. Up to 1153 conditions per place. [2025-01-10 01:07:26,699 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 72 selfloop transitions, 20 changer transitions 0/110 dead transitions. [2025-01-10 01:07:26,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 110 transitions, 639 flow [2025-01-10 01:07:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:07:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:07:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2025-01-10 01:07:26,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6472222222222223 [2025-01-10 01:07:26,702 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 365 flow. Second operand 6 states and 233 transitions. [2025-01-10 01:07:26,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 110 transitions, 639 flow [2025-01-10 01:07:26,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 110 transitions, 569 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:26,705 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 353 flow [2025-01-10 01:07:26,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2025-01-10 01:07:26,706 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2025-01-10 01:07:26,706 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 353 flow [2025-01-10 01:07:26,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:26,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:26,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:26,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:07:26,706 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:26,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:26,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2061785446, now seen corresponding path program 1 times [2025-01-10 01:07:26,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:26,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235334615] [2025-01-10 01:07:26,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:26,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:26,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:07:26,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:07:26,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:26,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:26,772 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:07:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235334615] [2025-01-10 01:07:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235334615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:07:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515150039] [2025-01-10 01:07:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:26,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:26,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:26,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:26,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:07:26,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:26,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:26,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:07:26,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:27,119 INFO L124 PetriNetUnfolderBase]: 1256/2451 cut-off events. [2025-01-10 01:07:27,119 INFO L125 PetriNetUnfolderBase]: For 712/808 co-relation queries the response was YES. [2025-01-10 01:07:27,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5039 conditions, 2451 events. 1256/2451 cut-off events. For 712/808 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 14171 event pairs, 778 based on Foata normal form. 0/2056 useless extension candidates. Maximal degree in co-relation 2044. Up to 1175 conditions per place. [2025-01-10 01:07:27,131 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 69 selfloop transitions, 20 changer transitions 0/107 dead transitions. [2025-01-10 01:07:27,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 107 transitions, 619 flow [2025-01-10 01:07:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:07:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:07:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2025-01-10 01:07:27,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-01-10 01:07:27,134 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 353 flow. Second operand 6 states and 230 transitions. [2025-01-10 01:07:27,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 107 transitions, 619 flow [2025-01-10 01:07:27,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 107 transitions, 587 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:27,139 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 379 flow [2025-01-10 01:07:27,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2025-01-10 01:07:27,140 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 18 predicate places. [2025-01-10 01:07:27,140 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 379 flow [2025-01-10 01:07:27,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:27,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:27,140 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:07:27,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:07:27,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:27,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1353638257, now seen corresponding path program 2 times [2025-01-10 01:07:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980631811] [2025-01-10 01:07:27,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:27,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:27,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:07:27,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:07:27,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:27,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:07:27,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:27,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980631811] [2025-01-10 01:07:27,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980631811] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:27,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319843844] [2025-01-10 01:07:27,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:27,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:27,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:27,388 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:07:27,399 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:07:27,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:07:27,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:07:27,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:27,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:27,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 01:07:27,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:27,480 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:07:27,658 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:07:27,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2025-01-10 01:07:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:27,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:28,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319843844] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:28,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:28,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2025-01-10 01:07:28,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828655225] [2025-01-10 01:07:28,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:28,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:07:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:28,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:07:28,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:07:28,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 01:07:28,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 379 flow. Second operand has 18 states, 18 states have (on average 25.555555555555557) internal successors, (460), 18 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:28,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:28,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 01:07:28,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:29,495 INFO L124 PetriNetUnfolderBase]: 1069/2256 cut-off events. [2025-01-10 01:07:29,496 INFO L125 PetriNetUnfolderBase]: For 1217/1269 co-relation queries the response was YES. [2025-01-10 01:07:29,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5194 conditions, 2256 events. 1069/2256 cut-off events. For 1217/1269 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 13968 event pairs, 808 based on Foata normal form. 12/1989 useless extension candidates. Maximal degree in co-relation 2406. Up to 1609 conditions per place. [2025-01-10 01:07:29,506 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 33 selfloop transitions, 54 changer transitions 0/104 dead transitions. [2025-01-10 01:07:29,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 104 transitions, 725 flow [2025-01-10 01:07:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:07:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:07:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 418 transitions. [2025-01-10 01:07:29,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4976190476190476 [2025-01-10 01:07:29,508 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 379 flow. Second operand 14 states and 418 transitions. [2025-01-10 01:07:29,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 104 transitions, 725 flow [2025-01-10 01:07:29,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 104 transitions, 664 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:29,513 INFO L231 Difference]: Finished difference. Result has 88 places, 102 transitions, 624 flow [2025-01-10 01:07:29,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=624, PETRI_PLACES=88, PETRI_TRANSITIONS=102} [2025-01-10 01:07:29,513 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 28 predicate places. [2025-01-10 01:07:29,513 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 102 transitions, 624 flow [2025-01-10 01:07:29,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 25.555555555555557) internal successors, (460), 18 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:29,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:29,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:29,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:29,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-10 01:07:29,719 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:29,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:29,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1382693928, now seen corresponding path program 1 times [2025-01-10 01:07:29,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:29,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400117112] [2025-01-10 01:07:29,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:29,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:07:29,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:07:29,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:29,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:29,777 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:07:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400117112] [2025-01-10 01:07:29,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400117112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:29,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:29,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:07:29,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587190989] [2025-01-10 01:07:29,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:29,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:29,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:29,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:29,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:07:29,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 102 transitions, 624 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:29,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:29,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:07:29,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:30,008 INFO L124 PetriNetUnfolderBase]: 973/1886 cut-off events. [2025-01-10 01:07:30,008 INFO L125 PetriNetUnfolderBase]: For 1069/1237 co-relation queries the response was YES. [2025-01-10 01:07:30,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4488 conditions, 1886 events. 973/1886 cut-off events. For 1069/1237 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 9845 event pairs, 652 based on Foata normal form. 0/1637 useless extension candidates. Maximal degree in co-relation 2963. Up to 1066 conditions per place. [2025-01-10 01:07:30,016 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 81 selfloop transitions, 26 changer transitions 0/123 dead transitions. [2025-01-10 01:07:30,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 123 transitions, 924 flow [2025-01-10 01:07:30,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:07:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:07:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2025-01-10 01:07:30,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6194444444444445 [2025-01-10 01:07:30,018 INFO L175 Difference]: Start difference. First operand has 88 places, 102 transitions, 624 flow. Second operand 6 states and 223 transitions. [2025-01-10 01:07:30,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 123 transitions, 924 flow [2025-01-10 01:07:30,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 123 transitions, 855 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:30,022 INFO L231 Difference]: Finished difference. Result has 92 places, 104 transitions, 626 flow [2025-01-10 01:07:30,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=92, PETRI_TRANSITIONS=104} [2025-01-10 01:07:30,022 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 32 predicate places. [2025-01-10 01:07:30,022 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 104 transitions, 626 flow [2025-01-10 01:07:30,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:30,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:30,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:30,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:07:30,023 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:30,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:30,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1314755826, now seen corresponding path program 1 times [2025-01-10 01:07:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:30,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146595425] [2025-01-10 01:07:30,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:30,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:07:30,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:07:30,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:30,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:30,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:30,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146595425] [2025-01-10 01:07:30,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146595425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:30,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071238249] [2025-01-10 01:07:30,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:30,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:30,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:30,261 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:07:30,271 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:07:30,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:07:30,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:07:30,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:30,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:30,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:07:30,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:30,333 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:07:30,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:07:30,376 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:07:30,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-01-10 01:07:30,391 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:07:30,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:07:30,476 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-01-10 01:07:30,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2025-01-10 01:07:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:30,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:31,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071238249] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:31,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:07:31,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 15 [2025-01-10 01:07:31,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318658267] [2025-01-10 01:07:31,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:31,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:07:31,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:31,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:07:31,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:07:31,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:07:31,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 104 transitions, 626 flow. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:31,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:31,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:07:31,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:33,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:07:34,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:07:34,515 INFO L124 PetriNetUnfolderBase]: 1301/2674 cut-off events. [2025-01-10 01:07:34,515 INFO L125 PetriNetUnfolderBase]: For 1333/1503 co-relation queries the response was YES. [2025-01-10 01:07:34,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6290 conditions, 2674 events. 1301/2674 cut-off events. For 1333/1503 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 16940 event pairs, 681 based on Foata normal form. 0/2317 useless extension candidates. Maximal degree in co-relation 3945. Up to 1362 conditions per place. [2025-01-10 01:07:34,527 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 97 selfloop transitions, 27 changer transitions 0/140 dead transitions. [2025-01-10 01:07:34,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 140 transitions, 1014 flow [2025-01-10 01:07:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:07:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:07:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2025-01-10 01:07:34,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-01-10 01:07:34,528 INFO L175 Difference]: Start difference. First operand has 92 places, 104 transitions, 626 flow. Second operand 7 states and 250 transitions. [2025-01-10 01:07:34,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 140 transitions, 1014 flow [2025-01-10 01:07:34,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 140 transitions, 959 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:34,535 INFO L231 Difference]: Finished difference. Result has 97 places, 108 transitions, 676 flow [2025-01-10 01:07:34,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=676, PETRI_PLACES=97, PETRI_TRANSITIONS=108} [2025-01-10 01:07:34,536 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 37 predicate places. [2025-01-10 01:07:34,536 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 108 transitions, 676 flow [2025-01-10 01:07:34,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:34,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:34,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:34,544 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:07:34,737 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:07:34,738 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:34,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:34,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1314755827, now seen corresponding path program 1 times [2025-01-10 01:07:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:34,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318852073] [2025-01-10 01:07:34,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:34,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:07:34,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:07:34,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:34,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318852073] [2025-01-10 01:07:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318852073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:34,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:34,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:07:34,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767886321] [2025-01-10 01:07:34,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:34,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:34,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:34,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:34,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-01-10 01:07:34,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 676 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:34,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:34,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-01-10 01:07:34,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:35,065 INFO L124 PetriNetUnfolderBase]: 1269/2488 cut-off events. [2025-01-10 01:07:35,066 INFO L125 PetriNetUnfolderBase]: For 3558/3992 co-relation queries the response was YES. [2025-01-10 01:07:35,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6873 conditions, 2488 events. 1269/2488 cut-off events. For 3558/3992 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 14360 event pairs, 898 based on Foata normal form. 176/2462 useless extension candidates. Maximal degree in co-relation 4319. Up to 1853 conditions per place. [2025-01-10 01:07:35,078 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 76 selfloop transitions, 16 changer transitions 0/106 dead transitions. [2025-01-10 01:07:35,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 106 transitions, 856 flow [2025-01-10 01:07:35,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-01-10 01:07:35,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2025-01-10 01:07:35,079 INFO L175 Difference]: Start difference. First operand has 97 places, 108 transitions, 676 flow. Second operand 5 states and 139 transitions. [2025-01-10 01:07:35,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 106 transitions, 856 flow [2025-01-10 01:07:35,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 106 transitions, 853 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:35,085 INFO L231 Difference]: Finished difference. Result has 98 places, 106 transitions, 701 flow [2025-01-10 01:07:35,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=701, PETRI_PLACES=98, PETRI_TRANSITIONS=106} [2025-01-10 01:07:35,086 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 38 predicate places. [2025-01-10 01:07:35,086 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 106 transitions, 701 flow [2025-01-10 01:07:35,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:35,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:35,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:35,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:07:35,086 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:35,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash -759933934, now seen corresponding path program 1 times [2025-01-10 01:07:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:35,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177707353] [2025-01-10 01:07:35,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:35,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:07:35,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:07:35,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:35,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:35,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:35,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177707353] [2025-01-10 01:07:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177707353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:35,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:35,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:07:35,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185839948] [2025-01-10 01:07:35,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:35,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:35,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:35,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:35,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:35,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-10 01:07:35,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 106 transitions, 701 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:35,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:35,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-10 01:07:35,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:35,370 INFO L124 PetriNetUnfolderBase]: 1123/2248 cut-off events. [2025-01-10 01:07:35,370 INFO L125 PetriNetUnfolderBase]: For 3269/3625 co-relation queries the response was YES. [2025-01-10 01:07:35,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6277 conditions, 2248 events. 1123/2248 cut-off events. For 3269/3625 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 12874 event pairs, 794 based on Foata normal form. 0/2082 useless extension candidates. Maximal degree in co-relation 4024. Up to 1651 conditions per place. [2025-01-10 01:07:35,380 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 71 selfloop transitions, 20 changer transitions 0/104 dead transitions. [2025-01-10 01:07:35,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 104 transitions, 879 flow [2025-01-10 01:07:35,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-01-10 01:07:35,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2025-01-10 01:07:35,381 INFO L175 Difference]: Start difference. First operand has 98 places, 106 transitions, 701 flow. Second operand 5 states and 143 transitions. [2025-01-10 01:07:35,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 104 transitions, 879 flow [2025-01-10 01:07:35,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 104 transitions, 858 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:35,386 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 716 flow [2025-01-10 01:07:35,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=716, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2025-01-10 01:07:35,387 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 37 predicate places. [2025-01-10 01:07:35,387 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 716 flow [2025-01-10 01:07:35,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:35,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:35,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:35,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:07:35,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:35,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash -759933933, now seen corresponding path program 1 times [2025-01-10 01:07:35,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:35,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45902483] [2025-01-10 01:07:35,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:35,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:07:35,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:07:35,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:35,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45902483] [2025-01-10 01:07:35,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45902483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904043689] [2025-01-10 01:07:35,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:35,554 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:07:35,562 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:07:35,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:07:35,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:07:35,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:35,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:35,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:07:35,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:35,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:07:35,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:07:35,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:07:35,684 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:07:35,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:07:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:35,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:35,799 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 52 treesize of output 48 [2025-01-10 01:07:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:35,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904043689] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:35,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:35,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:07:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318907307] [2025-01-10 01:07:35,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:35,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:07:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:35,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:07:35,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:07:36,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-01-10 01:07:36,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 716 flow. Second operand has 13 states, 13 states have (on average 25.53846153846154) internal successors, (332), 13 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:36,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:36,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-01-10 01:07:36,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:36,834 INFO L124 PetriNetUnfolderBase]: 1781/3272 cut-off events. [2025-01-10 01:07:36,835 INFO L125 PetriNetUnfolderBase]: For 4536/5154 co-relation queries the response was YES. [2025-01-10 01:07:36,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9010 conditions, 3272 events. 1781/3272 cut-off events. For 4536/5154 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 19156 event pairs, 956 based on Foata normal form. 0/2948 useless extension candidates. Maximal degree in co-relation 5393. Up to 1846 conditions per place. [2025-01-10 01:07:36,860 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 96 selfloop transitions, 32 changer transitions 0/140 dead transitions. [2025-01-10 01:07:36,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 140 transitions, 1132 flow [2025-01-10 01:07:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:07:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:07:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 257 transitions. [2025-01-10 01:07:36,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5354166666666667 [2025-01-10 01:07:36,861 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 716 flow. Second operand 8 states and 257 transitions. [2025-01-10 01:07:36,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 140 transitions, 1132 flow [2025-01-10 01:07:36,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 140 transitions, 1103 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:36,869 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 798 flow [2025-01-10 01:07:36,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=798, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2025-01-10 01:07:36,870 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 43 predicate places. [2025-01-10 01:07:36,870 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 798 flow [2025-01-10 01:07:36,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.53846153846154) internal successors, (332), 13 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:36,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:36,870 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:36,878 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:07:37,074 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,SelfDestructingSolverStorable13 [2025-01-10 01:07:37,075 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:37,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash -759935086, now seen corresponding path program 1 times [2025-01-10 01:07:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:37,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209273191] [2025-01-10 01:07:37,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:37,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:07:37,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:07:37,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:37,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:37,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209273191] [2025-01-10 01:07:37,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209273191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609146615] [2025-01-10 01:07:37,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:37,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:37,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:37,165 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:07:37,166 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:07:37,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:07:37,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:07:37,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:37,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:37,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:07:37,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:37,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:37,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609146615] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:37,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:37,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:07:37,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515157765] [2025-01-10 01:07:37,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:37,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:07:37,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:37,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:07:37,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:07:37,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:07:37,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 798 flow. Second operand has 14 states, 14 states have (on average 28.142857142857142) internal successors, (394), 14 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:37,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:37,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:07:37,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:37,830 INFO L124 PetriNetUnfolderBase]: 1845/3356 cut-off events. [2025-01-10 01:07:37,831 INFO L125 PetriNetUnfolderBase]: For 5797/6212 co-relation queries the response was YES. [2025-01-10 01:07:37,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10421 conditions, 3356 events. 1845/3356 cut-off events. For 5797/6212 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 19355 event pairs, 908 based on Foata normal form. 50/3176 useless extension candidates. Maximal degree in co-relation 5725. Up to 1225 conditions per place. [2025-01-10 01:07:37,849 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 106 selfloop transitions, 55 changer transitions 0/173 dead transitions. [2025-01-10 01:07:37,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 173 transitions, 1418 flow [2025-01-10 01:07:37,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:07:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:07:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 368 transitions. [2025-01-10 01:07:37,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-01-10 01:07:37,852 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 798 flow. Second operand 10 states and 368 transitions. [2025-01-10 01:07:37,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 173 transitions, 1418 flow [2025-01-10 01:07:37,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 173 transitions, 1393 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:37,861 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 945 flow [2025-01-10 01:07:37,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=945, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2025-01-10 01:07:37,862 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 52 predicate places. [2025-01-10 01:07:37,862 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 945 flow [2025-01-10 01:07:37,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 28.142857142857142) internal successors, (394), 14 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:37,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:37,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:37,869 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:07:38,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:38,063 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:38,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash -165266475, now seen corresponding path program 1 times [2025-01-10 01:07:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:38,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006476211] [2025-01-10 01:07:38,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:38,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:38,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:07:38,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:07:38,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:38,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:38,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:38,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006476211] [2025-01-10 01:07:38,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006476211] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:38,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845879779] [2025-01-10 01:07:38,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:38,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:38,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:38,421 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:07:38,422 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:07:38,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:07:38,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:07:38,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:38,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:38,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:07:38,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:38,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:07:38,524 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:07:38,561 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:07:38,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-01-10 01:07:38,582 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:07:38,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:07:38,706 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-01-10 01:07:38,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2025-01-10 01:07:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:39,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:39,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845879779] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:39,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:07:39,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 16 [2025-01-10 01:07:39,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441591548] [2025-01-10 01:07:39,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:39,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:07:39,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:39,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:07:39,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:07:39,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-01-10 01:07:39,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 945 flow. Second operand has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:39,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:39,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-01-10 01:07:39,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:41,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:07:44,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:07:45,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:07:48,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:07:52,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:07:54,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:07:54,458 INFO L124 PetriNetUnfolderBase]: 2141/3712 cut-off events. [2025-01-10 01:07:54,458 INFO L125 PetriNetUnfolderBase]: For 12651/13579 co-relation queries the response was YES. [2025-01-10 01:07:54,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13056 conditions, 3712 events. 2141/3712 cut-off events. For 12651/13579 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 20761 event pairs, 821 based on Foata normal form. 0/3479 useless extension candidates. Maximal degree in co-relation 9424. Up to 1532 conditions per place. [2025-01-10 01:07:54,479 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 109 selfloop transitions, 28 changer transitions 0/148 dead transitions. [2025-01-10 01:07:54,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 148 transitions, 1443 flow [2025-01-10 01:07:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:07:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:07:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2025-01-10 01:07:54,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 01:07:54,481 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 945 flow. Second operand 7 states and 240 transitions. [2025-01-10 01:07:54,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 148 transitions, 1443 flow [2025-01-10 01:07:54,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 148 transitions, 1345 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 01:07:54,494 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 958 flow [2025-01-10 01:07:54,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=958, PETRI_PLACES=114, PETRI_TRANSITIONS=116} [2025-01-10 01:07:54,495 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 54 predicate places. [2025-01-10 01:07:54,498 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 958 flow [2025-01-10 01:07:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:54,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:54,499 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:54,507 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:07:54,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 01:07:54,700 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:54,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:54,700 INFO L85 PathProgramCache]: Analyzing trace with hash -152040425, now seen corresponding path program 1 times [2025-01-10 01:07:54,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:54,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989596321] [2025-01-10 01:07:54,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:54,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:07:54,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:07:54,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:54,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989596321] [2025-01-10 01:07:54,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989596321] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979560611] [2025-01-10 01:07:54,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:54,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:54,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:54,845 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:07:54,848 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:07:54,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:07:54,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:07:54,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:54,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:54,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:07:54,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:54,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:55,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979560611] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:55,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:55,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:07:55,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006731798] [2025-01-10 01:07:55,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:55,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:07:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:55,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:07:55,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:07:55,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:07:55,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 958 flow. Second operand has 14 states, 14 states have (on average 28.285714285714285) internal successors, (396), 14 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:55,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:55,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:07:55,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:55,577 INFO L124 PetriNetUnfolderBase]: 2170/3859 cut-off events. [2025-01-10 01:07:55,581 INFO L125 PetriNetUnfolderBase]: For 13120/14032 co-relation queries the response was YES. [2025-01-10 01:07:55,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13918 conditions, 3859 events. 2170/3859 cut-off events. For 13120/14032 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 22004 event pairs, 1051 based on Foata normal form. 62/3758 useless extension candidates. Maximal degree in co-relation 10370. Up to 1479 conditions per place. [2025-01-10 01:07:55,605 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 109 selfloop transitions, 55 changer transitions 0/177 dead transitions. [2025-01-10 01:07:55,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 177 transitions, 1658 flow [2025-01-10 01:07:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:07:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:07:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 366 transitions. [2025-01-10 01:07:55,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-01-10 01:07:55,607 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 958 flow. Second operand 10 states and 366 transitions. [2025-01-10 01:07:55,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 177 transitions, 1658 flow [2025-01-10 01:07:55,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 177 transitions, 1623 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:55,621 INFO L231 Difference]: Finished difference. Result has 122 places, 120 transitions, 1095 flow [2025-01-10 01:07:55,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1095, PETRI_PLACES=122, PETRI_TRANSITIONS=120} [2025-01-10 01:07:55,621 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 62 predicate places. [2025-01-10 01:07:55,621 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 120 transitions, 1095 flow [2025-01-10 01:07:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 28.285714285714285) internal successors, (396), 14 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:55,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:55,622 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:07:55,641 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:07:55,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:55,826 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:55,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash -828292607, now seen corresponding path program 1 times [2025-01-10 01:07:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:55,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830998240] [2025-01-10 01:07:55,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:55,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:55,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:07:55,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:07:55,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:55,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830998240] [2025-01-10 01:07:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830998240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774926389] [2025-01-10 01:07:55,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:55,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:55,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:55,964 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:07:55,967 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:07:56,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:07:56,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:07:56,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:56,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:56,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:07:56,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:56,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:07:56,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:07:56,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:07:56,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:07:56,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:07:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:56,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:56,216 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 52 treesize of output 48 [2025-01-10 01:07:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:56,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774926389] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:56,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:56,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:07:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062100022] [2025-01-10 01:07:56,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:56,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:07:56,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:56,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:07:56,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:07:56,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-01-10 01:07:56,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 120 transitions, 1095 flow. Second operand has 13 states, 13 states have (on average 25.846153846153847) internal successors, (336), 13 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:56,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:56,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-01-10 01:07:56,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:57,334 INFO L124 PetriNetUnfolderBase]: 2256/4273 cut-off events. [2025-01-10 01:07:57,335 INFO L125 PetriNetUnfolderBase]: For 18982/20161 co-relation queries the response was YES. [2025-01-10 01:07:57,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16266 conditions, 4273 events. 2256/4273 cut-off events. For 18982/20161 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 27110 event pairs, 821 based on Foata normal form. 31/3924 useless extension candidates. Maximal degree in co-relation 12180. Up to 1562 conditions per place. [2025-01-10 01:07:57,358 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 134 selfloop transitions, 34 changer transitions 0/181 dead transitions. [2025-01-10 01:07:57,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 181 transitions, 1879 flow [2025-01-10 01:07:57,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:07:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:07:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 288 transitions. [2025-01-10 01:07:57,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-01-10 01:07:57,364 INFO L175 Difference]: Start difference. First operand has 122 places, 120 transitions, 1095 flow. Second operand 9 states and 288 transitions. [2025-01-10 01:07:57,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 181 transitions, 1879 flow [2025-01-10 01:07:57,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 181 transitions, 1790 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 01:07:57,381 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 1119 flow [2025-01-10 01:07:57,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1119, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2025-01-10 01:07:57,383 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 67 predicate places. [2025-01-10 01:07:57,383 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 1119 flow [2025-01-10 01:07:57,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.846153846153847) internal successors, (336), 13 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:57,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:57,383 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] [2025-01-10 01:07:57,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:57,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:07:57,587 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 92733876, now seen corresponding path program 1 times [2025-01-10 01:07:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124510792] [2025-01-10 01:07:57,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:57,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:57,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:07:57,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:07:57,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:57,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:57,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124510792] [2025-01-10 01:07:57,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124510792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:57,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:57,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:57,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108640983] [2025-01-10 01:07:57,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:57,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:57,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:57,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:57,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:57,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-10 01:07:57,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 1119 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:57,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:57,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-10 01:07:57,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:57,969 INFO L124 PetriNetUnfolderBase]: 2061/3739 cut-off events. [2025-01-10 01:07:57,969 INFO L125 PetriNetUnfolderBase]: For 19011/19945 co-relation queries the response was YES. [2025-01-10 01:07:57,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15675 conditions, 3739 events. 2061/3739 cut-off events. For 19011/19945 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 21736 event pairs, 1436 based on Foata normal form. 148/3873 useless extension candidates. Maximal degree in co-relation 11837. Up to 2917 conditions per place. [2025-01-10 01:07:57,988 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 96 selfloop transitions, 12 changer transitions 0/120 dead transitions. [2025-01-10 01:07:57,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 120 transitions, 1331 flow [2025-01-10 01:07:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-01-10 01:07:57,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2025-01-10 01:07:57,989 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 1119 flow. Second operand 4 states and 121 transitions. [2025-01-10 01:07:57,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 120 transitions, 1331 flow [2025-01-10 01:07:57,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 120 transitions, 1290 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:07:58,001 INFO L231 Difference]: Finished difference. Result has 123 places, 120 transitions, 1098 flow [2025-01-10 01:07:58,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1098, PETRI_PLACES=123, PETRI_TRANSITIONS=120} [2025-01-10 01:07:58,001 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 63 predicate places. [2025-01-10 01:07:58,001 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 120 transitions, 1098 flow [2025-01-10 01:07:58,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:58,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:58,002 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] [2025-01-10 01:07:58,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:07:58,002 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:58,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash 92733877, now seen corresponding path program 1 times [2025-01-10 01:07:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:58,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194301800] [2025-01-10 01:07:58,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:58,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:07:58,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:07:58,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:58,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:58,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:58,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194301800] [2025-01-10 01:07:58,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194301800] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:58,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569702056] [2025-01-10 01:07:58,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:58,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:58,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:58,110 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:07:58,110 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:07:58,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:07:58,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:07:58,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:58,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:58,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:07:58,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:58,186 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:07:58,246 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:07:58,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 01:07:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:58,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569702056] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:58,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:07:58,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2025-01-10 01:07:58,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340973238] [2025-01-10 01:07:58,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:58,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:07:58,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:58,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:07:58,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:07:58,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-01-10 01:07:58,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 120 transitions, 1098 flow. Second operand has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:58,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:58,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-01-10 01:07:58,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:58,966 INFO L124 PetriNetUnfolderBase]: 2379/3950 cut-off events. [2025-01-10 01:07:58,966 INFO L125 PetriNetUnfolderBase]: For 20822/21883 co-relation queries the response was YES. [2025-01-10 01:07:58,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17314 conditions, 3950 events. 2379/3950 cut-off events. For 20822/21883 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 20630 event pairs, 1050 based on Foata normal form. 148/4018 useless extension candidates. Maximal degree in co-relation 13256. Up to 1987 conditions per place. [2025-01-10 01:07:58,987 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 130 selfloop transitions, 25 changer transitions 0/165 dead transitions. [2025-01-10 01:07:58,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 165 transitions, 1766 flow [2025-01-10 01:07:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:07:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:07:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 242 transitions. [2025-01-10 01:07:58,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2025-01-10 01:07:58,990 INFO L175 Difference]: Start difference. First operand has 123 places, 120 transitions, 1098 flow. Second operand 7 states and 242 transitions. [2025-01-10 01:07:58,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 165 transitions, 1766 flow [2025-01-10 01:07:59,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 165 transitions, 1753 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:59,006 INFO L231 Difference]: Finished difference. Result has 128 places, 122 transitions, 1187 flow [2025-01-10 01:07:59,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1187, PETRI_PLACES=128, PETRI_TRANSITIONS=122} [2025-01-10 01:07:59,006 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 68 predicate places. [2025-01-10 01:07:59,006 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 122 transitions, 1187 flow [2025-01-10 01:07:59,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:59,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:59,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:59,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:07:59,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:59,211 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:59,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 915495289, now seen corresponding path program 1 times [2025-01-10 01:07:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:59,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111411743] [2025-01-10 01:07:59,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:59,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:59,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:07:59,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:07:59,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:59,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:59,264 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:07:59,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:59,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111411743] [2025-01-10 01:07:59,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111411743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:59,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:59,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:59,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187143603] [2025-01-10 01:07:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:59,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:59,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:59,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:59,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-01-10 01:07:59,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 122 transitions, 1187 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:59,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:59,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-01-10 01:07:59,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:59,591 INFO L124 PetriNetUnfolderBase]: 2488/4334 cut-off events. [2025-01-10 01:07:59,591 INFO L125 PetriNetUnfolderBase]: For 27828/28774 co-relation queries the response was YES. [2025-01-10 01:07:59,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20161 conditions, 4334 events. 2488/4334 cut-off events. For 27828/28774 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 24414 event pairs, 802 based on Foata normal form. 5/4324 useless extension candidates. Maximal degree in co-relation 14679. Up to 2287 conditions per place. [2025-01-10 01:07:59,612 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 106 selfloop transitions, 6 changer transitions 24/147 dead transitions. [2025-01-10 01:07:59,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 147 transitions, 1651 flow [2025-01-10 01:07:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2025-01-10 01:07:59,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-01-10 01:07:59,614 INFO L175 Difference]: Start difference. First operand has 128 places, 122 transitions, 1187 flow. Second operand 3 states and 132 transitions. [2025-01-10 01:07:59,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 147 transitions, 1651 flow [2025-01-10 01:07:59,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 147 transitions, 1629 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:59,629 INFO L231 Difference]: Finished difference. Result has 127 places, 104 transitions, 882 flow [2025-01-10 01:07:59,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=127, PETRI_TRANSITIONS=104} [2025-01-10 01:07:59,630 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 67 predicate places. [2025-01-10 01:07:59,630 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 104 transitions, 882 flow [2025-01-10 01:07:59,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:59,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:59,630 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:59,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:07:59,631 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:07:59,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1694151742, now seen corresponding path program 2 times [2025-01-10 01:07:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000274168] [2025-01-10 01:07:59,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:59,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:07:59,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:59,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:59,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:07:59,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:59,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000274168] [2025-01-10 01:07:59,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000274168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:59,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96628492] [2025-01-10 01:07:59,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:59,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:59,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:59,923 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:07:59,925 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:07:59,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:07:59,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:59,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:59,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:59,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-10 01:08:00,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:00,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:08:00,015 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:08:00,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:00,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 01:08:00,134 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:08:00,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:08:00,211 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:08:00,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2025-01-10 01:08:00,245 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:08:00,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:08:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:08:00,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:08:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96628492] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:01,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 22 [2025-01-10 01:08:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597566626] [2025-01-10 01:08:01,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:01,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:08:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:01,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:08:01,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:08:02,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-01-10 01:08:02,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 104 transitions, 882 flow. Second operand has 24 states, 24 states have (on average 18.25) internal successors, (438), 24 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:02,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:02,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-01-10 01:08:02,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:05,008 INFO L124 PetriNetUnfolderBase]: 5583/8380 cut-off events. [2025-01-10 01:08:05,008 INFO L125 PetriNetUnfolderBase]: For 45960/47605 co-relation queries the response was YES. [2025-01-10 01:08:05,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39645 conditions, 8380 events. 5583/8380 cut-off events. For 45960/47605 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 46328 event pairs, 1518 based on Foata normal form. 0/8375 useless extension candidates. Maximal degree in co-relation 26872. Up to 1443 conditions per place. [2025-01-10 01:08:05,059 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 299 selfloop transitions, 54 changer transitions 0/360 dead transitions. [2025-01-10 01:08:05,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 360 transitions, 3452 flow [2025-01-10 01:08:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 01:08:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-10 01:08:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 603 transitions. [2025-01-10 01:08:05,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4369565217391304 [2025-01-10 01:08:05,061 INFO L175 Difference]: Start difference. First operand has 127 places, 104 transitions, 882 flow. Second operand 23 states and 603 transitions. [2025-01-10 01:08:05,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 360 transitions, 3452 flow [2025-01-10 01:08:05,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 360 transitions, 3029 flow, removed 79 selfloop flow, removed 19 redundant places. [2025-01-10 01:08:05,128 INFO L231 Difference]: Finished difference. Result has 126 places, 117 transitions, 971 flow [2025-01-10 01:08:05,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=971, PETRI_PLACES=126, PETRI_TRANSITIONS=117} [2025-01-10 01:08:05,129 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 66 predicate places. [2025-01-10 01:08:05,129 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 117 transitions, 971 flow [2025-01-10 01:08:05,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 18.25) internal successors, (438), 24 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:05,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:05,129 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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:08:05,136 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:08:05,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:05,330 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:08:05,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:05,331 INFO L85 PathProgramCache]: Analyzing trace with hash 971872521, now seen corresponding path program 1 times [2025-01-10 01:08:05,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:05,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902313327] [2025-01-10 01:08:05,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:05,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:05,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:08:05,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:08:05,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:05,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:08:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:05,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902313327] [2025-01-10 01:08:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902313327] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:05,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404581201] [2025-01-10 01:08:05,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:05,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:05,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:05,436 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:08:05,441 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:08:05,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:08:05,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:08:05,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:05,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:05,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:08:05,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:08:05,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:08:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404581201] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:05,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:08:05,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783775117] [2025-01-10 01:08:05,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:05,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:08:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:05,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:08:05,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:08:05,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:08:05,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 117 transitions, 971 flow. Second operand has 14 states, 14 states have (on average 28.857142857142858) internal successors, (404), 14 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:05,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:05,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:08:05,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:06,305 INFO L124 PetriNetUnfolderBase]: 3743/5729 cut-off events. [2025-01-10 01:08:06,305 INFO L125 PetriNetUnfolderBase]: For 25723/26692 co-relation queries the response was YES. [2025-01-10 01:08:06,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24936 conditions, 5729 events. 3743/5729 cut-off events. For 25723/26692 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 30341 event pairs, 1582 based on Foata normal form. 155/5826 useless extension candidates. Maximal degree in co-relation 17179. Up to 2360 conditions per place. [2025-01-10 01:08:06,336 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 114 selfloop transitions, 45 changer transitions 0/171 dead transitions. [2025-01-10 01:08:06,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 171 transitions, 1683 flow [2025-01-10 01:08:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:08:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:08:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 355 transitions. [2025-01-10 01:08:06,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2025-01-10 01:08:06,338 INFO L175 Difference]: Start difference. First operand has 126 places, 117 transitions, 971 flow. Second operand 10 states and 355 transitions. [2025-01-10 01:08:06,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 171 transitions, 1683 flow [2025-01-10 01:08:06,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 171 transitions, 1461 flow, removed 16 selfloop flow, removed 12 redundant places. [2025-01-10 01:08:06,358 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 1014 flow [2025-01-10 01:08:06,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1014, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-01-10 01:08:06,359 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 66 predicate places. [2025-01-10 01:08:06,359 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 1014 flow [2025-01-10 01:08:06,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 28.857142857142858) internal successors, (404), 14 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:06,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:06,359 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:06,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 01:08:06,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:06,560 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:08:06,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash 288355779, now seen corresponding path program 2 times [2025-01-10 01:08:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:06,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140409095] [2025-01-10 01:08:06,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:08:06,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:06,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:08:06,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:08:06,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:08:06,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:08:06,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:06,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140409095] [2025-01-10 01:08:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140409095] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:06,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353420148] [2025-01-10 01:08:06,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:08:06,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:06,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:06,805 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:08:06,806 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:08:06,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:08:06,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:08:06,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:08:06,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:06,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:08:06,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:06,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:08:06,914 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:08:06,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:06,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:08:06,994 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:08:06,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:08:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:08:07,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:08:07,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353420148] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:07,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:07,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-01-10 01:08:07,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369935270] [2025-01-10 01:08:07,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:07,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:08:07,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:07,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:08:07,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:08:08,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-10 01:08:08,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 1014 flow. Second operand has 21 states, 21 states have (on average 21.714285714285715) internal successors, (456), 21 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:08:08,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:08,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-10 01:08:08,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:09,503 INFO L124 PetriNetUnfolderBase]: 5380/7840 cut-off events. [2025-01-10 01:08:09,503 INFO L125 PetriNetUnfolderBase]: For 27716/28512 co-relation queries the response was YES. [2025-01-10 01:08:09,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31239 conditions, 7840 events. 5380/7840 cut-off events. For 27716/28512 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 41091 event pairs, 1191 based on Foata normal form. 53/7770 useless extension candidates. Maximal degree in co-relation 22424. Up to 1779 conditions per place. [2025-01-10 01:08:09,534 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 239 selfloop transitions, 49 changer transitions 0/299 dead transitions. [2025-01-10 01:08:09,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 299 transitions, 2834 flow [2025-01-10 01:08:09,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:08:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 01:08:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 525 transitions. [2025-01-10 01:08:09,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2025-01-10 01:08:09,536 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 1014 flow. Second operand 19 states and 525 transitions. [2025-01-10 01:08:09,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 299 transitions, 2834 flow [2025-01-10 01:08:09,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 299 transitions, 2743 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-01-10 01:08:09,556 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 1115 flow [2025-01-10 01:08:09,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1115, PETRI_PLACES=139, PETRI_TRANSITIONS=131} [2025-01-10 01:08:09,560 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 79 predicate places. [2025-01-10 01:08:09,560 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 1115 flow [2025-01-10 01:08:09,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 21.714285714285715) internal successors, (456), 21 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:08:09,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:09,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:09,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 01:08:09,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:08:09,761 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:08:09,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1393715413, now seen corresponding path program 1 times [2025-01-10 01:08:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:09,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806728588] [2025-01-10 01:08:09,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:09,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:08:09,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:08:09,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:09,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:08:09,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:09,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806728588] [2025-01-10 01:08:09,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806728588] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:09,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010237708] [2025-01-10 01:08:09,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:09,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:09,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:09,830 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:08:09,832 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:08:09,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:08:09,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:08:09,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:09,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:09,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:08:09,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:08:09,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:08:09,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010237708] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:09,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:08:09,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-01-10 01:08:09,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002923186] [2025-01-10 01:08:09,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:08:09,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:08:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:09,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:08:09,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:08:09,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:08:09,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 131 transitions, 1115 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:09,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:09,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:08:09,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:10,617 INFO L124 PetriNetUnfolderBase]: 4773/7117 cut-off events. [2025-01-10 01:08:10,617 INFO L125 PetriNetUnfolderBase]: For 31937/32672 co-relation queries the response was YES. [2025-01-10 01:08:10,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30723 conditions, 7117 events. 4773/7117 cut-off events. For 31937/32672 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 37767 event pairs, 1483 based on Foata normal form. 447/7441 useless extension candidates. Maximal degree in co-relation 22710. Up to 3446 conditions per place. [2025-01-10 01:08:10,655 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 140 selfloop transitions, 15 changer transitions 0/166 dead transitions. [2025-01-10 01:08:10,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 166 transitions, 1676 flow [2025-01-10 01:08:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:08:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:08:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2025-01-10 01:08:10,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-01-10 01:08:10,659 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 1115 flow. Second operand 5 states and 177 transitions. [2025-01-10 01:08:10,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 166 transitions, 1676 flow [2025-01-10 01:08:10,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 166 transitions, 1593 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-01-10 01:08:10,688 INFO L231 Difference]: Finished difference. Result has 135 places, 128 transitions, 1047 flow [2025-01-10 01:08:10,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1047, PETRI_PLACES=135, PETRI_TRANSITIONS=128} [2025-01-10 01:08:10,689 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 75 predicate places. [2025-01-10 01:08:10,689 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 128 transitions, 1047 flow [2025-01-10 01:08:10,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:10,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:10,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:10,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 01:08:10,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 01:08:10,891 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:08:10,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:10,891 INFO L85 PathProgramCache]: Analyzing trace with hash -833389935, now seen corresponding path program 1 times [2025-01-10 01:08:10,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:10,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339735253] [2025-01-10 01:08:10,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:10,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:08:10,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:08:10,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:10,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:08:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339735253] [2025-01-10 01:08:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339735253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474378475] [2025-01-10 01:08:10,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:10,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:10,964 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:08:10,965 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:08:11,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:08:11,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:08:11,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:11,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:11,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:08:11,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:08:11,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:08:11,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474378475] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:11,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:08:11,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-01-10 01:08:11,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781595852] [2025-01-10 01:08:11,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:08:11,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:08:11,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:11,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:08:11,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:08:11,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:08:11,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 128 transitions, 1047 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:11,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:11,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:08:11,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:11,677 INFO L124 PetriNetUnfolderBase]: 4390/6847 cut-off events. [2025-01-10 01:08:11,677 INFO L125 PetriNetUnfolderBase]: For 34568/35249 co-relation queries the response was YES. [2025-01-10 01:08:11,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29950 conditions, 6847 events. 4390/6847 cut-off events. For 34568/35249 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 38605 event pairs, 1586 based on Foata normal form. 313/6917 useless extension candidates. Maximal degree in co-relation 23229. Up to 3360 conditions per place. [2025-01-10 01:08:11,724 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 134 selfloop transitions, 15 changer transitions 0/161 dead transitions. [2025-01-10 01:08:11,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 161 transitions, 1675 flow [2025-01-10 01:08:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:08:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:08:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2025-01-10 01:08:11,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2025-01-10 01:08:11,725 INFO L175 Difference]: Start difference. First operand has 135 places, 128 transitions, 1047 flow. Second operand 5 states and 178 transitions. [2025-01-10 01:08:11,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 161 transitions, 1675 flow [2025-01-10 01:08:11,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 161 transitions, 1644 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:08:11,758 INFO L231 Difference]: Finished difference. Result has 137 places, 125 transitions, 1064 flow [2025-01-10 01:08:11,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1064, PETRI_PLACES=137, PETRI_TRANSITIONS=125} [2025-01-10 01:08:11,759 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 77 predicate places. [2025-01-10 01:08:11,759 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 125 transitions, 1064 flow [2025-01-10 01:08:11,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:11,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:11,759 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:11,766 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:08:11,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:11,960 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:08:11,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1840831197, now seen corresponding path program 2 times [2025-01-10 01:08:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986131432] [2025-01-10 01:08:11,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:08:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:11,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:08:11,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:08:11,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:08:11,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:08:12,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:12,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986131432] [2025-01-10 01:08:12,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986131432] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:12,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590776417] [2025-01-10 01:08:12,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:08:12,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:12,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:12,303 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:08:12,307 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:08:12,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:08:12,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:08:12,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:08:12,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:12,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:08:12,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:12,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:08:12,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:12,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:08:12,482 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:08:12,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:08:12,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:12,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:08:12,531 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:08:12,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:08:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:08:12,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:12,902 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 100 treesize of output 96 [2025-01-10 01:08:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:08:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590776417] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:13,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2025-01-10 01:08:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236980098] [2025-01-10 01:08:13,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:08:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:13,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:08:13,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:08:14,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-10 01:08:14,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 125 transitions, 1064 flow. Second operand has 22 states, 22 states have (on average 22.318181818181817) internal successors, (491), 22 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:14,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:14,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-10 01:08:14,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:16,686 INFO L124 PetriNetUnfolderBase]: 5502/8409 cut-off events. [2025-01-10 01:08:16,686 INFO L125 PetriNetUnfolderBase]: For 40421/41703 co-relation queries the response was YES. [2025-01-10 01:08:16,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36966 conditions, 8409 events. 5502/8409 cut-off events. For 40421/41703 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 46834 event pairs, 978 based on Foata normal form. 194/8478 useless extension candidates. Maximal degree in co-relation 31974. Up to 2405 conditions per place. [2025-01-10 01:08:16,743 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 224 selfloop transitions, 52 changer transitions 0/287 dead transitions. [2025-01-10 01:08:16,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 287 transitions, 2813 flow [2025-01-10 01:08:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:08:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 01:08:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 515 transitions. [2025-01-10 01:08:16,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4517543859649123 [2025-01-10 01:08:16,744 INFO L175 Difference]: Start difference. First operand has 137 places, 125 transitions, 1064 flow. Second operand 19 states and 515 transitions. [2025-01-10 01:08:16,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 287 transitions, 2813 flow [2025-01-10 01:08:16,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 287 transitions, 2755 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:08:16,784 INFO L231 Difference]: Finished difference. Result has 153 places, 138 transitions, 1332 flow [2025-01-10 01:08:16,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1332, PETRI_PLACES=153, PETRI_TRANSITIONS=138} [2025-01-10 01:08:16,785 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 93 predicate places. [2025-01-10 01:08:16,785 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 138 transitions, 1332 flow [2025-01-10 01:08:16,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 22.318181818181817) internal successors, (491), 22 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:16,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:16,785 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:16,792 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:08:16,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:16,986 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:08:16,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1231193081, now seen corresponding path program 1 times [2025-01-10 01:08:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:16,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781438077] [2025-01-10 01:08:16,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:16,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:16,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:08:17,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:08:17,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:17,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:08:17,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:17,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781438077] [2025-01-10 01:08:17,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781438077] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:17,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561660090] [2025-01-10 01:08:17,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:17,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:17,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:17,178 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:08:17,179 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:08:17,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:08:17,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:08:17,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:17,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:17,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:08:17,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:17,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:08:17,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:17,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:08:17,354 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:08:17,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:08:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:08:17,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:17,569 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 52 treesize of output 48 [2025-01-10 01:08:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:08:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561660090] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:17,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:17,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-10 01:08:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797041264] [2025-01-10 01:08:17,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:17,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:08:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:17,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:08:17,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:08:21,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:08:22,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-10 01:08:22,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 138 transitions, 1332 flow. Second operand has 20 states, 20 states have (on average 25.0) internal successors, (500), 20 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:22,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:22,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-10 01:08:22,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:23,327 INFO L124 PetriNetUnfolderBase]: 4452/7222 cut-off events. [2025-01-10 01:08:23,328 INFO L125 PetriNetUnfolderBase]: For 39219/40158 co-relation queries the response was YES. [2025-01-10 01:08:23,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33104 conditions, 7222 events. 4452/7222 cut-off events. For 39219/40158 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 42949 event pairs, 1554 based on Foata normal form. 131/7127 useless extension candidates. Maximal degree in co-relation 28991. Up to 1612 conditions per place. [2025-01-10 01:08:23,405 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 166 selfloop transitions, 48 changer transitions 0/230 dead transitions. [2025-01-10 01:08:23,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 230 transitions, 2389 flow [2025-01-10 01:08:23,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:08:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:08:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 402 transitions. [2025-01-10 01:08:23,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5153846153846153 [2025-01-10 01:08:23,406 INFO L175 Difference]: Start difference. First operand has 153 places, 138 transitions, 1332 flow. Second operand 13 states and 402 transitions. [2025-01-10 01:08:23,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 230 transitions, 2389 flow [2025-01-10 01:08:23,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 230 transitions, 2333 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-10 01:08:23,466 INFO L231 Difference]: Finished difference. Result has 161 places, 145 transitions, 1517 flow [2025-01-10 01:08:23,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1517, PETRI_PLACES=161, PETRI_TRANSITIONS=145} [2025-01-10 01:08:23,470 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 101 predicate places. [2025-01-10 01:08:23,471 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 145 transitions, 1517 flow [2025-01-10 01:08:23,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 25.0) internal successors, (500), 20 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:23,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:23,471 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:23,478 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:08:23,671 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,SelfDestructingSolverStorable27 [2025-01-10 01:08:23,672 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:08:23,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash -487719235, now seen corresponding path program 1 times [2025-01-10 01:08:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:23,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714621661] [2025-01-10 01:08:23,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:23,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:08:23,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:08:23,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:23,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:08:23,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:23,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714621661] [2025-01-10 01:08:23,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714621661] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:23,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889217339] [2025-01-10 01:08:23,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:23,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:23,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:23,912 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:08:23,921 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:08:23,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:08:24,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:08:24,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:24,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:24,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:08:24,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:08:24,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:24,210 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:08:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:08:24,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889217339] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:24,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:24,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-10 01:08:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491425470] [2025-01-10 01:08:24,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:24,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:08:24,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:24,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:08:24,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:08:24,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-01-10 01:08:24,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 145 transitions, 1517 flow. Second operand has 20 states, 20 states have (on average 27.85) internal successors, (557), 20 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:24,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:24,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-01-10 01:08:24,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:25,640 INFO L124 PetriNetUnfolderBase]: 4389/7048 cut-off events. [2025-01-10 01:08:25,640 INFO L125 PetriNetUnfolderBase]: For 45073/46016 co-relation queries the response was YES. [2025-01-10 01:08:25,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34249 conditions, 7048 events. 4389/7048 cut-off events. For 45073/46016 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 41141 event pairs, 2059 based on Foata normal form. 131/6976 useless extension candidates. Maximal degree in co-relation 30070. Up to 2693 conditions per place. [2025-01-10 01:08:25,693 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 164 selfloop transitions, 44 changer transitions 0/224 dead transitions. [2025-01-10 01:08:25,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 224 transitions, 2420 flow [2025-01-10 01:08:25,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:08:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:08:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 363 transitions. [2025-01-10 01:08:25,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.605 [2025-01-10 01:08:25,694 INFO L175 Difference]: Start difference. First operand has 161 places, 145 transitions, 1517 flow. Second operand 10 states and 363 transitions. [2025-01-10 01:08:25,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 224 transitions, 2420 flow [2025-01-10 01:08:25,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 224 transitions, 2388 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:08:25,755 INFO L231 Difference]: Finished difference. Result has 168 places, 147 transitions, 1613 flow [2025-01-10 01:08:25,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1613, PETRI_PLACES=168, PETRI_TRANSITIONS=147} [2025-01-10 01:08:25,756 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 108 predicate places. [2025-01-10 01:08:25,756 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 147 transitions, 1613 flow [2025-01-10 01:08:25,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 27.85) internal successors, (557), 20 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:25,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:25,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:25,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-01-10 01:08:25,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:25,957 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:08:25,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1708811061, now seen corresponding path program 1 times [2025-01-10 01:08:25,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643040188] [2025-01-10 01:08:25,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:25,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:08:25,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:08:25,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:25,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:08:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643040188] [2025-01-10 01:08:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643040188] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797063413] [2025-01-10 01:08:26,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:26,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:26,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:26,075 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:08:26,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 01:08:26,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:08:26,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:08:26,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:26,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:26,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:08:26,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:08:26,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:08:26,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797063413] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:26,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:08:26,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-01-10 01:08:26,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225051486] [2025-01-10 01:08:26,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:08:26,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:08:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:26,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:08:26,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:08:26,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:08:26,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 147 transitions, 1613 flow. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:26,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:26,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:08:26,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:26,903 INFO L124 PetriNetUnfolderBase]: 4643/7445 cut-off events. [2025-01-10 01:08:26,903 INFO L125 PetriNetUnfolderBase]: For 48413/49422 co-relation queries the response was YES. [2025-01-10 01:08:26,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35427 conditions, 7445 events. 4643/7445 cut-off events. For 48413/49422 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 43518 event pairs, 1356 based on Foata normal form. 270/7530 useless extension candidates. Maximal degree in co-relation 30863. Up to 3956 conditions per place. [2025-01-10 01:08:26,957 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 144 selfloop transitions, 18 changer transitions 0/176 dead transitions. [2025-01-10 01:08:26,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 176 transitions, 2104 flow [2025-01-10 01:08:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:08:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:08:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-01-10 01:08:26,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-01-10 01:08:26,959 INFO L175 Difference]: Start difference. First operand has 168 places, 147 transitions, 1613 flow. Second operand 5 states and 174 transitions. [2025-01-10 01:08:26,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 176 transitions, 2104 flow [2025-01-10 01:08:27,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 176 transitions, 2012 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-01-10 01:08:27,020 INFO L231 Difference]: Finished difference. Result has 165 places, 143 transitions, 1487 flow [2025-01-10 01:08:27,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1487, PETRI_PLACES=165, PETRI_TRANSITIONS=143} [2025-01-10 01:08:27,021 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 105 predicate places. [2025-01-10 01:08:27,021 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 143 transitions, 1487 flow [2025-01-10 01:08:27,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:27,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:27,021 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:27,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-10 01:08:27,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:27,222 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:08:27,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1411988395, now seen corresponding path program 2 times [2025-01-10 01:08:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:27,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743724793] [2025-01-10 01:08:27,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:08:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:27,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:08:27,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:08:27,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:08:27,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:08:27,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743724793] [2025-01-10 01:08:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743724793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340825801] [2025-01-10 01:08:27,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:08:27,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:27,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:27,361 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:08:27,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 01:08:27,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:08:27,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:08:27,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:08:27,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:27,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:08:27,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:08:27,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:08:27,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340825801] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:27,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:27,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-01-10 01:08:27,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983143009] [2025-01-10 01:08:27,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:27,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:08:27,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:27,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:08:27,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:08:27,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 01:08:27,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 143 transitions, 1487 flow. Second operand has 20 states, 20 states have (on average 28.85) internal successors, (577), 20 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:27,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:27,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 01:08:27,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:29,020 INFO L124 PetriNetUnfolderBase]: 6638/10337 cut-off events. [2025-01-10 01:08:29,020 INFO L125 PetriNetUnfolderBase]: For 66753/68521 co-relation queries the response was YES. [2025-01-10 01:08:29,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49206 conditions, 10337 events. 6638/10337 cut-off events. For 66753/68521 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 60037 event pairs, 2505 based on Foata normal form. 198/10344 useless extension candidates. Maximal degree in co-relation 41165. Up to 3369 conditions per place. [2025-01-10 01:08:29,079 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 183 selfloop transitions, 59 changer transitions 0/256 dead transitions. [2025-01-10 01:08:29,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 256 transitions, 2812 flow [2025-01-10 01:08:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:08:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:08:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 463 transitions. [2025-01-10 01:08:29,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5935897435897436 [2025-01-10 01:08:29,081 INFO L175 Difference]: Start difference. First operand has 165 places, 143 transitions, 1487 flow. Second operand 13 states and 463 transitions. [2025-01-10 01:08:29,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 256 transitions, 2812 flow [2025-01-10 01:08:29,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 256 transitions, 2780 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 01:08:29,163 INFO L231 Difference]: Finished difference. Result has 178 places, 149 transitions, 1750 flow [2025-01-10 01:08:29,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1750, PETRI_PLACES=178, PETRI_TRANSITIONS=149} [2025-01-10 01:08:29,164 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 118 predicate places. [2025-01-10 01:08:29,164 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 149 transitions, 1750 flow [2025-01-10 01:08:29,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 28.85) internal successors, (577), 20 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:29,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:29,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:29,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-01-10 01:08:29,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-01-10 01:08:29,366 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:08:29,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash 525463407, now seen corresponding path program 1 times [2025-01-10 01:08:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:29,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008923373] [2025-01-10 01:08:29,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:29,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:08:29,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:08:29,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:29,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:08:30,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008923373] [2025-01-10 01:08:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008923373] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941375136] [2025-01-10 01:08:30,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:08:30,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:30,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:30,369 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:08:30,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 01:08:30,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:08:30,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:08:30,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:30,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:30,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:08:30,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:30,743 INFO L349 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-01-10 01:08:30,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-01-10 01:08:31,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:08:31,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 137 treesize of output 509 [2025-01-10 01:08:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:08:33,317 INFO L312 TraceCheckSpWp]: Computing backward predicates...