./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 14:00:59,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:00:59,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:00:59,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:00:59,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:00:59,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:00:59,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:00:59,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:00:59,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:00:59,109 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:00:59,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:00:59,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:00:59,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:00:59,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:00:59,111 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:00:59,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:00:59,111 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:00:59,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:00:59,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:00:59,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:00:59,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:00:59,111 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:00:59,111 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:00:59,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:00:59,112 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:00:59,112 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:00:59,112 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:00:59,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:00:59,112 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:00:59,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:00:59,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:00:59,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:00:59,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:00:59,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:00:59,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:00:59,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:00:59,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:00:59,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:00:59,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:00:59,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:00:59,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:00:59,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:00:59,113 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/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-03-17 14:00:59,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:00:59,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:00:59,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:00:59,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:00:59,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:00:59,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-17 14:01:00,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd070efad/3b36309fe62c46b49d5d3f9e0c78ca34/FLAGfbb1ef07f [2025-03-17 14:01:00,706 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:01:00,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-17 14:01:00,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd070efad/3b36309fe62c46b49d5d3f9e0c78ca34/FLAGfbb1ef07f [2025-03-17 14:01:01,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd070efad/3b36309fe62c46b49d5d3f9e0c78ca34 [2025-03-17 14:01:01,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:01:01,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:01:01,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:01:01,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:01:01,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:01:01,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa7ea69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01, skipping insertion in model container [2025-03-17 14:01:01,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:01:01,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:01:01,297 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:01:01,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:01:01,355 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:01:01,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01 WrapperNode [2025-03-17 14:01:01,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:01:01,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:01:01,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:01:01,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:01:01,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,379 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2025-03-17 14:01:01,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:01:01,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:01:01,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:01:01,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:01:01,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,402 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-03-17 14:01:01,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:01:01,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:01:01,422 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:01:01,422 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:01:01,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (1/1) ... [2025-03-17 14:01:01,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:01:01,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:01,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:01:01,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:01:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:01:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:01:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:01:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 14:01:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 14:01:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:01:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:01:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:01:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:01:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:01:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:01:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:01:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:01:01,474 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:01:01,571 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:01:01,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:01:01,759 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:01:01,760 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:01:01,879 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:01:01,880 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:01:01,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:01:01 BoogieIcfgContainer [2025-03-17 14:01:01,880 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:01:01,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:01:01,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:01:01,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:01:01,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:01:01" (1/3) ... [2025-03-17 14:01:01,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362661ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:01:01, skipping insertion in model container [2025-03-17 14:01:01,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:01" (2/3) ... [2025-03-17 14:01:01,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362661ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:01:01, skipping insertion in model container [2025-03-17 14:01:01,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:01:01" (3/3) ... [2025-03-17 14:01:01,891 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-03-17 14:01:01,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:01:01,904 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-03-17 14:01:01,904 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:01:01,947 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:01,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 29 transitions, 62 flow [2025-03-17 14:01:01,986 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-03-17 14:01:01,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:01,989 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 60 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-03-17 14:01:01,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 29 transitions, 62 flow [2025-03-17 14:01:01,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 29 transitions, 62 flow [2025-03-17 14:01:01,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:02,005 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;@35fa4b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:02,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 14:01:02,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:02,010 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-17 14:01:02,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:02,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:02,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:02,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-17 14:01:02,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash 217326, now seen corresponding path program 1 times [2025-03-17 14:01:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524352378] [2025-03-17 14:01:02,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:02,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:02,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:02,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:02,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:02,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:02,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524352378] [2025-03-17 14:01:02,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524352378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:02,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:02,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:02,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818504796] [2025-03-17 14:01:02,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:02,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:01:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:02,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:01:02,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:01:02,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 29 [2025-03-17 14:01:02,188 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-03-17 14:01:02,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:02,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 29 [2025-03-17 14:01:02,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:02,233 INFO L124 PetriNetUnfolderBase]: 16/65 cut-off events. [2025-03-17 14:01:02,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:02,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 65 events. 16/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 183 event pairs, 12 based on Foata normal form. 6/64 useless extension candidates. Maximal degree in co-relation 93. Up to 39 conditions per place. [2025-03-17 14:01:02,236 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 11 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-03-17 14:01:02,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 72 flow [2025-03-17 14:01:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:01:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:01:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2025-03-17 14:01:02,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2025-03-17 14:01:02,245 INFO L175 Difference]: Start difference. First operand has 28 places, 29 transitions, 62 flow. Second operand 2 states and 40 transitions. [2025-03-17 14:01:02,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 72 flow [2025-03-17 14:01:02,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 72 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:02,253 INFO L231 Difference]: Finished difference. Result has 25 places, 23 transitions, 50 flow [2025-03-17 14:01:02,254 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-03-17 14:01:02,258 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-03-17 14:01:02,258 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 23 transitions, 50 flow [2025-03-17 14:01:02,258 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-03-17 14:01:02,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:02,258 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:01:02,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:01:02,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-17 14:01:02,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2113048078, now seen corresponding path program 1 times [2025-03-17 14:01:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:02,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137330411] [2025-03-17 14:01:02,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:02,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:02,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:01:02,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:01:02,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:02,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:02,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:02,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:01:02,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:01:02,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:02,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:02,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:02,318 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:02,319 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-17 14:01:02,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-03-17 14:01:02,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-03-17 14:01:02,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-03-17 14:01:02,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-03-17 14:01:02,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2025-03-17 14:01:02,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-03-17 14:01:02,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-17 14:01:02,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:01:02,321 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 14:01:02,323 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:02,323 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 14:01:02,357 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:02,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 51 transitions, 112 flow [2025-03-17 14:01:02,377 INFO L124 PetriNetUnfolderBase]: 8/60 cut-off events. [2025-03-17 14:01:02,378 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:01:02,379 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 174 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-03-17 14:01:02,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 51 transitions, 112 flow [2025-03-17 14:01:02,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 51 transitions, 112 flow [2025-03-17 14:01:02,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:02,381 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;@35fa4b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:02,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-17 14:01:02,382 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:02,383 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-17 14:01:02,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:02,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:02,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:02,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-17 14:01:02,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash 267969, now seen corresponding path program 1 times [2025-03-17 14:01:02,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:02,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876422530] [2025-03-17 14:01:02,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:02,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:02,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:02,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:02,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:02,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:02,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876422530] [2025-03-17 14:01:02,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876422530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:02,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:02,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347577420] [2025-03-17 14:01:02,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:02,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:01:02,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:02,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:01:02,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:01:02,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 51 [2025-03-17 14:01:02,412 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-03-17 14:01:02,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:02,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 51 [2025-03-17 14:01:02,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:02,551 INFO L124 PetriNetUnfolderBase]: 282/732 cut-off events. [2025-03-17 14:01:02,552 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 14:01:02,555 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 4454 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-03-17 14:01:02,560 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 19 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2025-03-17 14:01:02,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 132 flow [2025-03-17 14:01:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:01:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:01:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2025-03-17 14:01:02,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2025-03-17 14:01:02,562 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 112 flow. Second operand 2 states and 72 transitions. [2025-03-17 14:01:02,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 132 flow [2025-03-17 14:01:02,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:02,563 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 94 flow [2025-03-17 14:01:02,563 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-03-17 14:01:02,564 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-03-17 14:01:02,564 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 94 flow [2025-03-17 14:01:02,564 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-03-17 14:01:02,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:02,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:01:02,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:01:02,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-17 14:01:02,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:02,565 INFO L85 PathProgramCache]: Analyzing trace with hash -603623862, now seen corresponding path program 1 times [2025-03-17 14:01:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:02,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11089979] [2025-03-17 14:01:02,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:02,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:02,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:01:02,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:01:02,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:02,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11089979] [2025-03-17 14:01:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11089979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:02,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718656375] [2025-03-17 14:01:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:02,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:02,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:02,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:02,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-03-17 14:01:02,670 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-03-17 14:01:02,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:02,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-03-17 14:01:02,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:02,768 INFO L124 PetriNetUnfolderBase]: 282/717 cut-off events. [2025-03-17 14:01:02,769 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 14:01:02,770 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 4269 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-03-17 14:01:02,774 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 18 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-03-17 14:01:02,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 128 flow [2025-03-17 14:01:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-17 14:01:02,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-03-17 14:01:02,776 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 94 flow. Second operand 3 states and 87 transitions. [2025-03-17 14:01:02,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 128 flow [2025-03-17 14:01:02,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:02,778 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 92 flow [2025-03-17 14:01:02,778 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-03-17 14:01:02,778 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-03-17 14:01:02,778 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 92 flow [2025-03-17 14:01:02,778 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-03-17 14:01:02,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:02,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:01:02,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:01:02,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-17 14:01:02,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:02,779 INFO L85 PathProgramCache]: Analyzing trace with hash -603623861, now seen corresponding path program 1 times [2025-03-17 14:01:02,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:02,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899459995] [2025-03-17 14:01:02,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:02,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:02,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:01:02,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:01:02,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:02,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:02,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:02,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899459995] [2025-03-17 14:01:02,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899459995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:02,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:02,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:02,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544819458] [2025-03-17 14:01:02,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:02,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:02,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:02,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:02,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:03,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-03-17 14:01:03,017 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-03-17 14:01:03,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:03,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-03-17 14:01:03,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:03,202 INFO L124 PetriNetUnfolderBase]: 428/1162 cut-off events. [2025-03-17 14:01:03,202 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-17 14:01:03,204 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 7944 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-03-17 14:01:03,208 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 38 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-03-17 14:01:03,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 232 flow [2025-03-17 14:01:03,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2025-03-17 14:01:03,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-03-17 14:01:03,211 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 92 flow. Second operand 5 states and 155 transitions. [2025-03-17 14:01:03,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 232 flow [2025-03-17 14:01:03,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:03,214 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 118 flow [2025-03-17 14:01:03,214 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-03-17 14:01:03,215 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-03-17 14:01:03,215 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 118 flow [2025-03-17 14:01:03,216 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-03-17 14:01:03,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:03,216 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-17 14:01:03,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:01:03,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-17 14:01:03,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash -791113533, now seen corresponding path program 1 times [2025-03-17 14:01:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:03,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073158730] [2025-03-17 14:01:03,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:03,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:01:03,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:01:03,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:03,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:03,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:03,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:01:03,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:01:03,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:03,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:03,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:03,240 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:03,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-17 14:01:03,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2025-03-17 14:01:03,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-03-17 14:01:03,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 11 remaining) [2025-03-17 14:01:03,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 11 remaining) [2025-03-17 14:01:03,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-03-17 14:01:03,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-03-17 14:01:03,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 11 remaining) [2025-03-17 14:01:03,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-03-17 14:01:03,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-03-17 14:01:03,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2025-03-17 14:01:03,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:01:03,241 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 14:01:03,241 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:03,241 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 14:01:03,268 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:03,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 73 transitions, 164 flow [2025-03-17 14:01:03,276 INFO L124 PetriNetUnfolderBase]: 12/87 cut-off events. [2025-03-17 14:01:03,276 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:01:03,277 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 286 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-03-17 14:01:03,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 73 transitions, 164 flow [2025-03-17 14:01:03,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 73 transitions, 164 flow [2025-03-17 14:01:03,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:03,279 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;@35fa4b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:03,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 14:01:03,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:03,280 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-17 14:01:03,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:03,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:03,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:03,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:01:03,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash 340458, now seen corresponding path program 1 times [2025-03-17 14:01:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986082865] [2025-03-17 14:01:03,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:03,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:03,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:03,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:03,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:03,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:03,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986082865] [2025-03-17 14:01:03,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986082865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:03,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:03,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996225436] [2025-03-17 14:01:03,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:03,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:01:03,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:03,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:01:03,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:01:03,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 73 [2025-03-17 14:01:03,294 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-03-17 14:01:03,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:03,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 73 [2025-03-17 14:01:03,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:03,786 INFO L124 PetriNetUnfolderBase]: 3159/6384 cut-off events. [2025-03-17 14:01:03,786 INFO L125 PetriNetUnfolderBase]: For 385/385 co-relation queries the response was YES. [2025-03-17 14:01:03,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10867 conditions, 6384 events. 3159/6384 cut-off events. For 385/385 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 51572 event pairs, 2574 based on Foata normal form. 1456/7290 useless extension candidates. Maximal degree in co-relation 1200. Up to 4260 conditions per place. [2025-03-17 14:01:03,830 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 27 selfloop transitions, 0 changer transitions 0/61 dead transitions. [2025-03-17 14:01:03,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 194 flow [2025-03-17 14:01:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:01:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:01:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2025-03-17 14:01:03,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7123287671232876 [2025-03-17 14:01:03,861 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 164 flow. Second operand 2 states and 104 transitions. [2025-03-17 14:01:03,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 194 flow [2025-03-17 14:01:03,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:03,863 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 138 flow [2025-03-17 14:01:03,863 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-03-17 14:01:03,863 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2025-03-17 14:01:03,863 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 138 flow [2025-03-17 14:01:03,863 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-03-17 14:01:03,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:03,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:01:03,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:01:03,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:01:03,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1556594037, now seen corresponding path program 1 times [2025-03-17 14:01:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:03,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853501735] [2025-03-17 14:01:03,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:03,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:01:03,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:01:03,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:03,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:03,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853501735] [2025-03-17 14:01:03,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853501735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:03,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120891186] [2025-03-17 14:01:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:03,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:03,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:03,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:03,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:03,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 73 [2025-03-17 14:01:03,938 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-03-17 14:01:03,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:03,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 73 [2025-03-17 14:01:03,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:04,290 INFO L124 PetriNetUnfolderBase]: 3159/6285 cut-off events. [2025-03-17 14:01:04,291 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-03-17 14:01:04,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10720 conditions, 6285 events. 3159/6285 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 49927 event pairs, 2574 based on Foata normal form. 0/5834 useless extension candidates. Maximal degree in co-relation 10714. Up to 4259 conditions per place. [2025-03-17 14:01:04,320 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 26 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-03-17 14:01:04,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 186 flow [2025-03-17 14:01:04,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-17 14:01:04,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5753424657534246 [2025-03-17 14:01:04,322 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 138 flow. Second operand 3 states and 126 transitions. [2025-03-17 14:01:04,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 186 flow [2025-03-17 14:01:04,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:04,324 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 134 flow [2025-03-17 14:01:04,324 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-03-17 14:01:04,324 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2025-03-17 14:01:04,324 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 134 flow [2025-03-17 14:01:04,325 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-03-17 14:01:04,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:04,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:01:04,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:01:04,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:01:04,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1556594038, now seen corresponding path program 1 times [2025-03-17 14:01:04,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:04,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611609064] [2025-03-17 14:01:04,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:04,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:04,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:01:04,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:01:04,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:04,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:04,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:04,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611609064] [2025-03-17 14:01:04,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611609064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:04,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:04,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:04,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733455501] [2025-03-17 14:01:04,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:04,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:04,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:04,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:04,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:04,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-03-17 14:01:04,459 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-03-17 14:01:04,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:04,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-03-17 14:01:04,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:05,141 INFO L124 PetriNetUnfolderBase]: 4877/10721 cut-off events. [2025-03-17 14:01:05,142 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-17 14:01:05,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17686 conditions, 10721 events. 4877/10721 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 100334 event pairs, 2966 based on Foata normal form. 171/10172 useless extension candidates. Maximal degree in co-relation 17679. Up to 4867 conditions per place. [2025-03-17 14:01:05,200 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 62 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2025-03-17 14:01:05,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 364 flow [2025-03-17 14:01:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2025-03-17 14:01:05,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410958904109589 [2025-03-17 14:01:05,202 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 134 flow. Second operand 5 states and 234 transitions. [2025-03-17 14:01:05,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 364 flow [2025-03-17 14:01:05,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:05,205 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 160 flow [2025-03-17 14:01:05,206 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-03-17 14:01:05,207 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-17 14:01:05,207 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 160 flow [2025-03-17 14:01:05,207 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-03-17 14:01:05,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:05,207 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:05,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:01:05,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:01:05,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:05,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1528886406, now seen corresponding path program 1 times [2025-03-17 14:01:05,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:05,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106578630] [2025-03-17 14:01:05,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:05,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:05,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:01:05,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:01:05,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:05,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:05,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106578630] [2025-03-17 14:01:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106578630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:05,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:05,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:05,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95994791] [2025-03-17 14:01:05,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:05,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:05,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:05,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:05,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:05,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-03-17 14:01:05,360 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-03-17 14:01:05,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:05,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-03-17 14:01:05,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:06,251 INFO L124 PetriNetUnfolderBase]: 6238/13206 cut-off events. [2025-03-17 14:01:06,251 INFO L125 PetriNetUnfolderBase]: For 3260/3260 co-relation queries the response was YES. [2025-03-17 14:01:06,281 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 122078 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-03-17 14:01:06,330 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 66 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2025-03-17 14:01:06,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 424 flow [2025-03-17 14:01:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2025-03-17 14:01:06,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6356164383561644 [2025-03-17 14:01:06,331 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 160 flow. Second operand 5 states and 232 transitions. [2025-03-17 14:01:06,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 424 flow [2025-03-17 14:01:06,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:06,337 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 186 flow [2025-03-17 14:01:06,337 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-03-17 14:01:06,338 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2025-03-17 14:01:06,338 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 186 flow [2025-03-17 14:01:06,338 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-03-17 14:01:06,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:06,338 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:06,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:01:06,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:01:06,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:06,338 INFO L85 PathProgramCache]: Analyzing trace with hash -268531734, now seen corresponding path program 1 times [2025-03-17 14:01:06,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:06,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110421307] [2025-03-17 14:01:06,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:06,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:06,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:01:06,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:01:06,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:06,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:06,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110421307] [2025-03-17 14:01:06,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110421307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:06,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556408050] [2025-03-17 14:01:06,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:06,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:06,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:06,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:01:06,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:01:06,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:01:06,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:01:06,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:06,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:06,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:01:06,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:06,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:06,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556408050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:06,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:06,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2025-03-17 14:01:06,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126470179] [2025-03-17 14:01:06,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:06,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:01:06,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:06,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:01:06,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:01:07,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-03-17 14:01:07,075 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-03-17 14:01:07,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:07,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-03-17 14:01:07,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:08,440 INFO L124 PetriNetUnfolderBase]: 9802/21447 cut-off events. [2025-03-17 14:01:08,440 INFO L125 PetriNetUnfolderBase]: For 7258/7258 co-relation queries the response was YES. [2025-03-17 14:01:08,488 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 218462 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-03-17 14:01:08,570 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 93 selfloop transitions, 7 changer transitions 0/129 dead transitions. [2025-03-17 14:01:08,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 606 flow [2025-03-17 14:01:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:01:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:01:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 291 transitions. [2025-03-17 14:01:08,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6643835616438356 [2025-03-17 14:01:08,571 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 186 flow. Second operand 6 states and 291 transitions. [2025-03-17 14:01:08,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 606 flow [2025-03-17 14:01:08,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 129 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:08,577 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 226 flow [2025-03-17 14:01:08,577 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-03-17 14:01:08,578 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2025-03-17 14:01:08,578 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 226 flow [2025-03-17 14:01:08,578 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-03-17 14:01:08,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:08,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:08,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:01:08,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 14:01:08,783 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:01:08,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash 265430334, now seen corresponding path program 1 times [2025-03-17 14:01:08,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:08,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898274688] [2025-03-17 14:01:08,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:08,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:08,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:01:08,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:01:08,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:08,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898274688] [2025-03-17 14:01:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898274688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:08,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697554278] [2025-03-17 14:01:08,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:08,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:08,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:08,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:08,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-03-17 14:01:08,820 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-03-17 14:01:08,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:08,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-03-17 14:01:08,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:09,801 INFO L124 PetriNetUnfolderBase]: 8101/16155 cut-off events. [2025-03-17 14:01:09,801 INFO L125 PetriNetUnfolderBase]: For 8563/8563 co-relation queries the response was YES. [2025-03-17 14:01:09,833 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 146655 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-03-17 14:01:09,884 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 51 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2025-03-17 14:01:09,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 398 flow [2025-03-17 14:01:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-03-17 14:01:09,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680365296803653 [2025-03-17 14:01:09,885 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 226 flow. Second operand 3 states and 149 transitions. [2025-03-17 14:01:09,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 84 transitions, 398 flow [2025-03-17 14:01:09,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:01:09,895 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 227 flow [2025-03-17 14:01:09,895 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-03-17 14:01:09,895 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2025-03-17 14:01:09,895 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 227 flow [2025-03-17 14:01:09,895 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-03-17 14:01:09,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:09,896 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-17 14:01:09,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:01:09,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:01:09,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:09,896 INFO L85 PathProgramCache]: Analyzing trace with hash -807989711, now seen corresponding path program 1 times [2025-03-17 14:01:09,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:09,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214694605] [2025-03-17 14:01:09,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:09,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:09,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:01:09,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:01:09,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:09,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:09,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:09,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:01:09,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:01:09,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:09,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:09,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:09,911 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:09,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-17 14:01:09,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-03-17 14:01:09,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-03-17 14:01:09,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (10 of 14 remaining) [2025-03-17 14:01:09,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-03-17 14:01:09,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-03-17 14:01:09,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-03-17 14:01:09,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-03-17 14:01:09,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-03-17 14:01:09,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-03-17 14:01:09,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 14 remaining) [2025-03-17 14:01:09,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-03-17 14:01:09,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-03-17 14:01:09,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2025-03-17 14:01:09,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:01:09,912 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:09,912 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:09,912 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 14:01:09,935 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:09,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 95 transitions, 218 flow [2025-03-17 14:01:09,946 INFO L124 PetriNetUnfolderBase]: 16/114 cut-off events. [2025-03-17 14:01:09,947 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 14:01:09,947 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 412 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-03-17 14:01:09,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 95 transitions, 218 flow [2025-03-17 14:01:09,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 95 transitions, 218 flow [2025-03-17 14:01:09,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:09,949 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;@35fa4b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:09,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-17 14:01:09,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:09,950 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-17 14:01:09,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:09,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:09,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:09,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-17 14:01:09,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash 434793, now seen corresponding path program 1 times [2025-03-17 14:01:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446617224] [2025-03-17 14:01:09,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:09,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:09,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:09,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:09,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:09,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446617224] [2025-03-17 14:01:09,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446617224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:09,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:09,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641877247] [2025-03-17 14:01:09,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:09,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:01:09,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:09,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:01:09,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:01:09,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 95 [2025-03-17 14:01:09,963 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-03-17 14:01:09,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:09,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 95 [2025-03-17 14:01:09,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:12,935 INFO L124 PetriNetUnfolderBase]: 30501/53151 cut-off events. [2025-03-17 14:01:12,936 INFO L125 PetriNetUnfolderBase]: For 4795/4795 co-relation queries the response was YES. [2025-03-17 14:01:13,047 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 498555 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-03-17 14:01:13,223 INFO L140 encePairwiseOnDemand]: 86/95 looper letters, 35 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2025-03-17 14:01:13,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 258 flow [2025-03-17 14:01:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:01:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:01:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2025-03-17 14:01:13,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7157894736842105 [2025-03-17 14:01:13,224 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 218 flow. Second operand 2 states and 136 transitions. [2025-03-17 14:01:13,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 258 flow [2025-03-17 14:01:13,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 252 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:13,227 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 182 flow [2025-03-17 14:01:13,227 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-03-17 14:01:13,227 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -6 predicate places. [2025-03-17 14:01:13,227 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 182 flow [2025-03-17 14:01:13,227 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-03-17 14:01:13,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:13,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:01:13,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:01:13,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-17 14:01:13,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash 72701525, now seen corresponding path program 1 times [2025-03-17 14:01:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:13,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038392671] [2025-03-17 14:01:13,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:13,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:01:13,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:01:13,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:13,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:13,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:13,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038392671] [2025-03-17 14:01:13,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038392671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:13,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461705577] [2025-03-17 14:01:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:13,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:13,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:13,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:13,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 95 [2025-03-17 14:01:13,277 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-03-17 14:01:13,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:13,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 95 [2025-03-17 14:01:13,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:16,039 INFO L124 PetriNetUnfolderBase]: 30501/52464 cut-off events. [2025-03-17 14:01:16,039 INFO L125 PetriNetUnfolderBase]: For 2307/2307 co-relation queries the response was YES. [2025-03-17 14:01:16,168 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 483571 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-03-17 14:01:16,384 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 34 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2025-03-17 14:01:16,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 244 flow [2025-03-17 14:01:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-17 14:01:16,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2025-03-17 14:01:16,386 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 182 flow. Second operand 3 states and 165 transitions. [2025-03-17 14:01:16,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 244 flow [2025-03-17 14:01:16,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:16,390 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 176 flow [2025-03-17 14:01:16,390 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-03-17 14:01:16,390 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -8 predicate places. [2025-03-17 14:01:16,390 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 176 flow [2025-03-17 14:01:16,390 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-03-17 14:01:16,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:16,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:01:16,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:01:16,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-17 14:01:16,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash 72701526, now seen corresponding path program 1 times [2025-03-17 14:01:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:16,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106317824] [2025-03-17 14:01:16,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:16,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:16,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:01:16,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:01:16,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:16,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:16,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:16,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106317824] [2025-03-17 14:01:16,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106317824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:16,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:16,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:16,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730317056] [2025-03-17 14:01:16,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:16,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:16,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:16,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:16,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:16,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 95 [2025-03-17 14:01:16,512 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-03-17 14:01:16,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:16,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 95 [2025-03-17 14:01:16,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:21,404 INFO L124 PetriNetUnfolderBase]: 47291/86598 cut-off events. [2025-03-17 14:01:21,404 INFO L125 PetriNetUnfolderBase]: For 3185/3185 co-relation queries the response was YES. [2025-03-17 14:01:21,611 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 908734 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-03-17 14:01:21,886 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 86 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2025-03-17 14:01:21,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 130 transitions, 496 flow [2025-03-17 14:01:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 313 transitions. [2025-03-17 14:01:21,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589473684210526 [2025-03-17 14:01:21,887 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 176 flow. Second operand 5 states and 313 transitions. [2025-03-17 14:01:21,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 130 transitions, 496 flow [2025-03-17 14:01:21,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 130 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:21,893 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 202 flow [2025-03-17 14:01:21,893 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-03-17 14:01:21,894 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -3 predicate places. [2025-03-17 14:01:21,894 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 202 flow [2025-03-17 14:01:21,894 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-03-17 14:01:21,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:21,894 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:21,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:01:21,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-17 14:01:21,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash -692824594, now seen corresponding path program 1 times [2025-03-17 14:01:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757115728] [2025-03-17 14:01:21,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:21,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:01:21,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:01:21,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:21,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757115728] [2025-03-17 14:01:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757115728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897274688] [2025-03-17 14:01:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:21,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:21,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:21,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:22,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 95 [2025-03-17 14:01:22,003 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-03-17 14:01:22,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:22,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 95 [2025-03-17 14:01:22,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:28,970 INFO L124 PetriNetUnfolderBase]: 60778/111143 cut-off events. [2025-03-17 14:01:28,971 INFO L125 PetriNetUnfolderBase]: For 23902/23902 co-relation queries the response was YES. [2025-03-17 14:01:29,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205834 conditions, 111143 events. 60778/111143 cut-off events. For 23902/23902 co-relation queries the response was YES. Maximal size of possible extension queue 4396. Compared 1189343 event pairs, 33712 based on Foata normal form. 1539/105366 useless extension candidates. Maximal degree in co-relation 205824. Up to 56145 conditions per place. [2025-03-17 14:01:29,747 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 90 selfloop transitions, 5 changer transitions 0/134 dead transitions. [2025-03-17 14:01:29,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 134 transitions, 556 flow [2025-03-17 14:01:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 311 transitions. [2025-03-17 14:01:29,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547368421052632 [2025-03-17 14:01:29,750 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 202 flow. Second operand 5 states and 311 transitions. [2025-03-17 14:01:29,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 134 transitions, 556 flow [2025-03-17 14:01:29,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:29,778 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 228 flow [2025-03-17 14:01:29,779 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-03-17 14:01:29,779 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 2 predicate places. [2025-03-17 14:01:29,779 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 228 flow [2025-03-17 14:01:29,790 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-03-17 14:01:29,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:29,790 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:29,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:01:29,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-17 14:01:29,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1188136190, now seen corresponding path program 1 times [2025-03-17 14:01:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:29,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381833451] [2025-03-17 14:01:29,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:29,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:29,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:01:29,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:01:29,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:29,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:29,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381833451] [2025-03-17 14:01:29,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381833451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:29,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676523749] [2025-03-17 14:01:29,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:29,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:29,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:29,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:01:29,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:01:29,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:01:29,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:01:29,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:29,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:29,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:01:29,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:30,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:30,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676523749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:30,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:30,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2025-03-17 14:01:30,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453351360] [2025-03-17 14:01:30,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:30,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:01:30,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:30,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:01:30,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:01:30,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 95 [2025-03-17 14:01:30,295 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-03-17 14:01:30,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:30,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 95 [2025-03-17 14:01:30,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand