./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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-three-array-min.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 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:12:23,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:12:23,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:12:23,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:12:23,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:12:23,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:12:23,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:12:23,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:12:23,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:12:23,477 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:12:23,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:12:23,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:12:23,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:12:23,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:12:23,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:12:23,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:12:23,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:12:23,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:12:23,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:12:23,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:12:23,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:12:23,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:12:23,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:12:23,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:12:23,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:12:23,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:12:23,479 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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-02-06 13:12:23,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:12:23,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:12:23,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:12:23,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:12:23,750 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:12:23,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-02-06 13:12:24,927 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58b4cd4f3/c0afa996511346a6a730283a84e630d7/FLAGa59347425 [2025-02-06 13:12:25,163 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:12:25,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-02-06 13:12:25,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58b4cd4f3/c0afa996511346a6a730283a84e630d7/FLAGa59347425 [2025-02-06 13:12:25,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58b4cd4f3/c0afa996511346a6a730283a84e630d7 [2025-02-06 13:12:25,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:12:25,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:12:25,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:12:25,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:12:25,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:12:25,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e05c42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25, skipping insertion in model container [2025-02-06 13:12:25,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:12:25,643 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:12:25,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:12:25,662 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:12:25,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:12:25,695 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:12:25,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25 WrapperNode [2025-02-06 13:12:25,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:12:25,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:12:25,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:12:25,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:12:25,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,727 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 212 [2025-02-06 13:12:25,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:12:25,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:12:25,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:12:25,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:12:25,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,749 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 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-02-06 13:12:25,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:12:25,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:12:25,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:12:25,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:12:25,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (1/1) ... [2025-02-06 13:12:25,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:12:25,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:25,801 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-02-06 13:12:25,803 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-02-06 13:12:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:12:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:12:25,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:12:25,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:12:25,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:12:25,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:12:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:12:25,823 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:12:25,904 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:12:25,906 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:12:26,328 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:12:26,329 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:12:26,575 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:12:26,575 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:12:26,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:12:26 BoogieIcfgContainer [2025-02-06 13:12:26,576 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:12:26,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:12:26,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:12:26,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:12:26,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:12:25" (1/3) ... [2025-02-06 13:12:26,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3824b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:12:26, skipping insertion in model container [2025-02-06 13:12:26,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:25" (2/3) ... [2025-02-06 13:12:26,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3824b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:12:26, skipping insertion in model container [2025-02-06 13:12:26,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:12:26" (3/3) ... [2025-02-06 13:12:26,586 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-02-06 13:12:26,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:12:26,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 81 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2025-02-06 13:12:26,602 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:12:26,667 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 13:12:26,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 199 flow [2025-02-06 13:12:26,725 INFO L124 PetriNetUnfolderBase]: 9/86 cut-off events. [2025-02-06 13:12:26,728 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:12:26,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 9/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 235 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2025-02-06 13:12:26,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 89 transitions, 199 flow [2025-02-06 13:12:26,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 85 transitions, 188 flow [2025-02-06 13:12:26,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:12:26,759 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;@31707ad1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:12:26,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-02-06 13:12:26,763 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:12:26,764 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:12:26,764 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:12:26,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:26,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:12:26,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:12:26,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash 796759, now seen corresponding path program 1 times [2025-02-06 13:12:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:26,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408695126] [2025-02-06 13:12:26,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:26,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:12:26,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:12:26,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:26,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:26,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408695126] [2025-02-06 13:12:26,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408695126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:26,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:26,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:12:26,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444819764] [2025-02-06 13:12:26,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:26,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:12:27,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:27,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:12:27,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:12:27,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-02-06 13:12:27,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:27,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:27,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-02-06 13:12:27,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:27,755 INFO L124 PetriNetUnfolderBase]: 3369/5065 cut-off events. [2025-02-06 13:12:27,755 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-02-06 13:12:27,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9758 conditions, 5065 events. 3369/5065 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 31321 event pairs, 2470 based on Foata normal form. 1/3539 useless extension candidates. Maximal degree in co-relation 9147. Up to 4445 conditions per place. [2025-02-06 13:12:27,792 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 47 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-02-06 13:12:27,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 272 flow [2025-02-06 13:12:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:12:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:12:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2025-02-06 13:12:27,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5767790262172284 [2025-02-06 13:12:27,804 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 188 flow. Second operand 3 states and 154 transitions. [2025-02-06 13:12:27,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 272 flow [2025-02-06 13:12:27,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 260 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:12:27,817 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 166 flow [2025-02-06 13:12:27,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2025-02-06 13:12:27,822 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -11 predicate places. [2025-02-06 13:12:27,822 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 166 flow [2025-02-06 13:12:27,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:27,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:27,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:12:27,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:12:27,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:12:27,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 796760, now seen corresponding path program 1 times [2025-02-06 13:12:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505005282] [2025-02-06 13:12:27,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:27,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:12:27,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:12:27,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:27,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:28,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505005282] [2025-02-06 13:12:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505005282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:28,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:28,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:12:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413844691] [2025-02-06 13:12:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:28,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:12:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:28,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:12:28,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:12:28,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-02-06 13:12:28,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:28,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:28,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-02-06 13:12:28,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:28,589 INFO L124 PetriNetUnfolderBase]: 3370/5068 cut-off events. [2025-02-06 13:12:28,589 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-02-06 13:12:28,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9610 conditions, 5068 events. 3370/5068 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 31310 event pairs, 2470 based on Foata normal form. 0/3538 useless extension candidates. Maximal degree in co-relation 9573. Up to 4458 conditions per place. [2025-02-06 13:12:28,623 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 52 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-02-06 13:12:28,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 282 flow [2025-02-06 13:12:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:12:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:12:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-02-06 13:12:28,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805243445692884 [2025-02-06 13:12:28,625 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 166 flow. Second operand 3 states and 155 transitions. [2025-02-06 13:12:28,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 282 flow [2025-02-06 13:12:28,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 81 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:12:28,628 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 181 flow [2025-02-06 13:12:28,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2025-02-06 13:12:28,629 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2025-02-06 13:12:28,629 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 181 flow [2025-02-06 13:12:28,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:28,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:28,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 13:12:28,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:12:28,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:12:28,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash 24701423, now seen corresponding path program 1 times [2025-02-06 13:12:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:28,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851461716] [2025-02-06 13:12:28,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:28,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:12:28,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:12:28,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:28,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:28,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:28,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851461716] [2025-02-06 13:12:28,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851461716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:28,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:28,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:12:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440448415] [2025-02-06 13:12:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:28,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:12:28,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:28,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:12:28,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:12:28,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-02-06 13:12:28,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 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-02-06 13:12:28,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:28,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-02-06 13:12:28,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:29,055 INFO L124 PetriNetUnfolderBase]: 3369/5067 cut-off events. [2025-02-06 13:12:29,056 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-02-06 13:12:29,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9610 conditions, 5067 events. 3369/5067 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 31304 event pairs, 2470 based on Foata normal form. 1/3542 useless extension candidates. Maximal degree in co-relation 9597. Up to 4454 conditions per place. [2025-02-06 13:12:29,089 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 49 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2025-02-06 13:12:29,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 80 transitions, 280 flow [2025-02-06 13:12:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:12:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:12:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-02-06 13:12:29,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.599250936329588 [2025-02-06 13:12:29,091 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 181 flow. Second operand 3 states and 160 transitions. [2025-02-06 13:12:29,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 80 transitions, 280 flow [2025-02-06 13:12:29,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:12:29,092 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 178 flow [2025-02-06 13:12:29,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2025-02-06 13:12:29,093 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2025-02-06 13:12:29,093 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 178 flow [2025-02-06 13:12:29,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 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-02-06 13:12:29,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:29,094 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:12:29,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:12:29,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:12:29,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:29,095 INFO L85 PathProgramCache]: Analyzing trace with hash 765710476, now seen corresponding path program 1 times [2025-02-06 13:12:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:29,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393248136] [2025-02-06 13:12:29,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:29,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:29,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:12:29,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:12:29,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:29,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:29,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:29,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393248136] [2025-02-06 13:12:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393248136] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:29,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296870477] [2025-02-06 13:12:29,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:29,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:29,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:29,325 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-02-06 13:12:29,335 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-02-06 13:12:29,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:12:29,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:12:29,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:29,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:29,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:12:29,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:29,445 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-02-06 13:12:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:29,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:29,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296870477] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:29,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:29,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 13:12:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958561250] [2025-02-06 13:12:29,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:29,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:12:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:29,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:12:29,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:12:29,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-02-06 13:12:29,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 178 flow. Second operand has 11 states, 11 states have (on average 34.36363636363637) internal successors, (378), 11 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:29,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:29,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-02-06 13:12:29,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:30,450 INFO L124 PetriNetUnfolderBase]: 3369/5066 cut-off events. [2025-02-06 13:12:30,450 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-06 13:12:30,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9611 conditions, 5066 events. 3369/5066 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 31304 event pairs, 2470 based on Foata normal form. 0/3538 useless extension candidates. Maximal degree in co-relation 9597. Up to 4453 conditions per place. [2025-02-06 13:12:30,481 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 48 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2025-02-06 13:12:30,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 282 flow [2025-02-06 13:12:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:12:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:12:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-02-06 13:12:30,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49213483146067416 [2025-02-06 13:12:30,483 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 178 flow. Second operand 5 states and 219 transitions. [2025-02-06 13:12:30,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 282 flow [2025-02-06 13:12:30,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:12:30,484 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 188 flow [2025-02-06 13:12:30,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-02-06 13:12:30,485 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-02-06 13:12:30,485 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 188 flow [2025-02-06 13:12:30,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.36363636363637) internal successors, (378), 11 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:30,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:30,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:12:30,493 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-02-06 13:12:30,689 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-02-06 13:12:30,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:12:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2032777157, now seen corresponding path program 1 times [2025-02-06 13:12:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413870987] [2025-02-06 13:12:30,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:30,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:12:30,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:12:30,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:30,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:30,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:30,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413870987] [2025-02-06 13:12:30,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413870987] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:30,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450545872] [2025-02-06 13:12:30,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:30,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:30,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:30,889 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-02-06 13:12:30,896 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-02-06 13:12:30,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:12:30,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:12:30,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:30,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:30,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:12:30,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:30,966 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-02-06 13:12:31,075 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:12:31,075 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-02-06 13:12:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:31,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:31,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450545872] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:31,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:12:31,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2025-02-06 13:12:31,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344468888] [2025-02-06 13:12:31,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:31,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:12:31,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:31,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:12:31,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:12:31,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-02-06 13:12:31,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:31,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:31,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-02-06 13:12:31,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:31,668 INFO L124 PetriNetUnfolderBase]: 3371/5072 cut-off events. [2025-02-06 13:12:31,668 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-06 13:12:31,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 5072 events. 3371/5072 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 31396 event pairs, 2470 based on Foata normal form. 0/3542 useless extension candidates. Maximal degree in co-relation 9601. Up to 4456 conditions per place. [2025-02-06 13:12:31,695 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 52 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2025-02-06 13:12:31,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 85 transitions, 318 flow [2025-02-06 13:12:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:12:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:12:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-02-06 13:12:31,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5421348314606742 [2025-02-06 13:12:31,697 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 188 flow. Second operand 4 states and 193 transitions. [2025-02-06 13:12:31,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 85 transitions, 318 flow [2025-02-06 13:12:31,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 308 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 13:12:31,703 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 225 flow [2025-02-06 13:12:31,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2025-02-06 13:12:31,703 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -5 predicate places. [2025-02-06 13:12:31,704 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 225 flow [2025-02-06 13:12:31,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:31,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:31,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:31,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:12:31,904 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-02-06 13:12:31,905 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:12:31,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:31,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1408419357, now seen corresponding path program 1 times [2025-02-06 13:12:31,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:31,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359122442] [2025-02-06 13:12:31,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:31,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:31,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:12:31,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:12:31,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:31,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:12:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:31,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359122442] [2025-02-06 13:12:31,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359122442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:31,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:31,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:12:31,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787339040] [2025-02-06 13:12:31,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:31,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:12:31,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:31,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:12:31,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:12:31,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-02-06 13:12:31,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:31,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:31,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-02-06 13:12:31,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:32,384 INFO L124 PetriNetUnfolderBase]: 3369/5070 cut-off events. [2025-02-06 13:12:32,385 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-06 13:12:32,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9636 conditions, 5070 events. 3369/5070 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 31339 event pairs, 2470 based on Foata normal form. 2/3548 useless extension candidates. Maximal degree in co-relation 9606. Up to 4453 conditions per place. [2025-02-06 13:12:32,406 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 49 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-02-06 13:12:32,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 329 flow [2025-02-06 13:12:32,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:12:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:12:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2025-02-06 13:12:32,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5646067415730337 [2025-02-06 13:12:32,408 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 225 flow. Second operand 4 states and 201 transitions. [2025-02-06 13:12:32,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 329 flow [2025-02-06 13:12:32,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:12:32,410 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 221 flow [2025-02-06 13:12:32,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-02-06 13:12:32,410 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2025-02-06 13:12:32,410 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 221 flow [2025-02-06 13:12:32,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:32,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:32,410 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:32,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:12:32,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:12:32,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash 711296668, now seen corresponding path program 1 times [2025-02-06 13:12:32,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:32,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072878125] [2025-02-06 13:12:32,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:32,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:32,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:12:32,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:12:32,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:32,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:32,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072878125] [2025-02-06 13:12:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072878125] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:32,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816639156] [2025-02-06 13:12:32,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:32,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:32,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:32,509 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-02-06 13:12:32,509 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-02-06 13:12:32,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:12:32,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:12:32,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:32,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:32,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 13:12:32,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:32,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816639156] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:32,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 13:12:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300561677] [2025-02-06 13:12:32,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:32,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:12:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:12:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:12:32,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-02-06 13:12:32,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 221 flow. Second operand has 13 states, 13 states have (on average 37.53846153846154) internal successors, (488), 13 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:32,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:32,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-02-06 13:12:32,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:33,397 INFO L124 PetriNetUnfolderBase]: 6737/10139 cut-off events. [2025-02-06 13:12:33,397 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-02-06 13:12:33,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19266 conditions, 10139 events. 6737/10139 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 66301 event pairs, 4940 based on Foata normal form. 2/7113 useless extension candidates. Maximal degree in co-relation 9629. Up to 4451 conditions per place. [2025-02-06 13:12:33,443 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 87 selfloop transitions, 22 changer transitions 0/137 dead transitions. [2025-02-06 13:12:33,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 137 transitions, 598 flow [2025-02-06 13:12:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:12:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:12:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 399 transitions. [2025-02-06 13:12:33,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5603932584269663 [2025-02-06 13:12:33,445 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 221 flow. Second operand 8 states and 399 transitions. [2025-02-06 13:12:33,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 137 transitions, 598 flow [2025-02-06 13:12:33,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 137 transitions, 576 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:12:33,447 INFO L231 Difference]: Finished difference. Result has 88 places, 94 transitions, 338 flow [2025-02-06 13:12:33,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=338, PETRI_PLACES=88, PETRI_TRANSITIONS=94} [2025-02-06 13:12:33,448 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2025-02-06 13:12:33,448 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 94 transitions, 338 flow [2025-02-06 13:12:33,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 37.53846153846154) internal successors, (488), 13 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:33,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:33,448 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-02-06 13:12:33,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:12:33,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:33,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:12:33,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash -367862040, now seen corresponding path program 2 times [2025-02-06 13:12:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:33,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165538405] [2025-02-06 13:12:33,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:12:33,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:33,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-06 13:12:33,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:12:33,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:12:33,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:33,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:33,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165538405] [2025-02-06 13:12:33,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165538405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:33,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931700841] [2025-02-06 13:12:33,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:12:33,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:33,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:33,860 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-02-06 13:12:33,862 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-02-06 13:12:33,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-06 13:12:33,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:12:33,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:12:33,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:33,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 13:12:33,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:33,935 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-02-06 13:12:34,101 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:12:34,101 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-02-06 13:12:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:34,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:12:34,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931700841] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:34,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:34,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-02-06 13:12:34,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277745398] [2025-02-06 13:12:34,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:34,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:12:34,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:34,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:12:34,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:12:35,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-02-06 13:12:35,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 94 transitions, 338 flow. Second operand has 18 states, 18 states have (on average 34.666666666666664) internal successors, (624), 18 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:35,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:35,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-02-06 13:12:35,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:37,435 INFO L124 PetriNetUnfolderBase]: 10109/15220 cut-off events. [2025-02-06 13:12:37,435 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-02-06 13:12:37,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29002 conditions, 15220 events. 10109/15220 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 107066 event pairs, 7410 based on Foata normal form. 10/10698 useless extension candidates. Maximal degree in co-relation 19285. Up to 8900 conditions per place. [2025-02-06 13:12:37,524 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 100 selfloop transitions, 42 changer transitions 0/168 dead transitions. [2025-02-06 13:12:37,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 168 transitions, 929 flow [2025-02-06 13:12:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 13:12:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 13:12:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 647 transitions. [2025-02-06 13:12:37,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4846441947565543 [2025-02-06 13:12:37,531 INFO L175 Difference]: Start difference. First operand has 88 places, 94 transitions, 338 flow. Second operand 15 states and 647 transitions. [2025-02-06 13:12:37,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 168 transitions, 929 flow [2025-02-06 13:12:37,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 168 transitions, 891 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-02-06 13:12:37,536 INFO L231 Difference]: Finished difference. Result has 107 places, 117 transitions, 616 flow [2025-02-06 13:12:37,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=616, PETRI_PLACES=107, PETRI_TRANSITIONS=117} [2025-02-06 13:12:37,539 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 21 predicate places. [2025-02-06 13:12:37,539 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 117 transitions, 616 flow [2025-02-06 13:12:37,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 34.666666666666664) internal successors, (624), 18 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:37,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:37,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:37,549 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-02-06 13:12:37,741 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,SelfDestructingSolverStorable7 [2025-02-06 13:12:37,742 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:12:37,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1127888658, now seen corresponding path program 1 times [2025-02-06 13:12:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:37,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454930927] [2025-02-06 13:12:37,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:37,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:37,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:12:37,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:12:37,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:37,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:12:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:37,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454930927] [2025-02-06 13:12:37,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454930927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:37,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:37,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:12:37,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855847914] [2025-02-06 13:12:37,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:37,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:12:37,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:37,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:12:37,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:12:37,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 89 [2025-02-06 13:12:37,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 117 transitions, 616 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:37,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:37,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 89 [2025-02-06 13:12:37,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:38,985 INFO L124 PetriNetUnfolderBase]: 10220/15898 cut-off events. [2025-02-06 13:12:38,986 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2025-02-06 13:12:39,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29949 conditions, 15898 events. 10220/15898 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 112388 event pairs, 7596 based on Foata normal form. 0/11263 useless extension candidates. Maximal degree in co-relation 29874. Up to 13519 conditions per place. [2025-02-06 13:12:39,076 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 79 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2025-02-06 13:12:39,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 112 transitions, 786 flow [2025-02-06 13:12:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:12:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:12:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2025-02-06 13:12:39,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42696629213483145 [2025-02-06 13:12:39,080 INFO L175 Difference]: Start difference. First operand has 107 places, 117 transitions, 616 flow. Second operand 5 states and 190 transitions. [2025-02-06 13:12:39,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 112 transitions, 786 flow [2025-02-06 13:12:39,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 112 transitions, 737 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-06 13:12:39,084 INFO L231 Difference]: Finished difference. Result has 101 places, 112 transitions, 579 flow [2025-02-06 13:12:39,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=579, PETRI_PLACES=101, PETRI_TRANSITIONS=112} [2025-02-06 13:12:39,086 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 15 predicate places. [2025-02-06 13:12:39,086 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 112 transitions, 579 flow [2025-02-06 13:12:39,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:39,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:39,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:39,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:12:39,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:12:39,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1127888657, now seen corresponding path program 1 times [2025-02-06 13:12:39,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:39,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20807867] [2025-02-06 13:12:39,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:39,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:39,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:12:39,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:12:39,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:39,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:12:39,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:39,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20807867] [2025-02-06 13:12:39,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20807867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:39,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581296634] [2025-02-06 13:12:39,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:39,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:39,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:39,337 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-02-06 13:12:39,339 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-02-06 13:12:39,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:12:39,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:12:39,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:39,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:39,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 13:12:39,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:39,415 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-02-06 13:12:39,419 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-02-06 13:12:39,456 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:12:39,457 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-02-06 13:12:39,465 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-02-06 13:12:39,568 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-02-06 13:12:39,568 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-02-06 13:12:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:12:39,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:12:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581296634] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:12:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2025-02-06 13:12:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713235502] [2025-02-06 13:12:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:40,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:12:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:40,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:12:40,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:12:40,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-02-06 13:12:40,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 112 transitions, 579 flow. Second operand has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:40,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:40,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-02-06 13:12:40,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:48,682 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-02-06 13:12:52,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:12:56,717 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-02-06 13:13:00,723 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-02-06 13:13:04,738 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-02-06 13:13:08,803 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-02-06 13:13:12,810 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-02-06 13:13:16,814 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-02-06 13:13:20,818 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-02-06 13:13:24,831 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-02-06 13:13:28,845 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-02-06 13:13:32,883 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-02-06 13:13:36,916 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-02-06 13:13:37,834 INFO L124 PetriNetUnfolderBase]: 9107/13708 cut-off events. [2025-02-06 13:13:37,834 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-02-06 13:13:37,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26218 conditions, 13708 events. 9107/13708 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 95533 event pairs, 6639 based on Foata normal form. 0/9748 useless extension candidates. Maximal degree in co-relation 26145. Up to 12022 conditions per place. [2025-02-06 13:13:37,962 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 76 selfloop transitions, 14 changer transitions 0/111 dead transitions. [2025-02-06 13:13:37,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 111 transitions, 761 flow [2025-02-06 13:13:37,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:13:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:13:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 251 transitions. [2025-02-06 13:13:37,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4700374531835206 [2025-02-06 13:13:37,964 INFO L175 Difference]: Start difference. First operand has 101 places, 112 transitions, 579 flow. Second operand 6 states and 251 transitions. [2025-02-06 13:13:37,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 111 transitions, 761 flow [2025-02-06 13:13:37,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 111 transitions, 746 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:13:37,967 INFO L231 Difference]: Finished difference. Result has 101 places, 110 transitions, 588 flow [2025-02-06 13:13:37,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=101, PETRI_TRANSITIONS=110} [2025-02-06 13:13:37,968 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 15 predicate places. [2025-02-06 13:13:37,968 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 110 transitions, 588 flow [2025-02-06 13:13:37,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:37,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:37,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:37,975 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-02-06 13:13:38,169 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,SelfDestructingSolverStorable9 [2025-02-06 13:13:38,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:38,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash -604809206, now seen corresponding path program 1 times [2025-02-06 13:13:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729946293] [2025-02-06 13:13:38,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:38,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:13:38,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:13:38,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:38,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:13:38,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:38,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729946293] [2025-02-06 13:13:38,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729946293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:38,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:38,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:13:38,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314473649] [2025-02-06 13:13:38,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:38,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:13:38,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:38,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:13:38,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:13:38,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 89 [2025-02-06 13:13:38,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 110 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:38,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:38,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 89 [2025-02-06 13:13:38,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:39,042 INFO L124 PetriNetUnfolderBase]: 9359/14074 cut-off events. [2025-02-06 13:13:39,042 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2025-02-06 13:13:39,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27020 conditions, 14074 events. 9359/14074 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 94743 event pairs, 7008 based on Foata normal form. 0/10330 useless extension candidates. Maximal degree in co-relation 26947. Up to 12442 conditions per place. [2025-02-06 13:13:39,105 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 75 selfloop transitions, 13 changer transitions 0/105 dead transitions. [2025-02-06 13:13:39,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 754 flow [2025-02-06 13:13:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:13:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:13:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-02-06 13:13:39,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4337078651685393 [2025-02-06 13:13:39,106 INFO L175 Difference]: Start difference. First operand has 101 places, 110 transitions, 588 flow. Second operand 5 states and 193 transitions. [2025-02-06 13:13:39,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 754 flow [2025-02-06 13:13:39,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 105 transitions, 739 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:13:39,108 INFO L231 Difference]: Finished difference. Result has 97 places, 105 transitions, 589 flow [2025-02-06 13:13:39,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=589, PETRI_PLACES=97, PETRI_TRANSITIONS=105} [2025-02-06 13:13:39,109 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 11 predicate places. [2025-02-06 13:13:39,109 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 105 transitions, 589 flow [2025-02-06 13:13:39,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:39,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:39,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:39,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:13:39,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:39,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash -604809205, now seen corresponding path program 1 times [2025-02-06 13:13:39,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:39,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602384594] [2025-02-06 13:13:39,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:39,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:13:39,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:13:39,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:39,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:39,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:39,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602384594] [2025-02-06 13:13:39,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602384594] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:39,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977721572] [2025-02-06 13:13:39,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:39,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:39,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:39,252 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-02-06 13:13:39,255 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-02-06 13:13:39,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:13:39,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:13:39,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:39,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:39,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 13:13:39,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:39,334 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-02-06 13:13:39,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:13:39,375 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-02-06 13:13:39,383 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:13:39,383 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-02-06 13:13:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:39,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:39,474 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-02-06 13:13:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:39,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977721572] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:13:39,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:13:39,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 13:13:39,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558417816] [2025-02-06 13:13:39,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:13:39,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:13:39,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:39,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:13:39,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:13:40,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 89 [2025-02-06 13:13:40,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 105 transitions, 589 flow. Second operand has 10 states, 10 states have (on average 33.5) internal successors, (335), 10 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:40,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:40,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 89 [2025-02-06 13:13:40,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:40,774 INFO L124 PetriNetUnfolderBase]: 8105/12196 cut-off events. [2025-02-06 13:13:40,774 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2025-02-06 13:13:40,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23384 conditions, 12196 events. 8105/12196 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 82171 event pairs, 5868 based on Foata normal form. 0/8845 useless extension candidates. Maximal degree in co-relation 23311. Up to 10702 conditions per place. [2025-02-06 13:13:40,843 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 66 selfloop transitions, 23 changer transitions 0/105 dead transitions. [2025-02-06 13:13:40,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 775 flow [2025-02-06 13:13:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:13:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:13:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 303 transitions. [2025-02-06 13:13:40,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425561797752809 [2025-02-06 13:13:40,844 INFO L175 Difference]: Start difference. First operand has 97 places, 105 transitions, 589 flow. Second operand 8 states and 303 transitions. [2025-02-06 13:13:40,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 775 flow [2025-02-06 13:13:40,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 105 transitions, 756 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:13:40,848 INFO L231 Difference]: Finished difference. Result has 99 places, 103 transitions, 612 flow [2025-02-06 13:13:40,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=612, PETRI_PLACES=99, PETRI_TRANSITIONS=103} [2025-02-06 13:13:40,849 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 13 predicate places. [2025-02-06 13:13:40,849 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 103 transitions, 612 flow [2025-02-06 13:13:40,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.5) internal successors, (335), 10 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:40,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:40,849 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1] [2025-02-06 13:13:40,857 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-02-06 13:13:41,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 13:13:41,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:41,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1371047851, now seen corresponding path program 3 times [2025-02-06 13:13:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:41,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240804990] [2025-02-06 13:13:41,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:13:41,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:41,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-02-06 13:13:41,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 14 statements. [2025-02-06 13:13:41,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:13:41,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:13:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240804990] [2025-02-06 13:13:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240804990] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420119982] [2025-02-06 13:13:41,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:13:41,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:41,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:41,256 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-02-06 13:13:41,263 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-02-06 13:13:41,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-02-06 13:13:41,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 14 statements. [2025-02-06 13:13:41,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:13:41,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:41,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 13:13:41,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:41,352 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-02-06 13:13:41,439 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:13:41,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2025-02-06 13:13:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:13:41,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:13:41,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420119982] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:13:41,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:13:41,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-02-06 13:13:41,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542085142] [2025-02-06 13:13:41,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:13:41,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 13:13:41,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:41,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 13:13:41,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-02-06 13:13:42,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-02-06 13:13:42,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 103 transitions, 612 flow. Second operand has 17 states, 17 states have (on average 34.76470588235294) internal successors, (591), 17 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:42,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:42,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-02-06 13:13:42,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:43,179 INFO L124 PetriNetUnfolderBase]: 8105/12192 cut-off events. [2025-02-06 13:13:43,179 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2025-02-06 13:13:43,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23377 conditions, 12192 events. 8105/12192 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 82098 event pairs, 5868 based on Foata normal form. 4/8845 useless extension candidates. Maximal degree in co-relation 23328. Up to 10702 conditions per place. [2025-02-06 13:13:43,243 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 40 selfloop transitions, 49 changer transitions 0/103 dead transitions. [2025-02-06 13:13:43,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 103 transitions, 778 flow [2025-02-06 13:13:43,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:13:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:13:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 253 transitions. [2025-02-06 13:13:43,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4737827715355805 [2025-02-06 13:13:43,245 INFO L175 Difference]: Start difference. First operand has 99 places, 103 transitions, 612 flow. Second operand 6 states and 253 transitions. [2025-02-06 13:13:43,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 103 transitions, 778 flow [2025-02-06 13:13:43,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 103 transitions, 721 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-02-06 13:13:43,248 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 693 flow [2025-02-06 13:13:43,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2025-02-06 13:13:43,249 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 9 predicate places. [2025-02-06 13:13:43,249 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 693 flow [2025-02-06 13:13:43,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 34.76470588235294) internal successors, (591), 17 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:43,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:43,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:43,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:13:43,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:43,450 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:43,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2091967778, now seen corresponding path program 1 times [2025-02-06 13:13:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839759089] [2025-02-06 13:13:43,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:43,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:13:43,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:13:43,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:43,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:43,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:43,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839759089] [2025-02-06 13:13:43,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839759089] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:43,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070734956] [2025-02-06 13:13:43,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:43,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:43,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:43,539 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-02-06 13:13:43,540 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-02-06 13:13:43,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:13:43,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:13:43,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:43,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:43,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:13:43,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:43,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:43,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070734956] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:13:43,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:13:43,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:13:43,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59744978] [2025-02-06 13:13:43,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:13:43,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:13:43,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:43,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:13:43,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:13:43,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 89 [2025-02-06 13:13:43,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 693 flow. Second operand has 12 states, 12 states have (on average 37.333333333333336) internal successors, (448), 12 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:43,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:43,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 89 [2025-02-06 13:13:43,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:44,348 INFO L124 PetriNetUnfolderBase]: 5063/7807 cut-off events. [2025-02-06 13:13:44,348 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2025-02-06 13:13:44,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15178 conditions, 7807 events. 5063/7807 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 49349 event pairs, 3330 based on Foata normal form. 0/5685 useless extension candidates. Maximal degree in co-relation 14944. Up to 4029 conditions per place. [2025-02-06 13:13:44,373 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 98 selfloop transitions, 44 changer transitions 0/155 dead transitions. [2025-02-06 13:13:44,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 155 transitions, 1101 flow [2025-02-06 13:13:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:13:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:13:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 434 transitions. [2025-02-06 13:13:44,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5418227215980025 [2025-02-06 13:13:44,374 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 693 flow. Second operand 9 states and 434 transitions. [2025-02-06 13:13:44,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 155 transitions, 1101 flow [2025-02-06 13:13:44,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 155 transitions, 1076 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 13:13:44,378 INFO L231 Difference]: Finished difference. Result has 103 places, 105 transitions, 777 flow [2025-02-06 13:13:44,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=777, PETRI_PLACES=103, PETRI_TRANSITIONS=105} [2025-02-06 13:13:44,378 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 17 predicate places. [2025-02-06 13:13:44,378 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 105 transitions, 777 flow [2025-02-06 13:13:44,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 37.333333333333336) internal successors, (448), 12 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:44,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:44,378 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-02-06 13:13:44,386 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-02-06 13:13:44,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:44,579 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:44,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:44,580 INFO L85 PathProgramCache]: Analyzing trace with hash 313798954, now seen corresponding path program 1 times [2025-02-06 13:13:44,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:44,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506455327] [2025-02-06 13:13:44,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:44,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:44,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:13:44,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:13:44,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:44,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:44,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506455327] [2025-02-06 13:13:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506455327] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679957354] [2025-02-06 13:13:44,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:44,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:44,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:44,647 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-02-06 13:13:44,649 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-02-06 13:13:44,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:13:44,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:13:44,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:44,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:44,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:13:44,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:44,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:44,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679957354] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:13:44,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:13:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:13:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301582005] [2025-02-06 13:13:44,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:13:44,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:13:44,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:44,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:13:44,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:13:44,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 89 [2025-02-06 13:13:44,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 105 transitions, 777 flow. Second operand has 12 states, 12 states have (on average 37.583333333333336) internal successors, (451), 12 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:44,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:44,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 89 [2025-02-06 13:13:44,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:45,261 INFO L124 PetriNetUnfolderBase]: 3691/5705 cut-off events. [2025-02-06 13:13:45,261 INFO L125 PetriNetUnfolderBase]: For 1059/1202 co-relation queries the response was YES. [2025-02-06 13:13:45,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11892 conditions, 5705 events. 3691/5705 cut-off events. For 1059/1202 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 32447 event pairs, 2517 based on Foata normal form. 0/4291 useless extension candidates. Maximal degree in co-relation 11636. Up to 4024 conditions per place. [2025-02-06 13:13:45,283 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 85 selfloop transitions, 44 changer transitions 0/142 dead transitions. [2025-02-06 13:13:45,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 142 transitions, 1133 flow [2025-02-06 13:13:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:13:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:13:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 421 transitions. [2025-02-06 13:13:45,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255930087390761 [2025-02-06 13:13:45,284 INFO L175 Difference]: Start difference. First operand has 103 places, 105 transitions, 777 flow. Second operand 9 states and 421 transitions. [2025-02-06 13:13:45,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 142 transitions, 1133 flow [2025-02-06 13:13:45,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 142 transitions, 1052 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:13:45,288 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 801 flow [2025-02-06 13:13:45,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=801, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2025-02-06 13:13:45,288 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 21 predicate places. [2025-02-06 13:13:45,288 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 801 flow [2025-02-06 13:13:45,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 37.583333333333336) internal successors, (451), 12 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:45,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:45,289 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] [2025-02-06 13:13:45,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 13:13:45,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:45,489 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:45,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:45,490 INFO L85 PathProgramCache]: Analyzing trace with hash 191265112, now seen corresponding path program 1 times [2025-02-06 13:13:45,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:45,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103623365] [2025-02-06 13:13:45,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:45,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:45,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:13:45,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:13:45,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:45,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:45,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:45,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103623365] [2025-02-06 13:13:45,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103623365] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:45,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186436474] [2025-02-06 13:13:45,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:45,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:45,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:45,577 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-02-06 13:13:45,578 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-02-06 13:13:45,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:13:45,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:13:45,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:45,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:45,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:13:45,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:45,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:13:45,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186436474] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:13:45,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:13:45,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:13:45,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921809617] [2025-02-06 13:13:45,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:13:45,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:13:45,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:45,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:13:45,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:13:45,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 89 [2025-02-06 13:13:45,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 801 flow. Second operand has 12 states, 12 states have (on average 37.833333333333336) internal successors, (454), 12 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:45,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:45,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 89 [2025-02-06 13:13:45,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:46,413 INFO L124 PetriNetUnfolderBase]: 3286/4884 cut-off events. [2025-02-06 13:13:46,413 INFO L125 PetriNetUnfolderBase]: For 1276/1540 co-relation queries the response was YES. [2025-02-06 13:13:46,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10813 conditions, 4884 events. 3286/4884 cut-off events. For 1276/1540 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 27228 event pairs, 2048 based on Foata normal form. 0/3554 useless extension candidates. Maximal degree in co-relation 10554. Up to 3583 conditions per place. [2025-02-06 13:13:46,435 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 94 selfloop transitions, 44 changer transitions 0/151 dead transitions. [2025-02-06 13:13:46,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 151 transitions, 1207 flow [2025-02-06 13:13:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:13:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:13:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 465 transitions. [2025-02-06 13:13:46,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5224719101123596 [2025-02-06 13:13:46,437 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 801 flow. Second operand 10 states and 465 transitions. [2025-02-06 13:13:46,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 151 transitions, 1207 flow [2025-02-06 13:13:46,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 151 transitions, 1126 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:13:46,485 INFO L231 Difference]: Finished difference. Result has 113 places, 109 transitions, 854 flow [2025-02-06 13:13:46,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=854, PETRI_PLACES=113, PETRI_TRANSITIONS=109} [2025-02-06 13:13:46,486 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 27 predicate places. [2025-02-06 13:13:46,486 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 109 transitions, 854 flow [2025-02-06 13:13:46,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 37.833333333333336) internal successors, (454), 12 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:46,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:46,486 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:46,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 13:13:46,686 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,SelfDestructingSolverStorable15 [2025-02-06 13:13:46,687 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:46,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash 488171581, now seen corresponding path program 2 times [2025-02-06 13:13:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:46,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999619674] [2025-02-06 13:13:46,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:13:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:46,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 13:13:46,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 24 statements. [2025-02-06 13:13:46,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:13:46,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:13:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:46,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999619674] [2025-02-06 13:13:46,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999619674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:46,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:46,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 13:13:46,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145239534] [2025-02-06 13:13:46,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:46,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:13:46,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:46,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:13:46,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:13:47,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 89 [2025-02-06 13:13:47,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 109 transitions, 854 flow. Second operand has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:47,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:47,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 89 [2025-02-06 13:13:47,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:48,125 INFO L124 PetriNetUnfolderBase]: 7354/11234 cut-off events. [2025-02-06 13:13:48,125 INFO L125 PetriNetUnfolderBase]: For 2253/2564 co-relation queries the response was YES. [2025-02-06 13:13:48,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24683 conditions, 11234 events. 7354/11234 cut-off events. For 2253/2564 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 70828 event pairs, 2513 based on Foata normal form. 0/7868 useless extension candidates. Maximal degree in co-relation 24410. Up to 6226 conditions per place. [2025-02-06 13:13:48,200 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 136 selfloop transitions, 18 changer transitions 0/163 dead transitions. [2025-02-06 13:13:48,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 163 transitions, 1310 flow [2025-02-06 13:13:48,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:13:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:13:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 312 transitions. [2025-02-06 13:13:48,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43820224719101125 [2025-02-06 13:13:48,202 INFO L175 Difference]: Start difference. First operand has 113 places, 109 transitions, 854 flow. Second operand 8 states and 312 transitions. [2025-02-06 13:13:48,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 163 transitions, 1310 flow [2025-02-06 13:13:48,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 163 transitions, 1259 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 13:13:48,211 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 866 flow [2025-02-06 13:13:48,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=866, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2025-02-06 13:13:48,212 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 31 predicate places. [2025-02-06 13:13:48,212 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 866 flow [2025-02-06 13:13:48,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:48,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:48,212 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:48,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:13:48,212 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:48,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 958912901, now seen corresponding path program 2 times [2025-02-06 13:13:48,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:48,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773849512] [2025-02-06 13:13:48,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:13:48,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:48,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 13:13:48,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 26 statements. [2025-02-06 13:13:48,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:13:48,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:13:48,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773849512] [2025-02-06 13:13:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773849512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:48,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:48,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 13:13:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236612716] [2025-02-06 13:13:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:48,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:13:48,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:48,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:13:48,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:13:48,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-02-06 13:13:48,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 866 flow. Second operand has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:48,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:48,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-02-06 13:13:48,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:50,201 INFO L124 PetriNetUnfolderBase]: 11285/15905 cut-off events. [2025-02-06 13:13:50,202 INFO L125 PetriNetUnfolderBase]: For 6586/7700 co-relation queries the response was YES. [2025-02-06 13:13:50,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37679 conditions, 15905 events. 11285/15905 cut-off events. For 6586/7700 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 88411 event pairs, 4817 based on Foata normal form. 262/11742 useless extension candidates. Maximal degree in co-relation 37411. Up to 9157 conditions per place. [2025-02-06 13:13:50,333 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 139 selfloop transitions, 18 changer transitions 0/169 dead transitions. [2025-02-06 13:13:50,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 169 transitions, 1370 flow [2025-02-06 13:13:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:13:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:13:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 292 transitions. [2025-02-06 13:13:50,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4101123595505618 [2025-02-06 13:13:50,335 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 866 flow. Second operand 8 states and 292 transitions. [2025-02-06 13:13:50,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 169 transitions, 1370 flow [2025-02-06 13:13:50,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 169 transitions, 1325 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-06 13:13:50,344 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 894 flow [2025-02-06 13:13:50,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=894, PETRI_PLACES=121, PETRI_TRANSITIONS=115} [2025-02-06 13:13:50,345 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 35 predicate places. [2025-02-06 13:13:50,345 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 115 transitions, 894 flow [2025-02-06 13:13:50,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:50,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:50,345 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:50,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 13:13:50,345 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:50,346 INFO L85 PathProgramCache]: Analyzing trace with hash 958912903, now seen corresponding path program 1 times [2025-02-06 13:13:50,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:50,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048719235] [2025-02-06 13:13:50,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:50,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:50,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:13:50,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:13:50,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:50,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:13:50,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:50,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048719235] [2025-02-06 13:13:50,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048719235] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:50,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469378284] [2025-02-06 13:13:50,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:50,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:50,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:50,686 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-02-06 13:13:50,688 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-02-06 13:13:50,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:13:50,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:13:50,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:50,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:50,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 13:13:50,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:50,797 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-02-06 13:13:50,803 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-02-06 13:13:50,847 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:13:50,847 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-02-06 13:13:50,861 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 31 treesize of output 24 [2025-02-06 13:13:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:13:51,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:51,361 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 13:13:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:13:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469378284] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:51,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:13:51,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 22 [2025-02-06 13:13:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526990354] [2025-02-06 13:13:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:51,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:13:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:51,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:13:51,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-02-06 13:13:51,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-02-06 13:13:51,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 115 transitions, 894 flow. Second operand has 8 states, 8 states have (on average 38.5) internal successors, (308), 8 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:51,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:51,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-02-06 13:13:51,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:52,968 INFO L124 PetriNetUnfolderBase]: 7813/11529 cut-off events. [2025-02-06 13:13:52,968 INFO L125 PetriNetUnfolderBase]: For 6691/8021 co-relation queries the response was YES. [2025-02-06 13:13:52,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28341 conditions, 11529 events. 7813/11529 cut-off events. For 6691/8021 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 68950 event pairs, 2619 based on Foata normal form. 400/9125 useless extension candidates. Maximal degree in co-relation 28071. Up to 5420 conditions per place. [2025-02-06 13:13:53,041 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 111 selfloop transitions, 26 changer transitions 0/153 dead transitions. [2025-02-06 13:13:53,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 153 transitions, 1273 flow [2025-02-06 13:13:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:13:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:13:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 420 transitions. [2025-02-06 13:13:53,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5243445692883895 [2025-02-06 13:13:53,043 INFO L175 Difference]: Start difference. First operand has 121 places, 115 transitions, 894 flow. Second operand 9 states and 420 transitions. [2025-02-06 13:13:53,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 153 transitions, 1273 flow [2025-02-06 13:13:53,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 153 transitions, 1238 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-02-06 13:13:53,056 INFO L231 Difference]: Finished difference. Result has 127 places, 119 transitions, 951 flow [2025-02-06 13:13:53,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=127, PETRI_TRANSITIONS=119} [2025-02-06 13:13:53,057 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 41 predicate places. [2025-02-06 13:13:53,057 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 119 transitions, 951 flow [2025-02-06 13:13:53,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.5) internal successors, (308), 8 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:53,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:53,058 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:53,064 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-02-06 13:13:53,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:53,258 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash 958912904, now seen corresponding path program 1 times [2025-02-06 13:13:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710632751] [2025-02-06 13:13:53,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:53,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:13:53,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:13:53,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:53,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:13:53,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:53,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710632751] [2025-02-06 13:13:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710632751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:53,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:53,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:13:53,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333142922] [2025-02-06 13:13:53,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:53,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:13:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:53,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:13:53,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:13:53,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-02-06 13:13:53,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 951 flow. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:53,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:53,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-02-06 13:13:53,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:54,156 INFO L124 PetriNetUnfolderBase]: 5990/9570 cut-off events. [2025-02-06 13:13:54,156 INFO L125 PetriNetUnfolderBase]: For 9471/10343 co-relation queries the response was YES. [2025-02-06 13:13:54,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25712 conditions, 9570 events. 5990/9570 cut-off events. For 9471/10343 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 61975 event pairs, 4302 based on Foata normal form. 456/8483 useless extension candidates. Maximal degree in co-relation 25435. Up to 7875 conditions per place. [2025-02-06 13:13:54,223 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 92 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2025-02-06 13:13:54,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 116 transitions, 1139 flow [2025-02-06 13:13:54,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:13:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:13:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-02-06 13:13:54,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028089887640449 [2025-02-06 13:13:54,224 INFO L175 Difference]: Start difference. First operand has 127 places, 119 transitions, 951 flow. Second operand 4 states and 179 transitions. [2025-02-06 13:13:54,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 116 transitions, 1139 flow [2025-02-06 13:13:54,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 116 transitions, 1104 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-02-06 13:13:54,237 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 920 flow [2025-02-06 13:13:54,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2025-02-06 13:13:54,238 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 37 predicate places. [2025-02-06 13:13:54,238 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 920 flow [2025-02-06 13:13:54,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:54,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:54,238 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:54,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 13:13:54,238 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:54,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:54,238 INFO L85 PathProgramCache]: Analyzing trace with hash 958912905, now seen corresponding path program 1 times [2025-02-06 13:13:54,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:54,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563701318] [2025-02-06 13:13:54,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:54,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:54,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:13:54,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:13:54,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:54,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:13:54,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:54,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563701318] [2025-02-06 13:13:54,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563701318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:54,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057041674] [2025-02-06 13:13:54,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:54,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:54,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:54,460 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-02-06 13:13:54,461 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-02-06 13:13:54,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:13:54,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:13:54,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:54,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:54,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:13:54,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:13:54,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:54,707 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-02-06 13:13:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:13:54,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057041674] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:13:54,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:13:54,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2025-02-06 13:13:54,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494301504] [2025-02-06 13:13:54,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:13:54,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 13:13:54,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:54,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 13:13:54,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:13:55,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 89 [2025-02-06 13:13:55,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 920 flow. Second operand has 19 states, 19 states have (on average 38.05263157894737) internal successors, (723), 19 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:55,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:55,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 89 [2025-02-06 13:13:55,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:56,228 INFO L124 PetriNetUnfolderBase]: 6240/9131 cut-off events. [2025-02-06 13:13:56,229 INFO L125 PetriNetUnfolderBase]: For 6969/7379 co-relation queries the response was YES. [2025-02-06 13:13:56,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24704 conditions, 9131 events. 6240/9131 cut-off events. For 6969/7379 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 51055 event pairs, 2969 based on Foata normal form. 367/7955 useless extension candidates. Maximal degree in co-relation 24429. Up to 5246 conditions per place. [2025-02-06 13:13:56,280 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 123 selfloop transitions, 31 changer transitions 12/180 dead transitions. [2025-02-06 13:13:56,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 180 transitions, 1469 flow [2025-02-06 13:13:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:13:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:13:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 583 transitions. [2025-02-06 13:13:56,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5038893690579084 [2025-02-06 13:13:56,282 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 920 flow. Second operand 13 states and 583 transitions. [2025-02-06 13:13:56,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 180 transitions, 1469 flow [2025-02-06 13:13:56,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 180 transitions, 1455 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:13:56,293 INFO L231 Difference]: Finished difference. Result has 134 places, 112 transitions, 928 flow [2025-02-06 13:13:56,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=928, PETRI_PLACES=134, PETRI_TRANSITIONS=112} [2025-02-06 13:13:56,294 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 48 predicate places. [2025-02-06 13:13:56,294 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 112 transitions, 928 flow [2025-02-06 13:13:56,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 38.05263157894737) internal successors, (723), 19 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:56,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:56,294 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:56,300 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-02-06 13:13:56,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:56,499 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:56,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash 981477697, now seen corresponding path program 1 times [2025-02-06 13:13:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:56,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544899301] [2025-02-06 13:13:56,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:56,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:56,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:13:56,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:13:56,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:56,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:13:56,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544899301] [2025-02-06 13:13:56,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544899301] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023850248] [2025-02-06 13:13:56,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:56,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:56,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:56,722 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-02-06 13:13:56,723 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-02-06 13:13:56,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:13:56,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:13:56,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:56,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:56,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 13:13:56,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:56,811 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-02-06 13:13:56,846 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 13:13:56,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-02-06 13:13:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:13:57,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:13:57,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023850248] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:57,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:13:57,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 22 [2025-02-06 13:13:57,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229445304] [2025-02-06 13:13:57,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:57,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:13:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:57,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:13:57,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-02-06 13:13:57,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-02-06 13:13:57,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 112 transitions, 928 flow. Second operand has 8 states, 8 states have (on average 35.375) internal successors, (283), 8 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:57,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:57,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-02-06 13:13:57,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:58,141 INFO L124 PetriNetUnfolderBase]: 5965/8702 cut-off events. [2025-02-06 13:13:58,141 INFO L125 PetriNetUnfolderBase]: For 12195/13113 co-relation queries the response was YES. [2025-02-06 13:13:58,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24374 conditions, 8702 events. 5965/8702 cut-off events. For 12195/13113 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 47978 event pairs, 2496 based on Foata normal form. 546/8043 useless extension candidates. Maximal degree in co-relation 24100. Up to 4361 conditions per place. [2025-02-06 13:13:58,185 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 112 selfloop transitions, 22 changer transitions 0/147 dead transitions. [2025-02-06 13:13:58,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 147 transitions, 1322 flow [2025-02-06 13:13:58,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:13:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:13:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 393 transitions. [2025-02-06 13:13:58,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49063670411985016 [2025-02-06 13:13:58,190 INFO L175 Difference]: Start difference. First operand has 134 places, 112 transitions, 928 flow. Second operand 9 states and 393 transitions. [2025-02-06 13:13:58,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 147 transitions, 1322 flow [2025-02-06 13:13:58,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 147 transitions, 1257 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-02-06 13:13:58,200 INFO L231 Difference]: Finished difference. Result has 134 places, 112 transitions, 936 flow [2025-02-06 13:13:58,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=936, PETRI_PLACES=134, PETRI_TRANSITIONS=112} [2025-02-06 13:13:58,201 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 48 predicate places. [2025-02-06 13:13:58,201 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 112 transitions, 936 flow [2025-02-06 13:13:58,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.375) internal successors, (283), 8 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:58,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:58,201 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-02-06 13:13:58,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 13:13:58,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:58,402 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-06 13:13:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1147711922, now seen corresponding path program 1 times [2025-02-06 13:13:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:58,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128375188] [2025-02-06 13:13:58,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:58,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:13:58,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:13:58,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:58,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:13:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128375188] [2025-02-06 13:13:58,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128375188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993113602] [2025-02-06 13:13:58,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:58,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:58,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:58,492 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-02-06 13:13:58,494 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-02-06 13:13:58,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:13:58,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:13:58,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:58,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:58,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:13:58,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:13:58,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:13:58,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993113602] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:13:58,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:13:58,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-06 13:13:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092652782] [2025-02-06 13:13:58,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:13:58,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 13:13:58,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:58,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 13:13:58,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272