./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-lit/sssc12.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:51:51,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:51:51,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:51:51,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:51:51,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:51:51,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:51:51,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:51:51,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:51:51,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:51:51,391 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:51:51,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:51:51,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:51:51,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:51:51,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:51:51,392 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:51:51,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:51:51,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:51:51,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:51:51,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:51:51,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:51:51,392 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:51:51,392 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:51:51,392 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:51:51,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:51:51,392 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:51:51,393 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:51:51,393 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:51:51,393 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:51:51,393 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:51:51,393 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:51:51,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:51:51,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:51:51,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:51:51,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:51:51,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:51:51,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:51:51,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:51:51,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:51:51,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:51:51,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:51:51,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:51:51,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:51:51,394 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-02-06 12:51:51,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:51:51,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:51:51,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:51:51,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:51:51,567 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:51:51,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-02-06 12:51:52,747 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1161c7b96/eb7b5b7707c143418809169c38c2a9ae/FLAG6adef7715 [2025-02-06 12:51:53,086 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:51:53,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-02-06 12:51:53,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1161c7b96/eb7b5b7707c143418809169c38c2a9ae/FLAG6adef7715 [2025-02-06 12:51:53,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1161c7b96/eb7b5b7707c143418809169c38c2a9ae [2025-02-06 12:51:53,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:51:53,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:51:53,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:51:53,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:51:53,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:51:53,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36402bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53, skipping insertion in model container [2025-02-06 12:51:53,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:51:53,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:51:53,468 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:51:53,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:51:53,571 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:51:53,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53 WrapperNode [2025-02-06 12:51:53,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:51:53,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:51:53,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:51:53,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:51:53,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,616 INFO L138 Inliner]: procedures = 272, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-02-06 12:51:53,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:51:53,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:51:53,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:51:53,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:51:53,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,641 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 5, 1]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-02-06 12:51:53,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:51:53,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:51:53,662 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:51:53,662 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:51:53,662 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (1/1) ... [2025-02-06 12:51:53,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:51:53,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:53,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:51:53,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:51:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-02-06 12:51:53,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-02-06 12:51:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:51:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:51:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:51:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:51:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:51:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:51:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:51:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:51:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:51:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:51:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:51:53,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:51:53,717 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:51:53,819 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:51:53,820 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:51:53,937 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:51:53,937 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:51:54,047 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:51:54,047 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:51:54,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:54 BoogieIcfgContainer [2025-02-06 12:51:54,048 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:51:54,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:51:54,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:51:54,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:51:54,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:51:53" (1/3) ... [2025-02-06 12:51:54,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177a1de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:51:54, skipping insertion in model container [2025-02-06 12:51:54,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:53" (2/3) ... [2025-02-06 12:51:54,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177a1de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:51:54, skipping insertion in model container [2025-02-06 12:51:54,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:54" (3/3) ... [2025-02-06 12:51:54,059 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-02-06 12:51:54,070 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:51:54,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 23 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-06 12:51:54,072 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:51:54,116 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:51:54,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 26 transitions, 56 flow [2025-02-06 12:51:54,163 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-02-06 12:51:54,165 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:54,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 30 events. 3/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-06 12:51:54,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 26 transitions, 56 flow [2025-02-06 12:51:54,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 26 transitions, 56 flow [2025-02-06 12:51:54,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:51:54,182 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;@611f2258, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:51:54,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:51:54,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:51:54,186 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:51:54,186 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:54,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:54,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:51:54,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-02-06 12:51:54,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash 188343, now seen corresponding path program 1 times [2025-02-06 12:51:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:54,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278722405] [2025-02-06 12:51:54,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:54,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:54,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:51:54,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:51:54,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:54,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:54,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:54,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278722405] [2025-02-06 12:51:54,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278722405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:54,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:54,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:51:54,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728119895] [2025-02-06 12:51:54,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:54,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:51:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:54,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:51:54,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:51:54,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2025-02-06 12:51:54,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 26 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:54,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:54,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2025-02-06 12:51:54,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:54,394 INFO L124 PetriNetUnfolderBase]: 19/67 cut-off events. [2025-02-06 12:51:54,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:54,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 67 events. 19/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 172 event pairs, 16 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 108. Up to 49 conditions per place. [2025-02-06 12:51:54,397 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 13 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2025-02-06 12:51:54,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 70 flow [2025-02-06 12:51:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:51:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:51:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-02-06 12:51:54,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2025-02-06 12:51:54,407 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 56 flow. Second operand 2 states and 32 transitions. [2025-02-06 12:51:54,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 70 flow [2025-02-06 12:51:54,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 70 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:51:54,414 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 44 flow [2025-02-06 12:51:54,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-02-06 12:51:54,420 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2025-02-06 12:51:54,421 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 44 flow [2025-02-06 12:51:54,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:54,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:54,421 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 12:51:54,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:51:54,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-02-06 12:51:54,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1316046451, now seen corresponding path program 1 times [2025-02-06 12:51:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:54,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377299435] [2025-02-06 12:51:54,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:54,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:51:54,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:51:54,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:54,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:51:54,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:51:54,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:51:54,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:51:54,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:54,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:51:54,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:51:54,475 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:51:54,476 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-06 12:51:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-02-06 12:51:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-02-06 12:51:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2025-02-06 12:51:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-02-06 12:51:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2025-02-06 12:51:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-02-06 12:51:54,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-06 12:51:54,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:51:54,478 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:51:54,480 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:51:54,480 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:51:54,496 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:51:54,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 100 flow [2025-02-06 12:51:54,505 INFO L124 PetriNetUnfolderBase]: 6/54 cut-off events. [2025-02-06 12:51:54,506 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:51:54,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 54 events. 6/54 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 125 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 3 conditions per place. [2025-02-06 12:51:54,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 45 transitions, 100 flow [2025-02-06 12:51:54,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 45 transitions, 100 flow [2025-02-06 12:51:54,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:51:54,508 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;@611f2258, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:51:54,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 12:51:54,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:51:54,510 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:51:54,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:54,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:54,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:51:54,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 12:51:54,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash 233028, now seen corresponding path program 1 times [2025-02-06 12:51:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:54,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632652815] [2025-02-06 12:51:54,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:54,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:51:54,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:51:54,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:54,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:54,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:54,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632652815] [2025-02-06 12:51:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632652815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:54,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:54,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:51:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091022231] [2025-02-06 12:51:54,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:51:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:54,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:51:54,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:51:54,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-02-06 12:51:54,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 100 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:54,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:54,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-02-06 12:51:54,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:54,682 INFO L124 PetriNetUnfolderBase]: 505/1053 cut-off events. [2025-02-06 12:51:54,682 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-06 12:51:54,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 1053 events. 505/1053 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5833 event pairs, 412 based on Foata normal form. 126/1041 useless extension candidates. Maximal degree in co-relation 1398. Up to 805 conditions per place. [2025-02-06 12:51:54,690 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 23 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-02-06 12:51:54,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 128 flow [2025-02-06 12:51:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:51:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:51:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2025-02-06 12:51:54,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2025-02-06 12:51:54,692 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 100 flow. Second operand 2 states and 56 transitions. [2025-02-06 12:51:54,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 128 flow [2025-02-06 12:51:54,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:51:54,693 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 82 flow [2025-02-06 12:51:54,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-02-06 12:51:54,694 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2025-02-06 12:51:54,695 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 82 flow [2025-02-06 12:51:54,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:54,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:54,695 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-06 12:51:54,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:51:54,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 12:51:54,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash 379543313, now seen corresponding path program 1 times [2025-02-06 12:51:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:54,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583316366] [2025-02-06 12:51:54,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:54,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:51:54,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:51:54,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:54,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:51:54,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:51:54,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:51:54,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:51:54,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:54,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:51:54,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:51:54,730 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:51:54,730 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 12:51:54,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 11 remaining) [2025-02-06 12:51:54,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-02-06 12:51:54,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2025-02-06 12:51:54,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 11 remaining) [2025-02-06 12:51:54,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-02-06 12:51:54,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-02-06 12:51:54,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 11 remaining) [2025-02-06 12:51:54,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-02-06 12:51:54,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-02-06 12:51:54,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2025-02-06 12:51:54,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:51:54,731 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:51:54,732 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:51:54,732 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:51:54,788 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:51:54,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 64 transitions, 146 flow [2025-02-06 12:51:54,798 INFO L124 PetriNetUnfolderBase]: 9/78 cut-off events. [2025-02-06 12:51:54,798 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 12:51:54,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 78 events. 9/78 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 213 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2025-02-06 12:51:54,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 64 transitions, 146 flow [2025-02-06 12:51:54,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 64 transitions, 146 flow [2025-02-06 12:51:54,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:51:54,803 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;@611f2258, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:51:54,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 12:51:54,805 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:51:54,805 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:51:54,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:54,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:54,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:51:54,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 12:51:54,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:54,806 INFO L85 PathProgramCache]: Analyzing trace with hash 296580, now seen corresponding path program 1 times [2025-02-06 12:51:54,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:54,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443663766] [2025-02-06 12:51:54,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:54,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:54,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:51:54,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:51:54,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:54,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:54,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-02-06 12:51:54,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443663766] [2025-02-06 12:51:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443663766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:54,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:54,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:51:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134193608] [2025-02-06 12:51:54,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:54,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:51:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:54,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:51:54,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:51:54,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2025-02-06 12:51:54,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:54,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:54,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2025-02-06 12:51:54,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:55,956 INFO L124 PetriNetUnfolderBase]: 8379/13988 cut-off events. [2025-02-06 12:51:55,957 INFO L125 PetriNetUnfolderBase]: For 628/628 co-relation queries the response was YES. [2025-02-06 12:51:55,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25772 conditions, 13988 events. 8379/13988 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 99873 event pairs, 6822 based on Foata normal form. 1854/13830 useless extension candidates. Maximal degree in co-relation 4138. Up to 11391 conditions per place. [2025-02-06 12:51:56,045 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 33 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2025-02-06 12:51:56,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 188 flow [2025-02-06 12:51:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:51:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:51:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-02-06 12:51:56,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-02-06 12:51:56,046 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 146 flow. Second operand 2 states and 80 transitions. [2025-02-06 12:51:56,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 188 flow [2025-02-06 12:51:56,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 186 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 12:51:56,048 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 120 flow [2025-02-06 12:51:56,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-02-06 12:51:56,049 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2025-02-06 12:51:56,049 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 120 flow [2025-02-06 12:51:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:56,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:56,049 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-06 12:51:56,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:51:56,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 12:51:56,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1835087666, now seen corresponding path program 1 times [2025-02-06 12:51:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:56,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473469272] [2025-02-06 12:51:56,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:56,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:56,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:51:56,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:51:56,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:56,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:51:56,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:51:56,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:51:56,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:51:56,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:56,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:51:56,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:51:56,108 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:51:56,108 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-02-06 12:51:56,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (12 of 14 remaining) [2025-02-06 12:51:56,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-02-06 12:51:56,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-02-06 12:51:56,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-02-06 12:51:56,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-02-06 12:51:56,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-02-06 12:51:56,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-02-06 12:51:56,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-02-06 12:51:56,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-02-06 12:51:56,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 14 remaining) [2025-02-06 12:51:56,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-02-06 12:51:56,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-02-06 12:51:56,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2025-02-06 12:51:56,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:51:56,109 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:51:56,110 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:51:56,110 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 12:51:56,157 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:51:56,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 83 transitions, 194 flow [2025-02-06 12:51:56,165 INFO L124 PetriNetUnfolderBase]: 12/102 cut-off events. [2025-02-06 12:51:56,165 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:51:56,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 102 events. 12/102 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 308 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 90. Up to 5 conditions per place. [2025-02-06 12:51:56,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 83 transitions, 194 flow [2025-02-06 12:51:56,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 83 transitions, 194 flow [2025-02-06 12:51:56,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:51:56,169 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;@611f2258, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:51:56,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 12:51:56,170 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:51:56,171 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:51:56,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:56,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:56,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:51:56,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-02-06 12:51:56,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 378999, now seen corresponding path program 1 times [2025-02-06 12:51:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183446872] [2025-02-06 12:51:56,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:56,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:51:56,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:51:56,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:56,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183446872] [2025-02-06 12:51:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183446872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:56,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:56,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:51:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709330553] [2025-02-06 12:51:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:56,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:51:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:56,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:51:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:51:56,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-02-06 12:51:56,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:56,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:56,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-02-06 12:51:56,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:52:05,069 INFO L124 PetriNetUnfolderBase]: 116955/173156 cut-off events. [2025-02-06 12:52:05,069 INFO L125 PetriNetUnfolderBase]: For 10794/10794 co-relation queries the response was YES. [2025-02-06 12:52:05,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325157 conditions, 173156 events. 116955/173156 cut-off events. For 10794/10794 co-relation queries the response was YES. Maximal size of possible extension queue 5027. Compared 1406435 event pairs, 95334 based on Foata normal form. 24558/171542 useless extension candidates. Maximal degree in co-relation 25867. Up to 147087 conditions per place. [2025-02-06 12:52:06,020 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 43 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2025-02-06 12:52:06,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 250 flow [2025-02-06 12:52:06,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:52:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:52:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2025-02-06 12:52:06,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6265060240963856 [2025-02-06 12:52:06,025 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 194 flow. Second operand 2 states and 104 transitions. [2025-02-06 12:52:06,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 68 transitions, 250 flow [2025-02-06 12:52:06,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 68 transitions, 244 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 12:52:06,036 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 158 flow [2025-02-06 12:52:06,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=158, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2025-02-06 12:52:06,038 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2025-02-06 12:52:06,038 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 158 flow [2025-02-06 12:52:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:52:06,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:52:06,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:52:06,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:52:06,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-02-06 12:52:06,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:52:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -527562349, now seen corresponding path program 1 times [2025-02-06 12:52:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:52:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142623177] [2025-02-06 12:52:06,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:52:06,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:52:06,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:52:06,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:52:06,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:52:06,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:52:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:52:06,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:52:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142623177] [2025-02-06 12:52:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142623177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:52:06,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:52:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:52:06,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538131142] [2025-02-06 12:52:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:52:06,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:52:06,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:52:06,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:52:06,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:52:06,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 83 [2025-02-06 12:52:06,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:52:06,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:52:06,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 83 [2025-02-06 12:52:06,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:52:13,945 INFO L124 PetriNetUnfolderBase]: 116955/169955 cut-off events. [2025-02-06 12:52:13,946 INFO L125 PetriNetUnfolderBase]: For 4247/4247 co-relation queries the response was YES. [2025-02-06 12:52:14,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320059 conditions, 169955 events. 116955/169955 cut-off events. For 4247/4247 co-relation queries the response was YES. Maximal size of possible extension queue 4793. Compared 1328586 event pairs, 95334 based on Foata normal form. 0/146984 useless extension candidates. Maximal degree in co-relation 320052. Up to 147086 conditions per place. [2025-02-06 12:52:15,140 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 42 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-02-06 12:52:15,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 236 flow [2025-02-06 12:52:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:52:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:52:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-02-06 12:52:15,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4538152610441767 [2025-02-06 12:52:15,141 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 158 flow. Second operand 3 states and 113 transitions. [2025-02-06 12:52:15,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 236 flow [2025-02-06 12:52:15,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:52:15,152 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 152 flow [2025-02-06 12:52:15,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-02-06 12:52:15,154 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -8 predicate places. [2025-02-06 12:52:15,155 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 152 flow [2025-02-06 12:52:15,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:52:15,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:52:15,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:52:15,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:52:15,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-02-06 12:52:15,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:52:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash -527562348, now seen corresponding path program 1 times [2025-02-06 12:52:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:52:15,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913131562] [2025-02-06 12:52:15,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:52:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:52:15,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:52:15,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:52:15,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:52:15,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:52:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:52:15,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:52:15,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913131562] [2025-02-06 12:52:15,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913131562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:52:15,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:52:15,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:52:15,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217226140] [2025-02-06 12:52:15,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:52:15,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:52:15,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:52:15,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:52:15,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:52:15,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-02-06 12:52:15,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:52:15,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:52:15,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-02-06 12:52:15,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand