./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-lit/sssc12_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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-lit/sssc12_variant.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 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:11:17,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:11:17,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:11:17,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:11:17,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:11:17,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:11:17,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:11:17,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:11:17,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:11:17,667 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:11:17,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:11:17,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:11:17,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:11:17,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:11:17,668 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:11:17,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:11:17,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:11:17,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:11:17,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:11:17,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:11:17,668 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:11:17,668 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:11:17,669 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:11:17,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:11:17,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:11:17,669 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:11:17,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:11:17,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:11:17,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:11:17,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:11:17,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:11:17,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:11:17,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:11:17,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:11:17,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:11:17,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:11:17,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:11:17,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:11:17,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:11:17,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:11:17,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:11:17,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:11:17,673 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 -> 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 [2025-03-09 01:11:17,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:11:17,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:11:17,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:11:17,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:11:17,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:11:17,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-03-09 01:11:19,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f729ce5/4fbbad1bf0364d26b78e435243f59248/FLAG21b4cf988 [2025-03-09 01:11:19,341 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:11:19,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-03-09 01:11:19,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f729ce5/4fbbad1bf0364d26b78e435243f59248/FLAG21b4cf988 [2025-03-09 01:11:19,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f729ce5/4fbbad1bf0364d26b78e435243f59248 [2025-03-09 01:11:19,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:11:19,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:11:19,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:11:19,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:11:19,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:11:19,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f6da3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19, skipping insertion in model container [2025-03-09 01:11:19,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:11:19,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:11:19,681 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:11:19,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:11:19,763 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:11:19,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19 WrapperNode [2025-03-09 01:11:19,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:11:19,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:11:19,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:11:19,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:11:19,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,798 INFO L138 Inliner]: procedures = 272, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2025-03-09 01:11:19,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:11:19,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:11:19,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:11:19,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:11:19,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,820 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 5, 3]. 50 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-03-09 01:11:19,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,824 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:11:19,829 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:11:19,829 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:11:19,829 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:11:19,831 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (1/1) ... [2025-03-09 01:11:19,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:11:19,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:11:19,858 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-09 01:11:19,860 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-09 01:11:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-09 01:11:19,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-09 01:11:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:11:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:11:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:11:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:11:19,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:11:19,879 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:11:20,002 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:11:20,004 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:11:20,185 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:11:20,186 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:11:20,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:11:20,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:11:20,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:11:20 BoogieIcfgContainer [2025-03-09 01:11:20,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:11:20,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:11:20,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:11:20,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:11:20,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:11:19" (1/3) ... [2025-03-09 01:11:20,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c996d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:11:20, skipping insertion in model container [2025-03-09 01:11:20,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:19" (2/3) ... [2025-03-09 01:11:20,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c996d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:11:20, skipping insertion in model container [2025-03-09 01:11:20,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:11:20" (3/3) ... [2025-03-09 01:11:20,294 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2025-03-09 01:11:20,305 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:11:20,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12_variant.i that has 2 procedures, 29 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-09 01:11:20,309 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:11:20,349 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:11:20,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 32 transitions, 68 flow [2025-03-09 01:11:20,400 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2025-03-09 01:11:20,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:11:20,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-09 01:11:20,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 32 transitions, 68 flow [2025-03-09 01:11:20,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 32 transitions, 68 flow [2025-03-09 01:11:20,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:11:20,421 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;@639852aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:11:20,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 01:11:20,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:11:20,441 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:11:20,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:11:20,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:20,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:11:20,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-09 01:11:20,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash 221122, now seen corresponding path program 1 times [2025-03-09 01:11:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:20,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937128795] [2025-03-09 01:11:20,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:20,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:20,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:11:20,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:11:20,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:20,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:20,575 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-09 01:11:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937128795] [2025-03-09 01:11:20,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937128795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:20,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:20,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:11:20,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321838370] [2025-03-09 01:11:20,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:20,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:11:20,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:20,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:11:20,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:11:20,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 32 [2025-03-09 01:11:20,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 68 flow. Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-09 01:11:20,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:20,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 32 [2025-03-09 01:11:20,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:11:20,648 INFO L124 PetriNetUnfolderBase]: 17/83 cut-off events. [2025-03-09 01:11:20,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:11:20,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 83 events. 17/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 255 event pairs, 14 based on Foata normal form. 6/74 useless extension candidates. Maximal degree in co-relation 119. Up to 44 conditions per place. [2025-03-09 01:11:20,650 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 12 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2025-03-09 01:11:20,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 80 flow [2025-03-09 01:11:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 01:11:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 01:11:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2025-03-09 01:11:20,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.703125 [2025-03-09 01:11:20,660 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 68 flow. Second operand 2 states and 45 transitions. [2025-03-09 01:11:20,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 80 flow [2025-03-09 01:11:20,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:11:20,665 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 56 flow [2025-03-09 01:11:20,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2025-03-09 01:11:20,668 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2025-03-09 01:11:20,669 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 56 flow [2025-03-09 01:11:20,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-09 01:11:20,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:20,669 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 01:11:20,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:11:20,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-09 01:11:20,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:20,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2001966204, now seen corresponding path program 1 times [2025-03-09 01:11:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:20,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683550580] [2025-03-09 01:11:20,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:20,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:11:20,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:11:20,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:20,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:11:20,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:11:20,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:11:20,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:11:20,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:20,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:11:20,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:11:20,739 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:11:20,741 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-09 01:11:20,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2025-03-09 01:11:20,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-03-09 01:11:20,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2025-03-09 01:11:20,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-03-09 01:11:20,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-03-09 01:11:20,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-03-09 01:11:20,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-03-09 01:11:20,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 16 remaining) [2025-03-09 01:11:20,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-03-09 01:11:20,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-03-09 01:11:20,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-03-09 01:11:20,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2025-03-09 01:11:20,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-03-09 01:11:20,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-03-09 01:11:20,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-03-09 01:11:20,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:11:20,746 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 01:11:20,748 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:11:20,748 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 01:11:20,773 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:11:20,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 57 transitions, 124 flow [2025-03-09 01:11:20,791 INFO L124 PetriNetUnfolderBase]: 6/66 cut-off events. [2025-03-09 01:11:20,792 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:11:20,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 6/66 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 172 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-03-09 01:11:20,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 57 transitions, 124 flow [2025-03-09 01:11:20,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 57 transitions, 124 flow [2025-03-09 01:11:20,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:11:20,795 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;@639852aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:11:20,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-09 01:11:20,796 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:11:20,796 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:11:20,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:11:20,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:20,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:11:20,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:11:20,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash 277723, now seen corresponding path program 1 times [2025-03-09 01:11:20,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:20,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124964680] [2025-03-09 01:11:20,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:20,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:11:20,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:11:20,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:20,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:20,830 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-09 01:11:20,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:20,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124964680] [2025-03-09 01:11:20,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124964680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:20,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:20,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:11:20,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372614969] [2025-03-09 01:11:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:20,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:11:20,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:20,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:11:20,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:11:20,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2025-03-09 01:11:20,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 124 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-09 01:11:20,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:20,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2025-03-09 01:11:20,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:11:21,024 INFO L124 PetriNetUnfolderBase]: 409/1275 cut-off events. [2025-03-09 01:11:21,025 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-09 01:11:21,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 1275 events. 409/1275 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8926 event pairs, 325 based on Foata normal form. 114/1104 useless extension candidates. Maximal degree in co-relation 1448. Up to 652 conditions per place. [2025-03-09 01:11:21,037 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 21 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2025-03-09 01:11:21,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 148 flow [2025-03-09 01:11:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 01:11:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 01:11:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2025-03-09 01:11:21,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2025-03-09 01:11:21,039 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 124 flow. Second operand 2 states and 82 transitions. [2025-03-09 01:11:21,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 148 flow [2025-03-09 01:11:21,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:11:21,040 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 106 flow [2025-03-09 01:11:21,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-03-09 01:11:21,041 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2025-03-09 01:11:21,041 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 106 flow [2025-03-09 01:11:21,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-09 01:11:21,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:21,041 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-09 01:11:21,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:11:21,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:11:21,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:21,041 INFO L85 PathProgramCache]: Analyzing trace with hash 511521788, now seen corresponding path program 1 times [2025-03-09 01:11:21,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:21,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086975172] [2025-03-09 01:11:21,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:21,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:11:21,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:11:21,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:21,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:11:21,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:11:21,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:11:21,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:11:21,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:21,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:11:21,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:11:21,071 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:11:21,071 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-09 01:11:21,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (21 of 23 remaining) [2025-03-09 01:11:21,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2025-03-09 01:11:21,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2025-03-09 01:11:21,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2025-03-09 01:11:21,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-03-09 01:11:21,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-03-09 01:11:21,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-03-09 01:11:21,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-03-09 01:11:21,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-03-09 01:11:21,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-03-09 01:11:21,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2025-03-09 01:11:21,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:11:21,073 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 01:11:21,074 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:11:21,074 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 01:11:21,104 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:11:21,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 82 transitions, 182 flow [2025-03-09 01:11:21,114 INFO L124 PetriNetUnfolderBase]: 9/96 cut-off events. [2025-03-09 01:11:21,115 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:11:21,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 96 events. 9/96 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 319 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2025-03-09 01:11:21,116 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 82 transitions, 182 flow [2025-03-09 01:11:21,117 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 82 transitions, 182 flow [2025-03-09 01:11:21,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:11:21,119 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;@639852aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:11:21,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-09 01:11:21,120 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:11:21,121 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:11:21,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:11:21,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:21,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:11:21,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:11:21,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash 359149, now seen corresponding path program 1 times [2025-03-09 01:11:21,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:21,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084168772] [2025-03-09 01:11:21,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:21,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:21,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:11:21,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:11:21,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:21,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:21,152 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-09 01:11:21,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:21,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084168772] [2025-03-09 01:11:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084168772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:21,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:21,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:11:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753817774] [2025-03-09 01:11:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:21,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:11:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:21,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:11:21,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:11:21,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 82 [2025-03-09 01:11:21,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 182 flow. Second operand has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:21,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:21,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 82 [2025-03-09 01:11:21,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:11:22,354 INFO L124 PetriNetUnfolderBase]: 6301/15930 cut-off events. [2025-03-09 01:11:22,354 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2025-03-09 01:11:22,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24790 conditions, 15930 events. 6301/15930 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 165897 event pairs, 4948 based on Foata normal form. 1572/13856 useless extension candidates. Maximal degree in co-relation 7164. Up to 8542 conditions per place. [2025-03-09 01:11:22,486 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 30 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2025-03-09 01:11:22,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 218 flow [2025-03-09 01:11:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 01:11:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 01:11:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 119 transitions. [2025-03-09 01:11:22,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725609756097561 [2025-03-09 01:11:22,488 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 182 flow. Second operand 2 states and 119 transitions. [2025-03-09 01:11:22,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 218 flow [2025-03-09 01:11:22,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 216 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-09 01:11:22,490 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 156 flow [2025-03-09 01:11:22,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2025-03-09 01:11:22,491 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -5 predicate places. [2025-03-09 01:11:22,491 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 156 flow [2025-03-09 01:11:22,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:22,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:22,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:11:22,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:11:22,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:11:22,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash 501387698, now seen corresponding path program 1 times [2025-03-09 01:11:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350322369] [2025-03-09 01:11:22,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:22,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:11:22,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:11:22,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:22,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:22,604 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-09 01:11:22,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350322369] [2025-03-09 01:11:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350322369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:22,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:22,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:11:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105522168] [2025-03-09 01:11:22,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:22,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:11:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:22,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:11:22,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:11:22,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 82 [2025-03-09 01:11:22,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-09 01:11:22,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:22,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 82 [2025-03-09 01:11:22,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:11:23,979 INFO L124 PetriNetUnfolderBase]: 11513/20722 cut-off events. [2025-03-09 01:11:23,979 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2025-03-09 01:11:24,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36718 conditions, 20722 events. 11513/20722 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 168558 event pairs, 9521 based on Foata normal form. 0/20537 useless extension candidates. Maximal degree in co-relation 36712. Up to 15622 conditions per place. [2025-03-09 01:11:24,100 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 35 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2025-03-09 01:11:24,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 210 flow [2025-03-09 01:11:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:11:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:11:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-03-09 01:11:24,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-09 01:11:24,103 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 156 flow. Second operand 3 states and 123 transitions. [2025-03-09 01:11:24,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 210 flow [2025-03-09 01:11:24,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:11:24,106 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 140 flow [2025-03-09 01:11:24,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-03-09 01:11:24,108 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -12 predicate places. [2025-03-09 01:11:24,109 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 140 flow [2025-03-09 01:11:24,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-09 01:11:24,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:24,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:11:24,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:11:24,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:11:24,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 501387699, now seen corresponding path program 1 times [2025-03-09 01:11:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:24,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65319331] [2025-03-09 01:11:24,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:24,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:11:24,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:11:24,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:24,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:24,444 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-09 01:11:24,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:24,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65319331] [2025-03-09 01:11:24,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65319331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:24,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:24,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:11:24,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585653993] [2025-03-09 01:11:24,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:24,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:11:24,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:24,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:11:24,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:11:24,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 82 [2025-03-09 01:11:24,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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-09 01:11:24,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:24,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 82 [2025-03-09 01:11:24,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:11:26,211 INFO L124 PetriNetUnfolderBase]: 14277/29732 cut-off events. [2025-03-09 01:11:26,211 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-03-09 01:11:26,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49727 conditions, 29732 events. 14277/29732 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 298856 event pairs, 3802 based on Foata normal form. 546/26885 useless extension candidates. Maximal degree in co-relation 49720. Up to 12292 conditions per place. [2025-03-09 01:11:26,351 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 95 selfloop transitions, 10 changer transitions 0/132 dead transitions. [2025-03-09 01:11:26,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 132 transitions, 532 flow [2025-03-09 01:11:26,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:11:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:11:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 330 transitions. [2025-03-09 01:11:26,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707317073170732 [2025-03-09 01:11:26,354 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 140 flow. Second operand 6 states and 330 transitions. [2025-03-09 01:11:26,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 132 transitions, 532 flow [2025-03-09 01:11:26,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 132 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:11:26,362 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 214 flow [2025-03-09 01:11:26,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2025-03-09 01:11:26,364 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -4 predicate places. [2025-03-09 01:11:26,365 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 214 flow [2025-03-09 01:11:26,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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-09 01:11:26,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:26,365 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-09 01:11:26,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:11:26,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:11:26,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1768059197, now seen corresponding path program 1 times [2025-03-09 01:11:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:26,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936883378] [2025-03-09 01:11:26,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:26,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:11:26,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:11:26,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:26,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:11:26,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:11:26,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:11:26,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:11:26,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:26,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:11:26,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:11:26,401 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (28 of 30 remaining) [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (21 of 30 remaining) [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2025-03-09 01:11:26,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2025-03-09 01:11:26,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2025-03-09 01:11:26,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2025-03-09 01:11:26,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2025-03-09 01:11:26,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 30 remaining) [2025-03-09 01:11:26,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2025-03-09 01:11:26,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 30 remaining) [2025-03-09 01:11:26,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:11:26,404 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 01:11:26,405 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:11:26,405 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 01:11:26,436 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:11:26,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 107 transitions, 242 flow [2025-03-09 01:11:26,448 INFO L124 PetriNetUnfolderBase]: 12/126 cut-off events. [2025-03-09 01:11:26,448 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 01:11:26,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 126 events. 12/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 468 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 108. Up to 5 conditions per place. [2025-03-09 01:11:26,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 107 transitions, 242 flow [2025-03-09 01:11:26,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 107 transitions, 242 flow [2025-03-09 01:11:26,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:11:26,452 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;@639852aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:11:26,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-09 01:11:26,454 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:11:26,454 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:11:26,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:11:26,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:26,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:11:26,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-03-09 01:11:26,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:26,455 INFO L85 PathProgramCache]: Analyzing trace with hash 465400, now seen corresponding path program 1 times [2025-03-09 01:11:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:26,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810444478] [2025-03-09 01:11:26,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:26,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:11:26,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:11:26,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:26,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:26,470 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-09 01:11:26,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:26,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810444478] [2025-03-09 01:11:26,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810444478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:11:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126065983] [2025-03-09 01:11:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:26,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:11:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:26,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:11:26,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:11:26,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 107 [2025-03-09 01:11:26,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 107 transitions, 242 flow. Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:26,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:26,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 107 [2025-03-09 01:11:26,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:11:35,896 INFO L124 PetriNetUnfolderBase]: 79731/172664 cut-off events. [2025-03-09 01:11:35,896 INFO L125 PetriNetUnfolderBase]: For 7903/7903 co-relation queries the response was YES. [2025-03-09 01:11:36,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276351 conditions, 172664 events. 79731/172664 cut-off events. For 7903/7903 co-relation queries the response was YES. Maximal size of possible extension queue 5970. Compared 2224587 event pairs, 62793 based on Foata normal form. 18627/154596 useless extension candidates. Maximal degree in co-relation 26460. Up to 100038 conditions per place. [2025-03-09 01:11:37,055 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 39 selfloop transitions, 0 changer transitions 0/92 dead transitions. [2025-03-09 01:11:37,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 290 flow [2025-03-09 01:11:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 01:11:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 01:11:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2025-03-09 01:11:37,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7289719626168224 [2025-03-09 01:11:37,056 INFO L175 Difference]: Start difference. First operand has 104 places, 107 transitions, 242 flow. Second operand 2 states and 156 transitions. [2025-03-09 01:11:37,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 290 flow [2025-03-09 01:11:37,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 284 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-09 01:11:37,060 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 206 flow [2025-03-09 01:11:37,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=206, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2025-03-09 01:11:37,061 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -6 predicate places. [2025-03-09 01:11:37,061 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 206 flow [2025-03-09 01:11:37,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:37,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:37,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:11:37,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:11:37,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-03-09 01:11:37,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:37,062 INFO L85 PathProgramCache]: Analyzing trace with hash 844142970, now seen corresponding path program 1 times [2025-03-09 01:11:37,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:37,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023525824] [2025-03-09 01:11:37,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:37,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:37,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:11:37,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:11:37,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:37,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:37,107 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-09 01:11:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:37,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023525824] [2025-03-09 01:11:37,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023525824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:37,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:37,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:11:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259311177] [2025-03-09 01:11:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:37,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:11:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:37,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:11:37,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:11:37,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 107 [2025-03-09 01:11:37,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:37,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:37,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 107 [2025-03-09 01:11:37,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand