./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.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 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:35:59,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:35:59,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:35:59,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:35:59,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:36:00,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:36:00,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:36:00,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:36:00,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:36:00,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:36:00,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:36:00,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:36:00,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:36:00,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:36:00,017 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:36:00,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:36:00,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:36:00,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:36:00,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:36:00,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:36:00,020 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:36:00,020 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:36:00,021 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:36:00,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:36:00,021 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:36:00,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:36:00,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:36:00,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:36:00,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:36:00,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:36:00,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:36:00,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:36:00,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:36:00,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:36:00,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:36:00,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:36:00,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:36:00,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:36:00,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:36:00,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:36:00,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:36:00,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:36:00,024 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 -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2025-02-06 12:36:00,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:36:00,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:36:00,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:36:00,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:36:00,325 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:36:00,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-02-06 12:36:01,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82592d084/3592dd2ce96b47f78420e7de94c0b103/FLAGf9bb5d91f [2025-02-06 12:36:01,940 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:36:01,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-02-06 12:36:01,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82592d084/3592dd2ce96b47f78420e7de94c0b103/FLAGf9bb5d91f [2025-02-06 12:36:01,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82592d084/3592dd2ce96b47f78420e7de94c0b103 [2025-02-06 12:36:01,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:36:01,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:36:01,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:36:01,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:36:01,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:36:01,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:36:01" (1/1) ... [2025-02-06 12:36:01,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9f2930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:01, skipping insertion in model container [2025-02-06 12:36:01,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:36:01" (1/1) ... [2025-02-06 12:36:02,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:36:02,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:36:02,301 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:36:02,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:36:02,378 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:36:02,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02 WrapperNode [2025-02-06 12:36:02,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:36:02,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:36:02,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:36:02,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:36:02,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,423 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2025-02-06 12:36:02,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:36:02,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:36:02,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:36:02,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:36:02,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,464 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-02-06 12:36:02,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,475 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:36:02,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:36:02,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:36:02,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:36:02,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (1/1) ... [2025-02-06 12:36:02,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:36:02,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:02,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:36:02,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:36:02,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:36:02,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:36:02,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:36:02,535 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 12:36:02,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 12:36:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:36:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:36:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:36:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:36:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:36:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:36:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:36:02,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:36:02,537 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:36:02,644 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:36:02,646 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:36:02,793 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:36:02,793 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:36:02,961 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:36:02,961 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:36:02,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:36:02 BoogieIcfgContainer [2025-02-06 12:36:02,962 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:36:02,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:36:02,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:36:02,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:36:02,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:36:01" (1/3) ... [2025-02-06 12:36:02,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca74693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:36:02, skipping insertion in model container [2025-02-06 12:36:02,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:02" (2/3) ... [2025-02-06 12:36:02,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca74693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:36:02, skipping insertion in model container [2025-02-06 12:36:02,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:36:02" (3/3) ... [2025-02-06 12:36:02,973 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-02-06 12:36:02,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:36:02,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 25 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-06 12:36:02,994 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:36:03,042 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:03,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 29 transitions, 62 flow [2025-02-06 12:36:03,112 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-02-06 12:36:03,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:03,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 33 events. 4/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 63 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-02-06 12:36:03,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 29 transitions, 62 flow [2025-02-06 12:36:03,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 29 transitions, 62 flow [2025-02-06 12:36:03,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:03,145 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;@4c9879d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:03,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:36:03,150 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:03,151 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:36:03,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:03,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:03,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:03,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:36:03,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash 214340, now seen corresponding path program 1 times [2025-02-06 12:36:03,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:03,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733458583] [2025-02-06 12:36:03,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:03,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:03,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:03,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:03,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:03,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:03,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:03,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733458583] [2025-02-06 12:36:03,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733458583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:03,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:03,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:36:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163707481] [2025-02-06 12:36:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:03,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:36:03,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:03,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:36:03,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:36:03,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 29 [2025-02-06 12:36:03,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 29 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:03,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:03,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 29 [2025-02-06 12:36:03,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:03,437 INFO L124 PetriNetUnfolderBase]: 18/72 cut-off events. [2025-02-06 12:36:03,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:03,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 72 events. 18/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 229 event pairs, 12 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 103. Up to 39 conditions per place. [2025-02-06 12:36:03,441 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 11 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-02-06 12:36:03,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 72 flow [2025-02-06 12:36:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:36:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:36:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2025-02-06 12:36:03,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2025-02-06 12:36:03,458 INFO L175 Difference]: Start difference. First operand has 28 places, 29 transitions, 62 flow. Second operand 2 states and 40 transitions. [2025-02-06 12:36:03,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 72 flow [2025-02-06 12:36:03,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 72 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:03,463 INFO L231 Difference]: Finished difference. Result has 25 places, 23 transitions, 50 flow [2025-02-06 12:36:03,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=23} [2025-02-06 12:36:03,467 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-02-06 12:36:03,467 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 23 transitions, 50 flow [2025-02-06 12:36:03,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:03,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:03,468 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 12:36:03,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:36:03,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:36:03,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2092335635, now seen corresponding path program 1 times [2025-02-06 12:36:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:03,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902003511] [2025-02-06 12:36:03,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:03,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:36:03,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:36:03,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:03,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:03,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:36:03,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:36:03,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:36:03,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:03,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:03,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:36:03,535 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:36:03,536 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-06 12:36:03,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-02-06 12:36:03,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-02-06 12:36:03,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-02-06 12:36:03,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-02-06 12:36:03,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2025-02-06 12:36:03,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-02-06 12:36:03,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-06 12:36:03,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:36:03,540 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:36:03,543 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:36:03,543 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:36:03,581 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:03,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 51 transitions, 112 flow [2025-02-06 12:36:03,604 INFO L124 PetriNetUnfolderBase]: 8/60 cut-off events. [2025-02-06 12:36:03,607 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:36:03,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 60 events. 8/60 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 171 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-02-06 12:36:03,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 51 transitions, 112 flow [2025-02-06 12:36:03,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 51 transitions, 112 flow [2025-02-06 12:36:03,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:03,612 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;@4c9879d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:03,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 12:36:03,614 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:03,615 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:36:03,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:03,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:03,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:03,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-06 12:36:03,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:03,618 INFO L85 PathProgramCache]: Analyzing trace with hash 264983, now seen corresponding path program 1 times [2025-02-06 12:36:03,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:03,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862077661] [2025-02-06 12:36:03,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:03,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:03,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:03,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:03,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:03,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:03,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:03,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862077661] [2025-02-06 12:36:03,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862077661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:03,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:03,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:36:03,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237056944] [2025-02-06 12:36:03,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:03,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:36:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:03,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:36:03,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:36:03,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 51 [2025-02-06 12:36:03,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 112 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:03,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:03,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 51 [2025-02-06 12:36:03,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:03,855 INFO L124 PetriNetUnfolderBase]: 282/732 cut-off events. [2025-02-06 12:36:03,856 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 12:36:03,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 732 events. 282/732 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4445 event pairs, 222 based on Foata normal form. 118/775 useless extension candidates. Maximal degree in co-relation 565. Up to 438 conditions per place. [2025-02-06 12:36:03,867 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 19 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2025-02-06 12:36:03,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 132 flow [2025-02-06 12:36:03,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:36:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:36:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2025-02-06 12:36:03,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2025-02-06 12:36:03,870 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 112 flow. Second operand 2 states and 72 transitions. [2025-02-06 12:36:03,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 132 flow [2025-02-06 12:36:03,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:03,872 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 94 flow [2025-02-06 12:36:03,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2025-02-06 12:36:03,872 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-02-06 12:36:03,872 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 94 flow [2025-02-06 12:36:03,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:03,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:03,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:36:03,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:36:03,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-06 12:36:03,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash -693205399, now seen corresponding path program 1 times [2025-02-06 12:36:03,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:03,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146562381] [2025-02-06 12:36:03,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:03,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:03,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:36:03,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:36:03,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:03,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:04,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:04,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146562381] [2025-02-06 12:36:04,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146562381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:04,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:04,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:04,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245094735] [2025-02-06 12:36:04,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:04,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:04,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:04,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:04,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:04,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-02-06 12:36:04,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:04,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:04,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-02-06 12:36:04,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:04,194 INFO L124 PetriNetUnfolderBase]: 282/717 cut-off events. [2025-02-06 12:36:04,195 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 12:36:04,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 717 events. 282/717 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4290 event pairs, 222 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 1177. Up to 437 conditions per place. [2025-02-06 12:36:04,205 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 18 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-02-06 12:36:04,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 128 flow [2025-02-06 12:36:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-02-06 12:36:04,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-02-06 12:36:04,208 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 94 flow. Second operand 3 states and 87 transitions. [2025-02-06 12:36:04,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 128 flow [2025-02-06 12:36:04,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:04,210 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 92 flow [2025-02-06 12:36:04,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-02-06 12:36:04,213 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-02-06 12:36:04,214 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 92 flow [2025-02-06 12:36:04,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:04,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:04,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:36:04,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:36:04,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-06 12:36:04,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash -693205398, now seen corresponding path program 1 times [2025-02-06 12:36:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:04,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688961539] [2025-02-06 12:36:04,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:04,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:36:04,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:36:04,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:04,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:04,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:04,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688961539] [2025-02-06 12:36:04,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688961539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:04,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:04,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:04,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620161856] [2025-02-06 12:36:04,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:04,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:04,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:04,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:04,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-02-06 12:36:04,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:04,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:04,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-02-06 12:36:04,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:04,806 INFO L124 PetriNetUnfolderBase]: 428/1162 cut-off events. [2025-02-06 12:36:04,807 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-06 12:36:04,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1162 events. 428/1162 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7943 event pairs, 221 based on Foata normal form. 24/1102 useless extension candidates. Maximal degree in co-relation 1883. Up to 499 conditions per place. [2025-02-06 12:36:04,815 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 38 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-02-06 12:36:04,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 232 flow [2025-02-06 12:36:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2025-02-06 12:36:04,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-02-06 12:36:04,818 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 92 flow. Second operand 5 states and 155 transitions. [2025-02-06 12:36:04,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 232 flow [2025-02-06 12:36:04,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:04,820 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 118 flow [2025-02-06 12:36:04,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-02-06 12:36:04,821 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-02-06 12:36:04,822 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 118 flow [2025-02-06 12:36:04,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:04,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:04,822 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-06 12:36:04,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:36:04,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-06 12:36:04,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1894021380, now seen corresponding path program 1 times [2025-02-06 12:36:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633781439] [2025-02-06 12:36:04,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:04,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:36:04,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:36:04,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:04,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:04,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:36:04,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:36:04,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:36:04,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:04,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:04,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:36:04,858 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:36:04,859 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 12:36:04,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2025-02-06 12:36:04,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-02-06 12:36:04,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 11 remaining) [2025-02-06 12:36:04,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 11 remaining) [2025-02-06 12:36:04,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-02-06 12:36:04,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-02-06 12:36:04,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 11 remaining) [2025-02-06 12:36:04,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-02-06 12:36:04,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-02-06 12:36:04,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2025-02-06 12:36:04,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:36:04,860 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 12:36:04,861 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:36:04,861 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:36:04,893 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:04,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 73 transitions, 164 flow [2025-02-06 12:36:04,903 INFO L124 PetriNetUnfolderBase]: 12/87 cut-off events. [2025-02-06 12:36:04,903 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 12:36:04,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 87 events. 12/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 290 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2025-02-06 12:36:04,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 73 transitions, 164 flow [2025-02-06 12:36:04,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 73 transitions, 164 flow [2025-02-06 12:36:04,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:04,907 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;@4c9879d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:04,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 12:36:04,908 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:04,908 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:36:04,908 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:04,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:04,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:04,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:36:04,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash 337472, now seen corresponding path program 1 times [2025-02-06 12:36:04,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:04,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525148470] [2025-02-06 12:36:04,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:04,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:04,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:04,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:04,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525148470] [2025-02-06 12:36:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525148470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:04,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:04,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:36:04,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145441032] [2025-02-06 12:36:04,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:04,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:36:04,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:04,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:36:04,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:36:04,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 73 [2025-02-06 12:36:04,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 164 flow. Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:04,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:04,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 73 [2025-02-06 12:36:04,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:05,610 INFO L124 PetriNetUnfolderBase]: 3157/6374 cut-off events. [2025-02-06 12:36:05,611 INFO L125 PetriNetUnfolderBase]: For 379/379 co-relation queries the response was YES. [2025-02-06 12:36:05,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10857 conditions, 6374 events. 3157/6374 cut-off events. For 379/379 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 51588 event pairs, 2574 based on Foata normal form. 1463/7289 useless extension candidates. Maximal degree in co-relation 1200. Up to 4260 conditions per place. [2025-02-06 12:36:05,666 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 27 selfloop transitions, 0 changer transitions 0/61 dead transitions. [2025-02-06 12:36:05,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 194 flow [2025-02-06 12:36:05,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:36:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:36:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2025-02-06 12:36:05,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7123287671232876 [2025-02-06 12:36:05,670 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 164 flow. Second operand 2 states and 104 transitions. [2025-02-06 12:36:05,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 194 flow [2025-02-06 12:36:05,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:05,673 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 138 flow [2025-02-06 12:36:05,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-02-06 12:36:05,674 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2025-02-06 12:36:05,674 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 138 flow [2025-02-06 12:36:05,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:05,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:05,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:36:05,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:36:05,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:36:05,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1467012500, now seen corresponding path program 1 times [2025-02-06 12:36:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440090521] [2025-02-06 12:36:05,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:05,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:05,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:36:05,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:36:05,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:05,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:05,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:05,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440090521] [2025-02-06 12:36:05,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440090521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:05,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:05,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:05,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182168969] [2025-02-06 12:36:05,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:05,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:05,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:05,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:05,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:05,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 73 [2025-02-06 12:36:05,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:05,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:05,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 73 [2025-02-06 12:36:05,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:06,406 INFO L124 PetriNetUnfolderBase]: 3157/6277 cut-off events. [2025-02-06 12:36:06,406 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-02-06 12:36:06,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10712 conditions, 6277 events. 3157/6277 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 49930 event pairs, 2574 based on Foata normal form. 0/5826 useless extension candidates. Maximal degree in co-relation 10706. Up to 4259 conditions per place. [2025-02-06 12:36:06,474 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 26 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-02-06 12:36:06,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 186 flow [2025-02-06 12:36:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-02-06 12:36:06,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5753424657534246 [2025-02-06 12:36:06,476 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 138 flow. Second operand 3 states and 126 transitions. [2025-02-06 12:36:06,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 186 flow [2025-02-06 12:36:06,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:06,479 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 134 flow [2025-02-06 12:36:06,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-02-06 12:36:06,480 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2025-02-06 12:36:06,480 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 134 flow [2025-02-06 12:36:06,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:06,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:06,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:36:06,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:36:06,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:36:06,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1467012501, now seen corresponding path program 1 times [2025-02-06 12:36:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:06,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579149370] [2025-02-06 12:36:06,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:06,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:06,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:36:06,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:36:06,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:06,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:06,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:06,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579149370] [2025-02-06 12:36:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579149370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:06,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:06,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:06,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725206922] [2025-02-06 12:36:06,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:06,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:06,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:06,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:06,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:06,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-02-06 12:36:06,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:06,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:06,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-02-06 12:36:06,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:07,667 INFO L124 PetriNetUnfolderBase]: 4877/10719 cut-off events. [2025-02-06 12:36:07,668 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2025-02-06 12:36:07,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17684 conditions, 10719 events. 4877/10719 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 100479 event pairs, 2966 based on Foata normal form. 171/10169 useless extension candidates. Maximal degree in co-relation 17677. Up to 4867 conditions per place. [2025-02-06 12:36:07,765 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 62 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2025-02-06 12:36:07,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 364 flow [2025-02-06 12:36:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2025-02-06 12:36:07,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410958904109589 [2025-02-06 12:36:07,769 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 134 flow. Second operand 5 states and 234 transitions. [2025-02-06 12:36:07,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 364 flow [2025-02-06 12:36:07,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:07,774 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 160 flow [2025-02-06 12:36:07,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2025-02-06 12:36:07,775 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-02-06 12:36:07,775 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 160 flow [2025-02-06 12:36:07,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:07,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:07,777 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:07,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:36:07,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:36:07,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1156250553, now seen corresponding path program 1 times [2025-02-06 12:36:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119487231] [2025-02-06 12:36:07,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:07,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:36:07,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:36:07,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:07,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:07,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119487231] [2025-02-06 12:36:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119487231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:07,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:07,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:07,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169963191] [2025-02-06 12:36:07,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:07,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:07,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:07,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:07,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:07,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-02-06 12:36:07,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:07,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:07,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-02-06 12:36:07,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:09,177 INFO L124 PetriNetUnfolderBase]: 6238/13206 cut-off events. [2025-02-06 12:36:09,177 INFO L125 PetriNetUnfolderBase]: For 3260/3260 co-relation queries the response was YES. [2025-02-06 12:36:09,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24274 conditions, 13206 events. 6238/13206 cut-off events. For 3260/3260 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 122168 event pairs, 3541 based on Foata normal form. 216/12564 useless extension candidates. Maximal degree in co-relation 24265. Up to 6249 conditions per place. [2025-02-06 12:36:09,307 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 66 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2025-02-06 12:36:09,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 424 flow [2025-02-06 12:36:09,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:09,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2025-02-06 12:36:09,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6356164383561644 [2025-02-06 12:36:09,309 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 160 flow. Second operand 5 states and 232 transitions. [2025-02-06 12:36:09,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 424 flow [2025-02-06 12:36:09,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:09,313 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 186 flow [2025-02-06 12:36:09,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2025-02-06 12:36:09,314 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2025-02-06 12:36:09,314 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 186 flow [2025-02-06 12:36:09,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:09,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:09,315 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:09,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:36:09,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:36:09,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1817409685, now seen corresponding path program 1 times [2025-02-06 12:36:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:09,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652308185] [2025-02-06 12:36:09,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:09,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:09,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:36:09,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:36:09,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:09,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:09,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652308185] [2025-02-06 12:36:09,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652308185] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:09,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518203155] [2025-02-06 12:36:09,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:09,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:09,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:09,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:09,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:36:09,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:36:09,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:36:09,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:09,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:09,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 12:36:09,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:09,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518203155] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:10,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:36:10,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2025-02-06 12:36:10,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022961490] [2025-02-06 12:36:10,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:10,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:36:10,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:10,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:36:10,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:36:10,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-02-06 12:36:10,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 186 flow. Second operand has 12 states, 12 states have (on average 34.75) internal successors, (417), 12 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:10,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:10,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-02-06 12:36:10,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:12,265 INFO L124 PetriNetUnfolderBase]: 9802/21447 cut-off events. [2025-02-06 12:36:12,265 INFO L125 PetriNetUnfolderBase]: For 7258/7258 co-relation queries the response was YES. [2025-02-06 12:36:12,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41941 conditions, 21447 events. 9802/21447 cut-off events. For 7258/7258 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 218679 event pairs, 3382 based on Foata normal form. 219/20640 useless extension candidates. Maximal degree in co-relation 41930. Up to 6462 conditions per place. [2025-02-06 12:36:12,450 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 93 selfloop transitions, 7 changer transitions 0/129 dead transitions. [2025-02-06 12:36:12,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 606 flow [2025-02-06 12:36:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:36:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:36:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 291 transitions. [2025-02-06 12:36:12,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6643835616438356 [2025-02-06 12:36:12,452 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 186 flow. Second operand 6 states and 291 transitions. [2025-02-06 12:36:12,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 606 flow [2025-02-06 12:36:12,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 129 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:12,463 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 226 flow [2025-02-06 12:36:12,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2025-02-06 12:36:12,465 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2025-02-06 12:36:12,465 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 226 flow [2025-02-06 12:36:12,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.75) internal successors, (417), 12 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:12,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:12,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:12,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:36:12,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 12:36:12,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:36:12,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash -505145891, now seen corresponding path program 1 times [2025-02-06 12:36:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:12,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655778804] [2025-02-06 12:36:12,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:12,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:12,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:36:12,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:36:12,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:12,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:12,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655778804] [2025-02-06 12:36:12,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655778804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:12,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:12,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953238942] [2025-02-06 12:36:12,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:12,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:12,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:12,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:12,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-02-06 12:36:12,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:12,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:12,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-02-06 12:36:12,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:13,804 INFO L124 PetriNetUnfolderBase]: 8101/16155 cut-off events. [2025-02-06 12:36:13,804 INFO L125 PetriNetUnfolderBase]: For 8563/8563 co-relation queries the response was YES. [2025-02-06 12:36:13,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36427 conditions, 16155 events. 8101/16155 cut-off events. For 8563/8563 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 146690 event pairs, 1312 based on Foata normal form. 657/16185 useless extension candidates. Maximal degree in co-relation 36414. Up to 8799 conditions per place. [2025-02-06 12:36:13,929 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 51 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2025-02-06 12:36:13,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 398 flow [2025-02-06 12:36:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-02-06 12:36:13,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680365296803653 [2025-02-06 12:36:13,931 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 226 flow. Second operand 3 states and 149 transitions. [2025-02-06 12:36:13,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 84 transitions, 398 flow [2025-02-06 12:36:13,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:36:13,949 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 227 flow [2025-02-06 12:36:13,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2025-02-06 12:36:13,951 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2025-02-06 12:36:13,951 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 227 flow [2025-02-06 12:36:13,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:13,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:13,952 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-06 12:36:13,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:36:13,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:36:13,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1719686574, now seen corresponding path program 1 times [2025-02-06 12:36:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:13,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135880457] [2025-02-06 12:36:13,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:13,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:36:13,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:36:13,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:13,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:13,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:36:13,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:36:13,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:36:13,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:13,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:13,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:36:13,984 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:36:13,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-02-06 12:36:13,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-02-06 12:36:13,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-02-06 12:36:13,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (10 of 14 remaining) [2025-02-06 12:36:13,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-02-06 12:36:13,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-02-06 12:36:13,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-02-06 12:36:13,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-02-06 12:36:13,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-02-06 12:36:13,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-02-06 12:36:13,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 14 remaining) [2025-02-06 12:36:13,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-02-06 12:36:13,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-02-06 12:36:13,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2025-02-06 12:36:13,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:36:13,986 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:13,987 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:36:13,987 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 12:36:14,031 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:14,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 95 transitions, 218 flow [2025-02-06 12:36:14,048 INFO L124 PetriNetUnfolderBase]: 16/114 cut-off events. [2025-02-06 12:36:14,048 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:36:14,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 114 events. 16/114 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 409 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 99. Up to 5 conditions per place. [2025-02-06 12:36:14,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 95 transitions, 218 flow [2025-02-06 12:36:14,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 95 transitions, 218 flow [2025-02-06 12:36:14,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:14,053 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;@4c9879d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:14,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 12:36:14,054 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:14,054 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:36:14,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:14,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:14,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:14,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-06 12:36:14,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash 431807, now seen corresponding path program 1 times [2025-02-06 12:36:14,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:14,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203048691] [2025-02-06 12:36:14,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:14,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:14,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:14,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:14,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:14,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:14,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203048691] [2025-02-06 12:36:14,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203048691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:14,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:14,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:36:14,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454519607] [2025-02-06 12:36:14,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:14,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:36:14,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:14,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:36:14,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:36:14,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 95 [2025-02-06 12:36:14,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 218 flow. Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:14,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:14,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 95 [2025-02-06 12:36:14,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:17,493 INFO L124 PetriNetUnfolderBase]: 30501/53151 cut-off events. [2025-02-06 12:36:17,493 INFO L125 PetriNetUnfolderBase]: For 4795/4795 co-relation queries the response was YES. [2025-02-06 12:36:17,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93307 conditions, 53151 events. 30501/53151 cut-off events. For 4795/4795 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 499039 event pairs, 25212 based on Foata normal form. 14934/64210 useless extension candidates. Maximal degree in co-relation 10919. Up to 38217 conditions per place. [2025-02-06 12:36:17,822 INFO L140 encePairwiseOnDemand]: 86/95 looper letters, 35 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2025-02-06 12:36:17,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 258 flow [2025-02-06 12:36:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:36:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:36:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2025-02-06 12:36:17,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7157894736842105 [2025-02-06 12:36:17,824 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 218 flow. Second operand 2 states and 136 transitions. [2025-02-06 12:36:17,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 258 flow [2025-02-06 12:36:17,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 252 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:17,828 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 182 flow [2025-02-06 12:36:17,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2025-02-06 12:36:17,829 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -6 predicate places. [2025-02-06 12:36:17,829 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 182 flow [2025-02-06 12:36:17,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:17,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:17,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:36:17,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:36:17,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-06 12:36:17,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:17,830 INFO L85 PathProgramCache]: Analyzing trace with hash -16880012, now seen corresponding path program 1 times [2025-02-06 12:36:17,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:17,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959445038] [2025-02-06 12:36:17,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:17,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:36:17,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:36:17,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:17,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:17,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:17,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959445038] [2025-02-06 12:36:17,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959445038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:17,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:17,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:17,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931604659] [2025-02-06 12:36:17,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:17,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:17,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:17,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:17,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:17,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 95 [2025-02-06 12:36:17,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:17,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:17,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 95 [2025-02-06 12:36:17,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:20,892 INFO L124 PetriNetUnfolderBase]: 30501/52464 cut-off events. [2025-02-06 12:36:20,892 INFO L125 PetriNetUnfolderBase]: For 2307/2307 co-relation queries the response was YES. [2025-02-06 12:36:21,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91886 conditions, 52464 events. 30501/52464 cut-off events. For 2307/2307 co-relation queries the response was YES. Maximal size of possible extension queue 2300. Compared 483928 event pairs, 25212 based on Foata normal form. 0/49276 useless extension candidates. Maximal degree in co-relation 91879. Up to 38216 conditions per place. [2025-02-06 12:36:21,239 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 34 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2025-02-06 12:36:21,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 244 flow [2025-02-06 12:36:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-02-06 12:36:21,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2025-02-06 12:36:21,243 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 182 flow. Second operand 3 states and 165 transitions. [2025-02-06 12:36:21,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 244 flow [2025-02-06 12:36:21,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:21,249 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 176 flow [2025-02-06 12:36:21,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2025-02-06 12:36:21,251 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -8 predicate places. [2025-02-06 12:36:21,252 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 176 flow [2025-02-06 12:36:21,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:21,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:21,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:36:21,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:36:21,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-06 12:36:21,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash -16880011, now seen corresponding path program 1 times [2025-02-06 12:36:21,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:21,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371406470] [2025-02-06 12:36:21,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:21,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:36:21,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:36:21,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:21,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371406470] [2025-02-06 12:36:21,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371406470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:21,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:21,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16945824] [2025-02-06 12:36:21,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:21,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:21,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:21,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 95 [2025-02-06 12:36:21,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:21,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:21,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 95 [2025-02-06 12:36:21,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:26,747 INFO L124 PetriNetUnfolderBase]: 47291/86598 cut-off events. [2025-02-06 12:36:26,747 INFO L125 PetriNetUnfolderBase]: For 3185/3185 co-relation queries the response was YES. [2025-02-06 12:36:27,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148542 conditions, 86598 events. 47291/86598 cut-off events. For 3185/3185 co-relation queries the response was YES. Maximal size of possible extension queue 3647. Compared 909304 event pairs, 24941 based on Foata normal form. 1200/81667 useless extension candidates. Maximal degree in co-relation 148534. Up to 43675 conditions per place. [2025-02-06 12:36:27,558 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 86 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2025-02-06 12:36:27,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 130 transitions, 496 flow [2025-02-06 12:36:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 313 transitions. [2025-02-06 12:36:27,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589473684210526 [2025-02-06 12:36:27,560 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 176 flow. Second operand 5 states and 313 transitions. [2025-02-06 12:36:27,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 130 transitions, 496 flow [2025-02-06 12:36:27,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 130 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:27,569 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 202 flow [2025-02-06 12:36:27,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2025-02-06 12:36:27,570 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -3 predicate places. [2025-02-06 12:36:27,570 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 202 flow [2025-02-06 12:36:27,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:27,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:27,570 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:27,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:36:27,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-06 12:36:27,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:27,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1992312365, now seen corresponding path program 1 times [2025-02-06 12:36:27,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:27,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582293532] [2025-02-06 12:36:27,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:27,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:36:27,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:36:27,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:27,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:27,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582293532] [2025-02-06 12:36:27,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582293532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:27,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:27,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:27,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353298819] [2025-02-06 12:36:27,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:27,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:27,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:27,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:27,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:27,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 95 [2025-02-06 12:36:27,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:27,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:27,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 95 [2025-02-06 12:36:27,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:34,800 INFO L124 PetriNetUnfolderBase]: 60778/111153 cut-off events. [2025-02-06 12:36:34,800 INFO L125 PetriNetUnfolderBase]: For 23900/23900 co-relation queries the response was YES. [2025-02-06 12:36:35,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205844 conditions, 111153 events. 60778/111153 cut-off events. For 23900/23900 co-relation queries the response was YES. Maximal size of possible extension queue 4377. Compared 1189805 event pairs, 33712 based on Foata normal form. 1539/105377 useless extension candidates. Maximal degree in co-relation 205834. Up to 56145 conditions per place. [2025-02-06 12:36:35,590 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 90 selfloop transitions, 5 changer transitions 0/134 dead transitions. [2025-02-06 12:36:35,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 134 transitions, 556 flow [2025-02-06 12:36:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 311 transitions. [2025-02-06 12:36:35,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547368421052632 [2025-02-06 12:36:35,591 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 202 flow. Second operand 5 states and 311 transitions. [2025-02-06 12:36:35,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 134 transitions, 556 flow [2025-02-06 12:36:35,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:35,601 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 228 flow [2025-02-06 12:36:35,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2025-02-06 12:36:35,601 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 2 predicate places. [2025-02-06 12:36:35,601 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 228 flow [2025-02-06 12:36:35,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:35,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:35,602 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:35,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:36:35,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-06 12:36:35,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash -360741761, now seen corresponding path program 1 times [2025-02-06 12:36:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883672245] [2025-02-06 12:36:35,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:35,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:35,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:36:35,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:36:35,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:35,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:35,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:35,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883672245] [2025-02-06 12:36:35,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883672245] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:35,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312979500] [2025-02-06 12:36:35,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:35,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:35,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:35,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:35,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:36:35,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:36:35,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:36:35,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:35,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:35,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 12:36:35,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:35,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:36,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312979500] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:36,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:36:36,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2025-02-06 12:36:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848802193] [2025-02-06 12:36:36,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:36,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:36:36,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:36,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:36:36,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:36:36,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 95 [2025-02-06 12:36:36,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 80 transitions, 228 flow. Second operand has 12 states, 12 states have (on average 45.75) internal successors, (549), 12 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:36,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:36,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 95 [2025-02-06 12:36:36,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand