./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/25_stack.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-ext/25_stack.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 9f07ddd0bf7ae4134116576ef500b9c6d91475d3c23175717b2cac1146eab3b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:57:32,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:57:32,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:57:32,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:57:32,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:57:32,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:57:32,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:57:32,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:57:32,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:57:32,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:57:32,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:57:32,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:57:32,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:57:32,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:57:32,262 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:57:32,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:57:32,262 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:57:32,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:57:32,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:57:32,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:57:32,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:57:32,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:57:32,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:57:32,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:57:32,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:57:32,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:57:32,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:57:32,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:57:32,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:57:32,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:57:32,265 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 -> 9f07ddd0bf7ae4134116576ef500b9c6d91475d3c23175717b2cac1146eab3b3 [2025-03-09 00:57:32,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:57:32,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:57:32,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:57:32,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:57:32,491 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:57:32,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/25_stack.i [2025-03-09 00:57:33,610 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066456392/d35a81ecb9034a2985658789e0b030fe/FLAGd3f5b3da8 [2025-03-09 00:57:33,870 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:57:33,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack.i [2025-03-09 00:57:33,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066456392/d35a81ecb9034a2985658789e0b030fe/FLAGd3f5b3da8 [2025-03-09 00:57:34,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066456392/d35a81ecb9034a2985658789e0b030fe [2025-03-09 00:57:34,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:57:34,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:57:34,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:57:34,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:57:34,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:57:34,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1152c614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34, skipping insertion in model container [2025-03-09 00:57:34,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:57:34,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:57:34,452 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:57:34,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:57:34,528 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:57:34,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34 WrapperNode [2025-03-09 00:57:34,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:57:34,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:57:34,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:57:34,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:57:34,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,561 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 195 [2025-03-09 00:57:34,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:57:34,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:57:34,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:57:34,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:57:34,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,593 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-03-09 00:57:34,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:57:34,605 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:57:34,605 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:57:34,605 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:57:34,606 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (1/1) ... [2025-03-09 00:57:34,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:57:34,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:34,630 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 00:57:34,631 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 00:57:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-09 00:57:34,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-09 00:57:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 00:57:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:57:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:57:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:57:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:57:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:57:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:57:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 00:57:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:57:34,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:57:34,648 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 00:57:34,726 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:57:34,727 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:57:34,978 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:57:34,978 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:57:35,328 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:57:35,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:57:35,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:57:35 BoogieIcfgContainer [2025-03-09 00:57:35,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:57:35,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:57:35,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:57:35,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:57:35,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:57:34" (1/3) ... [2025-03-09 00:57:35,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aaf560e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:57:35, skipping insertion in model container [2025-03-09 00:57:35,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:34" (2/3) ... [2025-03-09 00:57:35,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aaf560e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:57:35, skipping insertion in model container [2025-03-09 00:57:35,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:57:35" (3/3) ... [2025-03-09 00:57:35,339 INFO L128 eAbstractionObserver]: Analyzing ICFG 25_stack.i [2025-03-09 00:57:35,351 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:57:35,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 25_stack.i that has 2 procedures, 37 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-09 00:57:35,353 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:57:35,401 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:35,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 41 transitions, 86 flow [2025-03-09 00:57:35,453 INFO L124 PetriNetUnfolderBase]: 4/45 cut-off events. [2025-03-09 00:57:35,457 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:35,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 45 events. 4/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-09 00:57:35,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 41 transitions, 86 flow [2025-03-09 00:57:35,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 41 transitions, 86 flow [2025-03-09 00:57:35,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:35,480 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;@23ba1f74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:35,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 00:57:35,484 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:35,484 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-09 00:57:35,484 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:35,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:35,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:35,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err2ASSERT_VIOLATIONARRAY_INDEX, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 00:57:35,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash 465361, now seen corresponding path program 1 times [2025-03-09 00:57:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:35,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226642704] [2025-03-09 00:57:35,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:35,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:35,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:35,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:35,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:36,073 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 00:57:36,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:36,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226642704] [2025-03-09 00:57:36,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226642704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:36,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:36,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:57:36,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648248061] [2025-03-09 00:57:36,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:36,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:57:36,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:36,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:57:36,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:57:36,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-03-09 00:57:36,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 00:57:36,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:36,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-03-09 00:57:36,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:36,173 INFO L124 PetriNetUnfolderBase]: 51/143 cut-off events. [2025-03-09 00:57:36,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:36,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 143 events. 51/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 350 event pairs, 42 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 251. Up to 117 conditions per place. [2025-03-09 00:57:36,175 INFO L140 encePairwiseOnDemand]: 39/41 looper letters, 27 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2025-03-09 00:57:36,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 132 flow [2025-03-09 00:57:36,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:57:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:57:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2025-03-09 00:57:36,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6219512195121951 [2025-03-09 00:57:36,186 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 86 flow. Second operand 2 states and 51 transitions. [2025-03-09 00:57:36,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 132 flow [2025-03-09 00:57:36,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:36,191 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 78 flow [2025-03-09 00:57:36,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-03-09 00:57:36,196 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-03-09 00:57:36,197 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 78 flow [2025-03-09 00:57:36,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 00:57:36,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:36,197 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 00:57:36,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:57:36,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONARRAY_INDEX, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 00:57:36,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash 982036303, now seen corresponding path program 1 times [2025-03-09 00:57:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:36,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202210720] [2025-03-09 00:57:36,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:36,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:36,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:57:36,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:57:36,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:36,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:36,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:36,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:57:36,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:57:36,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:36,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:36,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:57:36,480 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:36,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-09 00:57:36,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONARRAY_INDEX (6 of 8 remaining) [2025-03-09 00:57:36,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-03-09 00:57:36,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (4 of 8 remaining) [2025-03-09 00:57:36,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-03-09 00:57:36,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONARRAY_INDEX (2 of 8 remaining) [2025-03-09 00:57:36,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-03-09 00:57:36,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (0 of 8 remaining) [2025-03-09 00:57:36,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:57:36,483 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 00:57:36,486 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:57:36,486 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 00:57:36,535 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:36,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 75 transitions, 160 flow [2025-03-09 00:57:36,554 INFO L124 PetriNetUnfolderBase]: 8/84 cut-off events. [2025-03-09 00:57:36,554 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:57:36,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 84 events. 8/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2025-03-09 00:57:36,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 75 transitions, 160 flow [2025-03-09 00:57:36,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 75 transitions, 160 flow [2025-03-09 00:57:36,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:36,560 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;@23ba1f74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:36,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-09 00:57:36,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:36,563 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-09 00:57:36,563 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:36,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:36,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:36,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err2ASSERT_VIOLATIONARRAY_INDEX, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-09 00:57:36,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash 539836, now seen corresponding path program 1 times [2025-03-09 00:57:36,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:36,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018978756] [2025-03-09 00:57:36,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:36,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:36,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:36,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:36,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:36,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:36,782 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 00:57:36,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:36,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018978756] [2025-03-09 00:57:36,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018978756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:36,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:36,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:57:36,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884074297] [2025-03-09 00:57:36,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:36,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:57:36,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:36,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:57:36,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:57:36,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-09 00:57:36,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 160 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-03-09 00:57:36,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:36,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-09 00:57:36,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:37,247 INFO L124 PetriNetUnfolderBase]: 2697/4641 cut-off events. [2025-03-09 00:57:37,248 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-09 00:57:37,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8855 conditions, 4641 events. 2697/4641 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 26520 event pairs, 2352 based on Foata normal form. 0/4445 useless extension candidates. Maximal degree in co-relation 8095. Up to 4143 conditions per place. [2025-03-09 00:57:37,276 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 51 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2025-03-09 00:57:37,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 252 flow [2025-03-09 00:57:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:57:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:57:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2025-03-09 00:57:37,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2025-03-09 00:57:37,278 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 160 flow. Second operand 2 states and 94 transitions. [2025-03-09 00:57:37,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 252 flow [2025-03-09 00:57:37,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:37,280 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 150 flow [2025-03-09 00:57:37,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=69, 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=150, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2025-03-09 00:57:37,282 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-03-09 00:57:37,283 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 150 flow [2025-03-09 00:57:37,283 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-03-09 00:57:37,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:37,283 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-09 00:57:37,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:57:37,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONARRAY_INDEX, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-09 00:57:37,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:37,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1554278302, now seen corresponding path program 1 times [2025-03-09 00:57:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:37,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979310944] [2025-03-09 00:57:37,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:37,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:57:37,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:57:37,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:37,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:37,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:37,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:57:37,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:57:37,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:37,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:37,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:57:37,524 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:37,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-09 00:57:37,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONARRAY_INDEX (9 of 11 remaining) [2025-03-09 00:57:37,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 11 remaining) [2025-03-09 00:57:37,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (7 of 11 remaining) [2025-03-09 00:57:37,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 11 remaining) [2025-03-09 00:57:37,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONARRAY_INDEX (5 of 11 remaining) [2025-03-09 00:57:37,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 11 remaining) [2025-03-09 00:57:37,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (3 of 11 remaining) [2025-03-09 00:57:37,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONARRAY_INDEX (2 of 11 remaining) [2025-03-09 00:57:37,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 11 remaining) [2025-03-09 00:57:37,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (0 of 11 remaining) [2025-03-09 00:57:37,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:57:37,526 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 00:57:37,526 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:57:37,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 00:57:37,583 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:37,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 109 transitions, 236 flow [2025-03-09 00:57:37,604 INFO L124 PetriNetUnfolderBase]: 12/123 cut-off events. [2025-03-09 00:57:37,605 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 00:57:37,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 12/123 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 354 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2025-03-09 00:57:37,606 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 109 transitions, 236 flow [2025-03-09 00:57:37,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 109 transitions, 236 flow [2025-03-09 00:57:37,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:37,608 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;@23ba1f74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:37,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-09 00:57:37,610 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:37,610 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-09 00:57:37,610 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:37,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:37,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:37,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err2ASSERT_VIOLATIONARRAY_INDEX, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-09 00:57:37,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash 648073, now seen corresponding path program 1 times [2025-03-09 00:57:37,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:37,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241949550] [2025-03-09 00:57:37,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:37,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:37,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:37,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:37,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:37,795 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 00:57:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:37,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241949550] [2025-03-09 00:57:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241949550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:37,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:57:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74574797] [2025-03-09 00:57:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:37,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:57:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:37,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:57:37,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:57:37,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 109 [2025-03-09 00:57:37,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 109 transitions, 236 flow. Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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 00:57:37,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:37,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 109 [2025-03-09 00:57:37,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:45,411 INFO L124 PetriNetUnfolderBase]: 94047/135647 cut-off events. [2025-03-09 00:57:45,412 INFO L125 PetriNetUnfolderBase]: For 3014/3014 co-relation queries the response was YES. [2025-03-09 00:57:45,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263766 conditions, 135647 events. 94047/135647 cut-off events. For 3014/3014 co-relation queries the response was YES. Maximal size of possible extension queue 2545. Compared 982849 event pairs, 83664 based on Foata normal form. 0/130053 useless extension candidates. Maximal degree in co-relation 197119. Up to 126111 conditions per place. [2025-03-09 00:57:46,134 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 75 selfloop transitions, 0 changer transitions 0/103 dead transitions. [2025-03-09 00:57:46,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 103 transitions, 374 flow [2025-03-09 00:57:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:57:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:57:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 137 transitions. [2025-03-09 00:57:46,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6284403669724771 [2025-03-09 00:57:46,136 INFO L175 Difference]: Start difference. First operand has 104 places, 109 transitions, 236 flow. Second operand 2 states and 137 transitions. [2025-03-09 00:57:46,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 103 transitions, 374 flow [2025-03-09 00:57:46,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 103 transitions, 372 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:46,140 INFO L231 Difference]: Finished difference. Result has 102 places, 103 transitions, 222 flow [2025-03-09 00:57:46,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=222, PETRI_PLACES=102, PETRI_TRANSITIONS=103} [2025-03-09 00:57:46,140 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -2 predicate places. [2025-03-09 00:57:46,140 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 103 transitions, 222 flow [2025-03-09 00:57:46,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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 00:57:46,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:46,140 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-09 00:57:46,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:57:46,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONARRAY_INDEX, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-09 00:57:46,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2135301042, now seen corresponding path program 1 times [2025-03-09 00:57:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:46,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772425761] [2025-03-09 00:57:46,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:46,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:46,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:57:46,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:57:46,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:46,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:46,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:46,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:57:46,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:57:46,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:46,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:46,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:57:46,317 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONARRAY_INDEX (12 of 14 remaining) [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 14 remaining) [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (10 of 14 remaining) [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONARRAY_INDEX (8 of 14 remaining) [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 14 remaining) [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (6 of 14 remaining) [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONARRAY_INDEX (5 of 14 remaining) [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 14 remaining) [2025-03-09 00:57:46,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (3 of 14 remaining) [2025-03-09 00:57:46,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONARRAY_INDEX (2 of 14 remaining) [2025-03-09 00:57:46,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 14 remaining) [2025-03-09 00:57:46,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (0 of 14 remaining) [2025-03-09 00:57:46,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:57:46,319 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 00:57:46,320 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:57:46,320 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 00:57:46,379 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:46,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 143 transitions, 314 flow [2025-03-09 00:57:46,395 INFO L124 PetriNetUnfolderBase]: 16/162 cut-off events. [2025-03-09 00:57:46,395 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 00:57:46,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 162 events. 16/162 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 137. Up to 5 conditions per place. [2025-03-09 00:57:46,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 143 transitions, 314 flow [2025-03-09 00:57:46,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 143 transitions, 314 flow [2025-03-09 00:57:46,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:46,401 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;@23ba1f74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:46,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-09 00:57:46,403 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:46,403 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-09 00:57:46,403 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:46,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:46,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:46,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err2ASSERT_VIOLATIONARRAY_INDEX, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-09 00:57:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 790072, now seen corresponding path program 1 times [2025-03-09 00:57:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120228957] [2025-03-09 00:57:46,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:46,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:46,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:46,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:46,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:46,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:46,544 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 00:57:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120228957] [2025-03-09 00:57:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120228957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:46,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:46,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:57:46,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712431623] [2025-03-09 00:57:46,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:46,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:57:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:46,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:57:46,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:57:46,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 143 [2025-03-09 00:57:46,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 143 transitions, 314 flow. Second operand has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 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 00:57:46,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:46,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 143 [2025-03-09 00:57:46,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand