./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-complex/safestack_relacy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-complex/safestack_relacy.i -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 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:53:54,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:53:54,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:53:54,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:53:54,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:53:55,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:53:55,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:53:55,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:53:55,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:53:55,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:53:55,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:53:55,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:53:55,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:53:55,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:53:55,018 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:53:55,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:53:55,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:53:55,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:53:55,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:53:55,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:53:55,018 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:53:55,018 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:53:55,019 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:53:55,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:53:55,019 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:53:55,019 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:53:55,019 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:53:55,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:53:55,019 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:53:55,019 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:53:55,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:53:55,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:53:55,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:53:55,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:53:55,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:53:55,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:53:55,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:53:55,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:53:55,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:53:55,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:53:55,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:53:55,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:53:55,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:53:55,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:53:55,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:53:55,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:53:55,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:53:55,022 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 -> 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 [2025-01-10 00:53:55,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:53:55,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:53:55,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:53:55,311 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:53:55,312 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:53:55,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-01-10 00:53:56,627 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc90ad521/91d38977c9fc42ec89e68200193629ab/FLAGe7fa90b53 [2025-01-10 00:53:57,002 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:53:57,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-01-10 00:53:57,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc90ad521/91d38977c9fc42ec89e68200193629ab/FLAGe7fa90b53 [2025-01-10 00:53:57,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc90ad521/91d38977c9fc42ec89e68200193629ab [2025-01-10 00:53:57,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:53:57,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:53:57,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:53:57,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:53:57,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:53:57,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d9af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57, skipping insertion in model container [2025-01-10 00:53:57,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:53:57,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:53:57,594 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:53:57,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:53:57,775 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:53:57,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57 WrapperNode [2025-01-10 00:53:57,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:53:57,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:53:57,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:53:57,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:53:57,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,857 INFO L138 Inliner]: procedures = 458, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 162 [2025-01-10 00:53:57,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:53:57,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:53:57,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:53:57,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:53:57,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,913 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 5, 30]. 81 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 3, 8]. The 13 writes are split as follows [0, 1, 12]. [2025-01-10 00:53:57,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:53:57,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:53:57,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:53:57,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:53:57,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (1/1) ... [2025-01-10 00:53:57,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:53:57,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:53:58,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:53:58,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:53:58,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:53:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:53:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:53:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:53:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-10 00:53:58,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-10 00:53:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:53:58,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:53:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:53:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:53:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:53:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:53:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:53:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:53:58,051 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:53:58,365 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:53:58,366 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:53:58,767 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:53:58,768 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:53:58,998 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:53:58,998 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 00:53:58,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:58 BoogieIcfgContainer [2025-01-10 00:53:58,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:53:59,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:53:59,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:53:59,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:53:59,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:53:57" (1/3) ... [2025-01-10 00:53:59,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bde711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:59, skipping insertion in model container [2025-01-10 00:53:59,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57" (2/3) ... [2025-01-10 00:53:59,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bde711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:59, skipping insertion in model container [2025-01-10 00:53:59,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:58" (3/3) ... [2025-01-10 00:53:59,010 INFO L128 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2025-01-10 00:53:59,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:53:59,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safestack_relacy.i that has 2 procedures, 104 locations, 1 initial locations, 7 loop locations, and 50 error locations. [2025-01-10 00:53:59,025 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:53:59,145 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:53:59,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 117 transitions, 241 flow [2025-01-10 00:53:59,239 INFO L124 PetriNetUnfolderBase]: 13/129 cut-off events. [2025-01-10 00:53:59,243 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:53:59,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 129 events. 13/129 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 481 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 95. Up to 3 conditions per place. [2025-01-10 00:53:59,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 117 transitions, 241 flow [2025-01-10 00:53:59,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 117 transitions, 241 flow [2025-01-10 00:53:59,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:53:59,278 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;@6236b425, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:53:59,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2025-01-10 00:53:59,282 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:53:59,282 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 00:53:59,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:53:59,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:59,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:53:59,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:53:59,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash 17779, now seen corresponding path program 1 times [2025-01-10 00:53:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:59,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546548764] [2025-01-10 00:53:59,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:59,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:59,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:53:59,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:53:59,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:59,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:59,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:59,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546548764] [2025-01-10 00:53:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546548764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:59,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:59,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:53:59,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160675453] [2025-01-10 00:53:59,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:59,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:59,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:59,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:59,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:59,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-01-10 00:53:59,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 117 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:59,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:59,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-01-10 00:53:59,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:00,013 INFO L124 PetriNetUnfolderBase]: 223/549 cut-off events. [2025-01-10 00:54:00,014 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-10 00:54:00,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 549 events. 223/549 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2386 event pairs, 185 based on Foata normal form. 24/409 useless extension candidates. Maximal degree in co-relation 954. Up to 454 conditions per place. [2025-01-10 00:54:00,056 INFO L140 encePairwiseOnDemand]: 83/117 looper letters, 59 selfloop transitions, 1 changer transitions 0/83 dead transitions. [2025-01-10 00:54:00,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 83 transitions, 293 flow [2025-01-10 00:54:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:54:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:54:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-01-10 00:54:00,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2025-01-10 00:54:00,077 INFO L175 Difference]: Start difference. First operand has 107 places, 117 transitions, 241 flow. Second operand 3 states and 165 transitions. [2025-01-10 00:54:00,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 83 transitions, 293 flow [2025-01-10 00:54:00,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 83 transitions, 293 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:54:00,087 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 175 flow [2025-01-10 00:54:00,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2025-01-10 00:54:00,094 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -27 predicate places. [2025-01-10 00:54:00,094 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 175 flow [2025-01-10 00:54:00,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:00,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:00,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:54:00,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:54:00,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:54:00,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:00,097 INFO L85 PathProgramCache]: Analyzing trace with hash 17780, now seen corresponding path program 1 times [2025-01-10 00:54:00,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:00,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134139604] [2025-01-10 00:54:00,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:00,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:00,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:54:00,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:54:00,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:00,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:00,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:00,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134139604] [2025-01-10 00:54:00,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134139604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:00,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:00,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:54:00,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594256998] [2025-01-10 00:54:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:00,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:54:00,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:00,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:54:00,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:54:00,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 117 [2025-01-10 00:54:00,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:00,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:00,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 117 [2025-01-10 00:54:00,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:00,469 INFO L124 PetriNetUnfolderBase]: 188/470 cut-off events. [2025-01-10 00:54:00,469 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-01-10 00:54:00,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 470 events. 188/470 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1972 event pairs, 150 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 846. Up to 375 conditions per place. [2025-01-10 00:54:00,475 INFO L140 encePairwiseOnDemand]: 107/117 looper letters, 50 selfloop transitions, 1 changer transitions 0/74 dead transitions. [2025-01-10 00:54:00,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 74 transitions, 259 flow [2025-01-10 00:54:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:54:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:54:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-01-10 00:54:00,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39316239316239315 [2025-01-10 00:54:00,477 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 175 flow. Second operand 3 states and 138 transitions. [2025-01-10 00:54:00,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 74 transitions, 259 flow [2025-01-10 00:54:00,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 74 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:54:00,479 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 158 flow [2025-01-10 00:54:00,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2025-01-10 00:54:00,480 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -35 predicate places. [2025-01-10 00:54:00,480 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 158 flow [2025-01-10 00:54:00,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:00,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:00,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:54:00,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:54:00,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:54:00,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash -740062129, now seen corresponding path program 1 times [2025-01-10 00:54:00,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:00,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700618230] [2025-01-10 00:54:00,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:00,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:00,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:54:00,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:54:00,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:00,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700618230] [2025-01-10 00:54:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700618230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:54:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130506818] [2025-01-10 00:54:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:00,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:54:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:00,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:54:00,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:54:00,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-01-10 00:54:00,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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-01-10 00:54:00,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:00,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-01-10 00:54:00,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:00,780 INFO L124 PetriNetUnfolderBase]: 188/474 cut-off events. [2025-01-10 00:54:00,781 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-01-10 00:54:00,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 474 events. 188/474 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1969 event pairs, 150 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 855. Up to 368 conditions per place. [2025-01-10 00:54:00,786 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 52 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-01-10 00:54:00,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 77 transitions, 276 flow [2025-01-10 00:54:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:54:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:54:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2025-01-10 00:54:00,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2025-01-10 00:54:00,790 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 158 flow. Second operand 4 states and 153 transitions. [2025-01-10 00:54:00,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 77 transitions, 276 flow [2025-01-10 00:54:00,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:54:00,793 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 173 flow [2025-01-10 00:54:00,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2025-01-10 00:54:00,795 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -32 predicate places. [2025-01-10 00:54:00,795 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 173 flow [2025-01-10 00:54:00,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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-01-10 00:54:00,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:00,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:54:00,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:54:00,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:54:00,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash -740062051, now seen corresponding path program 1 times [2025-01-10 00:54:00,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:00,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705113306] [2025-01-10 00:54:00,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:00,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:00,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:54:00,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:54:00,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:00,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:01,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705113306] [2025-01-10 00:54:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705113306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:01,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:01,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:54:01,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372141405] [2025-01-10 00:54:01,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:01,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:54:01,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:01,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:54:01,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:54:01,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 117 [2025-01-10 00:54:01,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:01,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:01,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 117 [2025-01-10 00:54:01,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:01,200 INFO L124 PetriNetUnfolderBase]: 188/473 cut-off events. [2025-01-10 00:54:01,200 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2025-01-10 00:54:01,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 473 events. 188/473 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1970 event pairs, 150 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 858. Up to 376 conditions per place. [2025-01-10 00:54:01,203 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 51 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2025-01-10 00:54:01,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 283 flow [2025-01-10 00:54:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:54:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:54:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2025-01-10 00:54:01,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3311965811965812 [2025-01-10 00:54:01,205 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 173 flow. Second operand 4 states and 155 transitions. [2025-01-10 00:54:01,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 283 flow [2025-01-10 00:54:01,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:54:01,208 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 177 flow [2025-01-10 00:54:01,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2025-01-10 00:54:01,209 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -30 predicate places. [2025-01-10 00:54:01,209 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 177 flow [2025-01-10 00:54:01,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:01,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:01,209 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:01,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:54:01,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:54:01,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1120880006, now seen corresponding path program 1 times [2025-01-10 00:54:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813581823] [2025-01-10 00:54:01,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:01,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:54:01,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:54:01,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:01,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:01,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813581823] [2025-01-10 00:54:01,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813581823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:54:01,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959951362] [2025-01-10 00:54:01,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:01,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:54:01,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:54:01,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:54:01,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:54:01,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:54:01,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:54:01,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:01,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:01,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:54:01,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:54:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:01,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:54:01,872 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 7 treesize of output 5 [2025-01-10 00:54:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:01,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959951362] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:54:01,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:54:01,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-10 00:54:01,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899196714] [2025-01-10 00:54:01,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:54:01,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:54:01,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:01,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:54:01,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:54:02,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 117 [2025-01-10 00:54:02,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 177 flow. Second operand has 14 states, 14 states have (on average 24.928571428571427) internal successors, (349), 14 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:02,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:02,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 117 [2025-01-10 00:54:02,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:02,584 INFO L124 PetriNetUnfolderBase]: 189/477 cut-off events. [2025-01-10 00:54:02,586 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-01-10 00:54:02,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 477 events. 189/477 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1983 event pairs, 150 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 871. Up to 368 conditions per place. [2025-01-10 00:54:02,589 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 54 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2025-01-10 00:54:02,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 311 flow [2025-01-10 00:54:02,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:54:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:54:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2025-01-10 00:54:02,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27228327228327226 [2025-01-10 00:54:02,592 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 177 flow. Second operand 7 states and 223 transitions. [2025-01-10 00:54:02,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 311 flow [2025-01-10 00:54:02,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 81 transitions, 303 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:54:02,594 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 188 flow [2025-01-10 00:54:02,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2025-01-10 00:54:02,597 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -28 predicate places. [2025-01-10 00:54:02,597 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 188 flow [2025-01-10 00:54:02,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.928571428571427) internal successors, (349), 14 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:02,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:02,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:02,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:54:02,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:54:02,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:54:02,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1120880084, now seen corresponding path program 1 times [2025-01-10 00:54:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:02,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878263992] [2025-01-10 00:54:02,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:02,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:02,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:54:02,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:54:02,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:02,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878263992] [2025-01-10 00:54:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878263992] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:54:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765669665] [2025-01-10 00:54:02,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:02,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:54:02,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:54:02,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:54:02,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:54:03,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:54:03,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:54:03,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:03,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:03,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:54:03,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:54:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:03,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:54:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:03,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765669665] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:54:03,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:54:03,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:54:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301464630] [2025-01-10 00:54:03,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:54:03,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:54:03,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:03,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:54:03,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:54:03,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 117 [2025-01-10 00:54:03,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 188 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:03,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:03,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 117 [2025-01-10 00:54:03,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:03,315 INFO L124 PetriNetUnfolderBase]: 188/475 cut-off events. [2025-01-10 00:54:03,315 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-01-10 00:54:03,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 475 events. 188/475 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1962 event pairs, 150 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 874. Up to 368 conditions per place. [2025-01-10 00:54:03,318 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 52 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2025-01-10 00:54:03,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 317 flow [2025-01-10 00:54:03,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:54:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:54:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2025-01-10 00:54:03,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28205128205128205 [2025-01-10 00:54:03,321 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 188 flow. Second operand 6 states and 198 transitions. [2025-01-10 00:54:03,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 317 flow [2025-01-10 00:54:03,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 308 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 00:54:03,323 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 200 flow [2025-01-10 00:54:03,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2025-01-10 00:54:03,324 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -25 predicate places. [2025-01-10 00:54:03,324 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 200 flow [2025-01-10 00:54:03,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:03,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:03,325 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:03,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:54:03,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:54:03,526 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:54:03,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1235018543, now seen corresponding path program 2 times [2025-01-10 00:54:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058700762] [2025-01-10 00:54:03,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:54:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:03,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 00:54:03,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-01-10 00:54:03,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:54:03,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 00:54:03,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:03,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058700762] [2025-01-10 00:54:03,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058700762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:03,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:03,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:54:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172357355] [2025-01-10 00:54:03,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:03,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:54:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:03,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:54:03,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:54:03,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 117 [2025-01-10 00:54:03,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:03,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:03,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 117 [2025-01-10 00:54:03,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:03,802 INFO L124 PetriNetUnfolderBase]: 188/474 cut-off events. [2025-01-10 00:54:03,802 INFO L125 PetriNetUnfolderBase]: For 17/19 co-relation queries the response was YES. [2025-01-10 00:54:03,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 474 events. 188/474 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1961 event pairs, 150 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 872. Up to 368 conditions per place. [2025-01-10 00:54:03,808 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 49 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-01-10 00:54:03,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 300 flow [2025-01-10 00:54:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:54:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:54:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-01-10 00:54:03,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3646723646723647 [2025-01-10 00:54:03,810 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 200 flow. Second operand 3 states and 128 transitions. [2025-01-10 00:54:03,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 300 flow [2025-01-10 00:54:03,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:54:03,812 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 188 flow [2025-01-10 00:54:03,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-01-10 00:54:03,813 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -28 predicate places. [2025-01-10 00:54:03,813 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 188 flow [2025-01-10 00:54:03,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:03,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:03,814 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:03,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:54:03,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:54:03,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:03,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1748092369, now seen corresponding path program 1 times [2025-01-10 00:54:03,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:03,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515087465] [2025-01-10 00:54:03,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:03,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:03,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:54:03,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:54:03,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:03,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 00:54:03,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:03,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515087465] [2025-01-10 00:54:03,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515087465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:03,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:03,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:54:03,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965300033] [2025-01-10 00:54:03,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:03,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:54:03,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:03,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:54:03,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:54:03,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-01-10 00:54:03,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:03,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:03,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-01-10 00:54:03,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:04,047 INFO L124 PetriNetUnfolderBase]: 188/468 cut-off events. [2025-01-10 00:54:04,048 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-01-10 00:54:04,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 468 events. 188/468 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1917 event pairs, 150 based on Foata normal form. 64/428 useless extension candidates. Maximal degree in co-relation 861. Up to 377 conditions per place. [2025-01-10 00:54:04,050 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 50 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2025-01-10 00:54:04,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 73 transitions, 286 flow [2025-01-10 00:54:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:54:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:54:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-01-10 00:54:04,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3504273504273504 [2025-01-10 00:54:04,051 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 188 flow. Second operand 3 states and 123 transitions. [2025-01-10 00:54:04,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 73 transitions, 286 flow [2025-01-10 00:54:04,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 73 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:54:04,053 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 182 flow [2025-01-10 00:54:04,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-01-10 00:54:04,054 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -30 predicate places. [2025-01-10 00:54:04,054 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 182 flow [2025-01-10 00:54:04,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:04,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:04,054 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:04,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:54:04,054 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:54:04,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1748092370, now seen corresponding path program 1 times [2025-01-10 00:54:04,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:04,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468938012] [2025-01-10 00:54:04,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:04,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:54:04,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:54:04,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:04,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 00:54:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:04,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468938012] [2025-01-10 00:54:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468938012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:04,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:04,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:54:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447447520] [2025-01-10 00:54:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:04,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:54:04,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:04,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:54:04,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:54:04,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-01-10 00:54:04,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:04,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:04,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-01-10 00:54:04,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:04,413 INFO L124 PetriNetUnfolderBase]: 151/421 cut-off events. [2025-01-10 00:54:04,414 INFO L125 PetriNetUnfolderBase]: For 10/13 co-relation queries the response was YES. [2025-01-10 00:54:04,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 421 events. 151/421 cut-off events. For 10/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2023 event pairs, 34 based on Foata normal form. 61/401 useless extension candidates. Maximal degree in co-relation 757. Up to 216 conditions per place. [2025-01-10 00:54:04,416 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 82 selfloop transitions, 5 changer transitions 1/108 dead transitions. [2025-01-10 00:54:04,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 428 flow [2025-01-10 00:54:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:54:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:54:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2025-01-10 00:54:04,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-01-10 00:54:04,418 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 182 flow. Second operand 4 states and 186 transitions. [2025-01-10 00:54:04,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 428 flow [2025-01-10 00:54:04,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 108 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:54:04,422 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 199 flow [2025-01-10 00:54:04,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-01-10 00:54:04,423 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -27 predicate places. [2025-01-10 00:54:04,423 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 199 flow [2025-01-10 00:54:04,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:04,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:04,423 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:04,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:54:04,423 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:54:04,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash -863713976, now seen corresponding path program 1 times [2025-01-10 00:54:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143564988] [2025-01-10 00:54:04,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:04,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:54:04,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:54:04,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:04,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 00:54:04,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:04,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143564988] [2025-01-10 00:54:04,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143564988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:04,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:04,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:54:04,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144191898] [2025-01-10 00:54:04,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:04,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:54:04,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:04,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:54:04,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:54:04,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-01-10 00:54:04,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:04,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:04,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-01-10 00:54:04,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:04,819 INFO L124 PetriNetUnfolderBase]: 79/256 cut-off events. [2025-01-10 00:54:04,820 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-01-10 00:54:04,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 256 events. 79/256 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1010 event pairs, 13 based on Foata normal form. 66/289 useless extension candidates. Maximal degree in co-relation 514. Up to 134 conditions per place. [2025-01-10 00:54:04,821 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 78 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2025-01-10 00:54:04,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 98 transitions, 398 flow [2025-01-10 00:54:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:54:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:54:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2025-01-10 00:54:04,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3435897435897436 [2025-01-10 00:54:04,823 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 199 flow. Second operand 5 states and 201 transitions. [2025-01-10 00:54:04,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 98 transitions, 398 flow [2025-01-10 00:54:04,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 390 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:54:04,825 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 164 flow [2025-01-10 00:54:04,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-01-10 00:54:04,826 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -36 predicate places. [2025-01-10 00:54:04,826 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 164 flow [2025-01-10 00:54:04,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:04,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:04,826 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:04,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:54:04,827 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-01-10 00:54:04,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:04,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1005328836, now seen corresponding path program 1 times [2025-01-10 00:54:04,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:04,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304731798] [2025-01-10 00:54:04,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:04,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:04,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:54:04,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:54:04,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:04,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:54:04,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:54:04,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:54:04,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:54:04,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:04,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:54:04,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:54:04,909 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:54:04,910 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 88 remaining) [2025-01-10 00:54:04,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2025-01-10 00:54:04,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2025-01-10 00:54:04,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2025-01-10 00:54:04,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2025-01-10 00:54:04,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2025-01-10 00:54:04,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2025-01-10 00:54:04,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2025-01-10 00:54:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2025-01-10 00:54:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2025-01-10 00:54:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2025-01-10 00:54:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2025-01-10 00:54:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2025-01-10 00:54:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 88 remaining) [2025-01-10 00:54:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2025-01-10 00:54:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2025-01-10 00:54:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2025-01-10 00:54:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2025-01-10 00:54:04,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2025-01-10 00:54:04,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2025-01-10 00:54:04,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2025-01-10 00:54:04,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2025-01-10 00:54:04,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24ASSERT_VIOLATIONMEMORY_LEAK (65 of 88 remaining) [2025-01-10 00:54:04,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2025-01-10 00:54:04,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2025-01-10 00:54:04,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2025-01-10 00:54:04,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2025-01-10 00:54:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2025-01-10 00:54:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2025-01-10 00:54:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2025-01-10 00:54:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2025-01-10 00:54:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2025-01-10 00:54:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2025-01-10 00:54:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2025-01-10 00:54:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2025-01-10 00:54:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2025-01-10 00:54:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2025-01-10 00:54:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2025-01-10 00:54:04,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2025-01-10 00:54:04,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2025-01-10 00:54:04,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2025-01-10 00:54:04,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2025-01-10 00:54:04,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2025-01-10 00:54:04,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2025-01-10 00:54:04,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2025-01-10 00:54:04,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2025-01-10 00:54:04,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2025-01-10 00:54:04,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2025-01-10 00:54:04,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2025-01-10 00:54:04,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24ASSERT_VIOLATIONMEMORY_LEAK (28 of 88 remaining) [2025-01-10 00:54:04,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2025-01-10 00:54:04,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2025-01-10 00:54:04,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2025-01-10 00:54:04,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2025-01-10 00:54:04,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2025-01-10 00:54:04,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2025-01-10 00:54:04,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2025-01-10 00:54:04,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2025-01-10 00:54:04,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2025-01-10 00:54:04,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2025-01-10 00:54:04,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2025-01-10 00:54:04,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:54:04,920 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:04,923 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:54:04,923 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:54:04,983 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:54:04,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 201 transitions, 418 flow [2025-01-10 00:54:05,015 INFO L124 PetriNetUnfolderBase]: 26/237 cut-off events. [2025-01-10 00:54:05,016 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 00:54:05,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 237 events. 26/237 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1222 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 187. Up to 6 conditions per place. [2025-01-10 00:54:05,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 201 transitions, 418 flow [2025-01-10 00:54:05,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 201 transitions, 418 flow [2025-01-10 00:54:05,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:54:05,023 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;@6236b425, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:54:05,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-01-10 00:54:05,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:54:05,025 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 00:54:05,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:54:05,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:05,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:54:05,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:05,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash 24211, now seen corresponding path program 1 times [2025-01-10 00:54:05,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:05,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481575272] [2025-01-10 00:54:05,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:05,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:05,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:54:05,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:54:05,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:05,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:05,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:05,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481575272] [2025-01-10 00:54:05,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481575272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:05,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:05,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:54:05,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124364986] [2025-01-10 00:54:05,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:05,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:54:05,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:05,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:54:05,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:54:05,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 201 [2025-01-10 00:54:05,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 201 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:05,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:05,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 201 [2025-01-10 00:54:05,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:07,640 INFO L124 PetriNetUnfolderBase]: 19095/30081 cut-off events. [2025-01-10 00:54:07,641 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2025-01-10 00:54:07,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58596 conditions, 30081 events. 19095/30081 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 204831 event pairs, 16870 based on Foata normal form. 1814/22591 useless extension candidates. Maximal degree in co-relation 57121. Up to 28316 conditions per place. [2025-01-10 00:54:07,869 INFO L140 encePairwiseOnDemand]: 138/201 looper letters, 102 selfloop transitions, 1 changer transitions 0/137 dead transitions. [2025-01-10 00:54:07,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 496 flow [2025-01-10 00:54:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:54:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:54:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2025-01-10 00:54:07,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4527363184079602 [2025-01-10 00:54:07,872 INFO L175 Difference]: Start difference. First operand has 181 places, 201 transitions, 418 flow. Second operand 3 states and 273 transitions. [2025-01-10 00:54:07,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 496 flow [2025-01-10 00:54:07,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 137 transitions, 496 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:54:07,875 INFO L231 Difference]: Finished difference. Result has 129 places, 137 transitions, 292 flow [2025-01-10 00:54:07,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=129, PETRI_TRANSITIONS=137} [2025-01-10 00:54:07,878 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -52 predicate places. [2025-01-10 00:54:07,878 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 137 transitions, 292 flow [2025-01-10 00:54:07,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:07,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:07,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:54:07,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:54:07,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:07,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:07,879 INFO L85 PathProgramCache]: Analyzing trace with hash 24212, now seen corresponding path program 1 times [2025-01-10 00:54:07,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:07,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369796536] [2025-01-10 00:54:07,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:07,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:54:07,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:54:07,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:07,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:07,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:07,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369796536] [2025-01-10 00:54:07,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369796536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:07,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:07,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:54:07,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225138688] [2025-01-10 00:54:07,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:07,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:54:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:07,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:54:07,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:54:08,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 201 [2025-01-10 00:54:08,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 137 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:08,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:08,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 201 [2025-01-10 00:54:08,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:09,700 INFO L124 PetriNetUnfolderBase]: 13222/20974 cut-off events. [2025-01-10 00:54:09,700 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-01-10 00:54:09,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40534 conditions, 20974 events. 13222/20974 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 136960 event pairs, 11340 based on Foata normal form. 0/16295 useless extension candidates. Maximal degree in co-relation 40526. Up to 19394 conditions per place. [2025-01-10 00:54:09,819 INFO L140 encePairwiseOnDemand]: 184/201 looper letters, 86 selfloop transitions, 1 changer transitions 0/121 dead transitions. [2025-01-10 00:54:09,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 121 transitions, 434 flow [2025-01-10 00:54:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:54:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:54:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2025-01-10 00:54:09,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36981757877280264 [2025-01-10 00:54:09,821 INFO L175 Difference]: Start difference. First operand has 129 places, 137 transitions, 292 flow. Second operand 3 states and 223 transitions. [2025-01-10 00:54:09,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 121 transitions, 434 flow [2025-01-10 00:54:09,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 121 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:54:09,824 INFO L231 Difference]: Finished difference. Result has 114 places, 121 transitions, 261 flow [2025-01-10 00:54:09,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=114, PETRI_TRANSITIONS=121} [2025-01-10 00:54:09,825 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -67 predicate places. [2025-01-10 00:54:09,825 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 121 transitions, 261 flow [2025-01-10 00:54:09,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:09,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:09,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:54:09,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:54:09,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:09,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash 911245231, now seen corresponding path program 1 times [2025-01-10 00:54:09,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:09,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768599703] [2025-01-10 00:54:09,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:09,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:09,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:54:09,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:54:09,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:09,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:09,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:09,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768599703] [2025-01-10 00:54:09,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768599703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:09,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:09,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:54:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522237881] [2025-01-10 00:54:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:09,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:54:09,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:09,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:54:09,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:54:09,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-01-10 00:54:09,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:09,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:09,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-01-10 00:54:09,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:11,252 INFO L124 PetriNetUnfolderBase]: 13222/20978 cut-off events. [2025-01-10 00:54:11,252 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-01-10 00:54:11,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40544 conditions, 20978 events. 13222/20978 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 137004 event pairs, 11340 based on Foata normal form. 1/16300 useless extension candidates. Maximal degree in co-relation 40535. Up to 19387 conditions per place. [2025-01-10 00:54:11,356 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 88 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2025-01-10 00:54:11,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 124 transitions, 451 flow [2025-01-10 00:54:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:54:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:54:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 245 transitions. [2025-01-10 00:54:11,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30472636815920395 [2025-01-10 00:54:11,359 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 261 flow. Second operand 4 states and 245 transitions. [2025-01-10 00:54:11,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 124 transitions, 451 flow [2025-01-10 00:54:11,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 124 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:54:11,361 INFO L231 Difference]: Finished difference. Result has 117 places, 122 transitions, 276 flow [2025-01-10 00:54:11,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=117, PETRI_TRANSITIONS=122} [2025-01-10 00:54:11,362 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -64 predicate places. [2025-01-10 00:54:11,362 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 122 transitions, 276 flow [2025-01-10 00:54:11,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:11,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:11,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:54:11,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:54:11,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:11,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:11,363 INFO L85 PathProgramCache]: Analyzing trace with hash 911245309, now seen corresponding path program 1 times [2025-01-10 00:54:11,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:11,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585926896] [2025-01-10 00:54:11,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:11,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:54:11,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:54:11,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:11,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:11,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585926896] [2025-01-10 00:54:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585926896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:54:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989055740] [2025-01-10 00:54:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:11,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:54:11,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:11,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:54:11,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:54:11,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 201 [2025-01-10 00:54:11,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:11,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:11,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 201 [2025-01-10 00:54:11,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:12,962 INFO L124 PetriNetUnfolderBase]: 13222/20977 cut-off events. [2025-01-10 00:54:12,962 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2025-01-10 00:54:13,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40549 conditions, 20977 events. 13222/20977 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 136908 event pairs, 11340 based on Foata normal form. 0/16299 useless extension candidates. Maximal degree in co-relation 40538. Up to 19395 conditions per place. [2025-01-10 00:54:13,082 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 87 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2025-01-10 00:54:13,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 123 transitions, 458 flow [2025-01-10 00:54:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:54:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:54:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2025-01-10 00:54:13,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3072139303482587 [2025-01-10 00:54:13,084 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 276 flow. Second operand 4 states and 247 transitions. [2025-01-10 00:54:13,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 123 transitions, 458 flow [2025-01-10 00:54:13,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 123 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:54:13,087 INFO L231 Difference]: Finished difference. Result has 119 places, 122 transitions, 280 flow [2025-01-10 00:54:13,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=119, PETRI_TRANSITIONS=122} [2025-01-10 00:54:13,088 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -62 predicate places. [2025-01-10 00:54:13,088 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 122 transitions, 280 flow [2025-01-10 00:54:13,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:13,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:13,088 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:13,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:54:13,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:13,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1578527037, now seen corresponding path program 1 times [2025-01-10 00:54:13,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:13,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2552162] [2025-01-10 00:54:13,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:13,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:54:13,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:54:13,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:13,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:13,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2552162] [2025-01-10 00:54:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2552162] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:54:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520754427] [2025-01-10 00:54:13,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:13,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:54:13,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:54:13,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:54:13,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:54:13,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:54:13,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:54:13,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:13,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:13,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:54:13,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:54:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:13,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:54:13,582 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 7 treesize of output 5 [2025-01-10 00:54:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520754427] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:54:13,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:54:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-10 00:54:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692479263] [2025-01-10 00:54:13,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:54:13,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:54:13,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:13,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:54:13,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:54:14,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 201 [2025-01-10 00:54:14,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 122 transitions, 280 flow. Second operand has 14 states, 14 states have (on average 38.92857142857143) internal successors, (545), 14 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:14,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:14,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 201 [2025-01-10 00:54:14,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:15,679 INFO L124 PetriNetUnfolderBase]: 13223/20981 cut-off events. [2025-01-10 00:54:15,679 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-01-10 00:54:15,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40563 conditions, 20981 events. 13223/20981 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 136950 event pairs, 11340 based on Foata normal form. 1/16304 useless extension candidates. Maximal degree in co-relation 40551. Up to 19387 conditions per place. [2025-01-10 00:54:15,817 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 90 selfloop transitions, 7 changer transitions 0/128 dead transitions. [2025-01-10 00:54:15,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 128 transitions, 486 flow [2025-01-10 00:54:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:54:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:54:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 357 transitions. [2025-01-10 00:54:15,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2537313432835821 [2025-01-10 00:54:15,818 INFO L175 Difference]: Start difference. First operand has 119 places, 122 transitions, 280 flow. Second operand 7 states and 357 transitions. [2025-01-10 00:54:15,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 128 transitions, 486 flow [2025-01-10 00:54:15,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 128 transitions, 478 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:54:15,821 INFO L231 Difference]: Finished difference. Result has 121 places, 123 transitions, 291 flow [2025-01-10 00:54:15,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=121, PETRI_TRANSITIONS=123} [2025-01-10 00:54:15,821 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -60 predicate places. [2025-01-10 00:54:15,821 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 123 transitions, 291 flow [2025-01-10 00:54:15,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.92857142857143) internal successors, (545), 14 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:15,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:15,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:15,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:54:16,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:54:16,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:16,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:16,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1578527115, now seen corresponding path program 1 times [2025-01-10 00:54:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:16,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976780856] [2025-01-10 00:54:16,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:16,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:16,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:54:16,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:54:16,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:16,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:16,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:16,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976780856] [2025-01-10 00:54:16,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976780856] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:54:16,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699540477] [2025-01-10 00:54:16,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:16,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:54:16,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:54:16,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:54:16,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:54:16,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:54:16,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:54:16,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:16,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:16,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:54:16,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:54:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:16,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:54:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:16,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699540477] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:54:16,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:54:16,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:54:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224543953] [2025-01-10 00:54:16,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:54:16,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:54:16,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:16,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:54:16,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:54:16,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 201 [2025-01-10 00:54:16,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 123 transitions, 291 flow. Second operand has 8 states, 8 states have (on average 39.25) internal successors, (314), 8 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:16,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:16,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 201 [2025-01-10 00:54:16,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:17,744 INFO L124 PetriNetUnfolderBase]: 13222/20979 cut-off events. [2025-01-10 00:54:17,745 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-01-10 00:54:17,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40566 conditions, 20979 events. 13222/20979 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 136907 event pairs, 11340 based on Foata normal form. 1/16303 useless extension candidates. Maximal degree in co-relation 40554. Up to 19387 conditions per place. [2025-01-10 00:54:17,845 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 88 selfloop transitions, 7 changer transitions 0/126 dead transitions. [2025-01-10 00:54:17,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 492 flow [2025-01-10 00:54:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:54:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:54:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 318 transitions. [2025-01-10 00:54:17,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.263681592039801 [2025-01-10 00:54:17,847 INFO L175 Difference]: Start difference. First operand has 121 places, 123 transitions, 291 flow. Second operand 6 states and 318 transitions. [2025-01-10 00:54:17,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 492 flow [2025-01-10 00:54:17,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 126 transitions, 483 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 00:54:17,850 INFO L231 Difference]: Finished difference. Result has 124 places, 123 transitions, 303 flow [2025-01-10 00:54:17,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=124, PETRI_TRANSITIONS=123} [2025-01-10 00:54:17,851 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -57 predicate places. [2025-01-10 00:54:17,851 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 123 transitions, 303 flow [2025-01-10 00:54:17,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 39.25) internal successors, (314), 8 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:17,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:17,851 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:17,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:54:18,052 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,SelfDestructingSolverStorable16 [2025-01-10 00:54:18,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:18,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:18,053 INFO L85 PathProgramCache]: Analyzing trace with hash -301284881, now seen corresponding path program 2 times [2025-01-10 00:54:18,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:18,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213867792] [2025-01-10 00:54:18,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:54:18,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:18,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 00:54:18,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-01-10 00:54:18,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:54:18,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 00:54:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213867792] [2025-01-10 00:54:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213867792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:18,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:18,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:54:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288993204] [2025-01-10 00:54:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:18,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:54:18,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:18,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:54:18,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:54:18,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 201 [2025-01-10 00:54:18,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 123 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:18,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:18,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 201 [2025-01-10 00:54:18,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:19,573 INFO L124 PetriNetUnfolderBase]: 13222/20978 cut-off events. [2025-01-10 00:54:19,574 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2025-01-10 00:54:19,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40565 conditions, 20978 events. 13222/20978 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 136838 event pairs, 11340 based on Foata normal form. 0/16302 useless extension candidates. Maximal degree in co-relation 40552. Up to 19387 conditions per place. [2025-01-10 00:54:19,695 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 85 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-01-10 00:54:19,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 122 transitions, 475 flow [2025-01-10 00:54:19,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:54:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:54:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-01-10 00:54:19,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3416252072968491 [2025-01-10 00:54:19,697 INFO L175 Difference]: Start difference. First operand has 124 places, 123 transitions, 303 flow. Second operand 3 states and 206 transitions. [2025-01-10 00:54:19,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 122 transitions, 475 flow [2025-01-10 00:54:19,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 461 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:54:19,700 INFO L231 Difference]: Finished difference. Result has 121 places, 122 transitions, 291 flow [2025-01-10 00:54:19,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=291, PETRI_PLACES=121, PETRI_TRANSITIONS=122} [2025-01-10 00:54:19,700 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -60 predicate places. [2025-01-10 00:54:19,701 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 291 flow [2025-01-10 00:54:19,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:19,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:19,701 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:19,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:54:19,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:19,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash 904493754, now seen corresponding path program 1 times [2025-01-10 00:54:19,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:19,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902968287] [2025-01-10 00:54:19,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:19,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:19,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:54:19,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:54:19,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:19,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 00:54:19,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:19,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902968287] [2025-01-10 00:54:19,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902968287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:19,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:19,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:54:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135461473] [2025-01-10 00:54:19,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:19,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:54:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:19,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:54:19,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:54:19,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-01-10 00:54:19,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:19,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:19,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-01-10 00:54:19,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:20,809 INFO L124 PetriNetUnfolderBase]: 13222/20966 cut-off events. [2025-01-10 00:54:20,809 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-01-10 00:54:20,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40548 conditions, 20966 events. 13222/20966 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 136782 event pairs, 11340 based on Foata normal form. 2175/18477 useless extension candidates. Maximal degree in co-relation 40535. Up to 19396 conditions per place. [2025-01-10 00:54:20,959 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 86 selfloop transitions, 1 changer transitions 0/120 dead transitions. [2025-01-10 00:54:20,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 461 flow [2025-01-10 00:54:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:54:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:54:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-01-10 00:54:20,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-01-10 00:54:20,961 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 291 flow. Second operand 3 states and 201 transitions. [2025-01-10 00:54:20,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 461 flow [2025-01-10 00:54:20,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 120 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:54:20,963 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 285 flow [2025-01-10 00:54:20,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2025-01-10 00:54:20,964 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -62 predicate places. [2025-01-10 00:54:20,964 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 285 flow [2025-01-10 00:54:20,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:20,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:20,964 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:20,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:54:20,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:20,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash 904493755, now seen corresponding path program 1 times [2025-01-10 00:54:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:20,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637370721] [2025-01-10 00:54:20,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:20,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:54:20,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:54:20,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:20,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 00:54:21,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:21,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637370721] [2025-01-10 00:54:21,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637370721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:21,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:21,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:54:21,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692885950] [2025-01-10 00:54:21,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:21,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:54:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:21,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:54:21,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:54:21,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-01-10 00:54:21,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:21,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:21,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-01-10 00:54:21,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:22,453 INFO L124 PetriNetUnfolderBase]: 11052/18212 cut-off events. [2025-01-10 00:54:22,453 INFO L125 PetriNetUnfolderBase]: For 422/522 co-relation queries the response was YES. [2025-01-10 00:54:22,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34761 conditions, 18212 events. 11052/18212 cut-off events. For 422/522 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 126046 event pairs, 5552 based on Foata normal form. 2085/16119 useless extension candidates. Maximal degree in co-relation 34748. Up to 12864 conditions per place. [2025-01-10 00:54:22,605 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 157 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-01-10 00:54:22,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 193 transitions, 761 flow [2025-01-10 00:54:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:54:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:54:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 316 transitions. [2025-01-10 00:54:22,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39303482587064675 [2025-01-10 00:54:22,606 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 285 flow. Second operand 4 states and 316 transitions. [2025-01-10 00:54:22,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 193 transitions, 761 flow [2025-01-10 00:54:22,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 193 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:54:22,609 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 312 flow [2025-01-10 00:54:22,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2025-01-10 00:54:22,610 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -59 predicate places. [2025-01-10 00:54:22,610 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 312 flow [2025-01-10 00:54:22,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:22,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:22,610 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:22,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:54:22,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:22,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash -593916321, now seen corresponding path program 1 times [2025-01-10 00:54:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:22,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109008430] [2025-01-10 00:54:22,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:22,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:54:22,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:54:22,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:22,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 00:54:22,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109008430] [2025-01-10 00:54:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109008430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:22,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:22,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:54:22,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127889409] [2025-01-10 00:54:22,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:22,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:54:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:22,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:54:22,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:54:22,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-01-10 00:54:22,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:22,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:22,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-01-10 00:54:22,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:23,851 INFO L124 PetriNetUnfolderBase]: 10786/19086 cut-off events. [2025-01-10 00:54:23,851 INFO L125 PetriNetUnfolderBase]: For 2861/2963 co-relation queries the response was YES. [2025-01-10 00:54:23,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38865 conditions, 19086 events. 10786/19086 cut-off events. For 2861/2963 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 152839 event pairs, 1209 based on Foata normal form. 192/16431 useless extension candidates. Maximal degree in co-relation 38850. Up to 10165 conditions per place. [2025-01-10 00:54:23,940 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 223 selfloop transitions, 7 changer transitions 1/262 dead transitions. [2025-01-10 00:54:23,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 262 transitions, 1060 flow [2025-01-10 00:54:23,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:54:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:54:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2025-01-10 00:54:23,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4208955223880597 [2025-01-10 00:54:23,942 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 312 flow. Second operand 5 states and 423 transitions. [2025-01-10 00:54:23,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 262 transitions, 1060 flow [2025-01-10 00:54:23,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 262 transitions, 1059 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:54:23,951 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 333 flow [2025-01-10 00:54:23,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-01-10 00:54:23,952 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -55 predicate places. [2025-01-10 00:54:23,952 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 333 flow [2025-01-10 00:54:23,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:23,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:23,952 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:23,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:54:23,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1072716702, now seen corresponding path program 1 times [2025-01-10 00:54:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:23,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891802415] [2025-01-10 00:54:23,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:23,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:23,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:54:23,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:54:23,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:23,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 00:54:24,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:24,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891802415] [2025-01-10 00:54:24,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891802415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:24,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:24,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:54:24,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85004298] [2025-01-10 00:54:24,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:24,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:54:24,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:24,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:54:24,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:54:24,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-01-10 00:54:24,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:24,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:24,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-01-10 00:54:24,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:24,983 INFO L124 PetriNetUnfolderBase]: 5996/11688 cut-off events. [2025-01-10 00:54:24,983 INFO L125 PetriNetUnfolderBase]: For 5923/5923 co-relation queries the response was YES. [2025-01-10 00:54:25,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24155 conditions, 11688 events. 5996/11688 cut-off events. For 5923/5923 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 94428 event pairs, 126 based on Foata normal form. 2178/12140 useless extension candidates. Maximal degree in co-relation 24138. Up to 6736 conditions per place. [2025-01-10 00:54:25,052 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 182 selfloop transitions, 4 changer transitions 0/214 dead transitions. [2025-01-10 00:54:25,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 214 transitions, 857 flow [2025-01-10 00:54:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:54:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:54:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2025-01-10 00:54:25,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34328358208955223 [2025-01-10 00:54:25,054 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 333 flow. Second operand 6 states and 414 transitions. [2025-01-10 00:54:25,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 214 transitions, 857 flow [2025-01-10 00:54:25,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 214 transitions, 842 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 00:54:25,060 INFO L231 Difference]: Finished difference. Result has 116 places, 110 transitions, 270 flow [2025-01-10 00:54:25,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=116, PETRI_TRANSITIONS=110} [2025-01-10 00:54:25,060 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -65 predicate places. [2025-01-10 00:54:25,060 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 270 flow [2025-01-10 00:54:25,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:54:25,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:25,061 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:25,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:54:25,061 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:54:25,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1105521533, now seen corresponding path program 1 times [2025-01-10 00:54:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:25,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761586939] [2025-01-10 00:54:25,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:25,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:25,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:54:25,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:54:25,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:25,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:54:25,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:54:25,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:54:25,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:54:25,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:25,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:54:25,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:54:25,107 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:54:25,108 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (124 of 125 remaining) [2025-01-10 00:54:25,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 125 remaining) [2025-01-10 00:54:25,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 125 remaining) [2025-01-10 00:54:25,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 125 remaining) [2025-01-10 00:54:25,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 125 remaining) [2025-01-10 00:54:25,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (111 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 125 remaining) [2025-01-10 00:54:25,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24ASSERT_VIOLATIONMEMORY_LEAK (102 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 125 remaining) [2025-01-10 00:54:25,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 125 remaining) [2025-01-10 00:54:25,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 125 remaining) [2025-01-10 00:54:25,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 125 remaining) [2025-01-10 00:54:25,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 125 remaining) [2025-01-10 00:54:25,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 125 remaining) [2025-01-10 00:54:25,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24ASSERT_VIOLATIONMEMORY_LEAK (65 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 125 remaining) [2025-01-10 00:54:25,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 125 remaining) [2025-01-10 00:54:25,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24ASSERT_VIOLATIONMEMORY_LEAK (28 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 125 remaining) [2025-01-10 00:54:25,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 125 remaining) [2025-01-10 00:54:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 125 remaining) [2025-01-10 00:54:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 125 remaining) [2025-01-10 00:54:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 125 remaining) [2025-01-10 00:54:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 125 remaining) [2025-01-10 00:54:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 125 remaining) [2025-01-10 00:54:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 125 remaining) [2025-01-10 00:54:25,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 00:54:25,119 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:54:25,119 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:54:25,119 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:54:25,189 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 00:54:25,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 285 transitions, 597 flow [2025-01-10 00:54:25,226 INFO L124 PetriNetUnfolderBase]: 42/366 cut-off events. [2025-01-10 00:54:25,226 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 00:54:25,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 366 events. 42/366 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2137 event pairs, 1 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 291. Up to 12 conditions per place. [2025-01-10 00:54:25,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 285 transitions, 597 flow [2025-01-10 00:54:25,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 285 transitions, 597 flow [2025-01-10 00:54:25,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:54:25,244 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;@6236b425, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:54:25,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2025-01-10 00:54:25,245 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:54:25,245 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 00:54:25,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:54:25,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:25,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:54:25,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2025-01-10 00:54:25,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:25,247 INFO L85 PathProgramCache]: Analyzing trace with hash 33331, now seen corresponding path program 1 times [2025-01-10 00:54:25,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:25,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522764685] [2025-01-10 00:54:25,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:25,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:25,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:54:25,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:54:25,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:25,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:54:25,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:25,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522764685] [2025-01-10 00:54:25,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522764685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:25,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:25,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:54:25,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366698314] [2025-01-10 00:54:25,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:25,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:54:25,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:25,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:54:25,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:54:25,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 285 [2025-01-10 00:54:25,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 285 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 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-01-10 00:54:25,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:25,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 285 [2025-01-10 00:54:25,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand