./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack_longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/stack_longest-1.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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:43:13,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:43:13,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:43:13,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:43:13,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:43:13,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:43:13,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:43:13,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:43:13,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:43:13,676 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:43:13,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:43:13,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:43:13,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:43:13,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:43:13,677 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:43:13,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:43:13,678 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:43:13,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:43:13,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:43:13,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:43:13,678 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:43:13,678 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:43:13,678 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:43:13,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:43:13,679 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:43:13,679 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:43:13,679 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:43:13,679 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:43:13,679 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:43:13,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:43:13,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:43:13,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:43:13,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:43:13,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:13,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:43:13,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:43:13,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:43:13,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:43:13,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:43:13,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:43:13,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:43:13,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:43:13,680 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2025-03-04 09:43:13,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:43:13,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:43:13,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:43:13,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:43:13,931 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:43:13,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-1.i [2025-03-04 09:43:15,075 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349d922a7/ca8825ea06bd49bcb893427561e88953/FLAG25aa42b56 [2025-03-04 09:43:15,360 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:43:15,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2025-03-04 09:43:15,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349d922a7/ca8825ea06bd49bcb893427561e88953/FLAG25aa42b56 [2025-03-04 09:43:15,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349d922a7/ca8825ea06bd49bcb893427561e88953 [2025-03-04 09:43:15,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:43:15,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:43:15,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:15,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:43:15,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:43:15,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:15" (1/1) ... [2025-03-04 09:43:15,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c936a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:15, skipping insertion in model container [2025-03-04 09:43:15,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:15" (1/1) ... [2025-03-04 09:43:15,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:43:15,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:15,976 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:43:16,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:16,109 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:43:16,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16 WrapperNode [2025-03-04 09:43:16,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:16,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:16,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:43:16,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:43:16,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,219 INFO L138 Inliner]: procedures = 277, calls = 832, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 950 [2025-03-04 09:43:16,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:16,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:43:16,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:43:16,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:43:16,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,280 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 5, 802]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 5, 800]. The 1 writes are split as follows [0, 0, 1]. [2025-03-04 09:43:16,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:43:16,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:43:16,339 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:43:16,339 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:43:16,340 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:16,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:16,368 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-04 09:43:16,372 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-04 09:43:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:43:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:43:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:43:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:43:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:43:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:43:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:43:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:43:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:43:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:43:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:43:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:43:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:43:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:43:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:43:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:43:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:43:16,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:43:16,393 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:43:16,508 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:43:16,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:43:17,434 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0; [2025-03-04 09:43:17,434 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem38#1; [2025-03-04 09:43:17,434 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret37#1; [2025-03-04 09:43:17,435 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:43:17,435 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:43:27,870 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:43:27,871 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:43:27,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:27 BoogieIcfgContainer [2025-03-04 09:43:27,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:43:27,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:43:27,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:43:27,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:43:27,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:43:15" (1/3) ... [2025-03-04 09:43:27,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e7542f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:43:27, skipping insertion in model container [2025-03-04 09:43:27,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16" (2/3) ... [2025-03-04 09:43:27,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e7542f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:43:27, skipping insertion in model container [2025-03-04 09:43:27,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:27" (3/3) ... [2025-03-04 09:43:27,879 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2025-03-04 09:43:27,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:43:27,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-1.i that has 3 procedures, 47 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-04 09:43:27,894 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:43:27,962 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 09:43:27,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2025-03-04 09:43:28,050 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2025-03-04 09:43:28,054 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:43:28,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2025-03-04 09:43:28,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2025-03-04 09:43:28,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2025-03-04 09:43:28,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:43:28,083 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;@7ef0c28c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:43:28,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 09:43:28,105 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:43:28,105 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-04 09:43:28,105 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:43:28,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:28,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:28,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:28,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash 247371277, now seen corresponding path program 1 times [2025-03-04 09:43:28,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:28,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359153693] [2025-03-04 09:43:28,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:28,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:28,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:43:28,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:43:28,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:28,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:28,772 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-04 09:43:28,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:28,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359153693] [2025-03-04 09:43:28,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359153693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:28,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:28,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:43:28,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645900656] [2025-03-04 09:43:28,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:28,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:28,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:28,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:28,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:43:28,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:28,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:28,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:43:28,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:29,097 INFO L124 PetriNetUnfolderBase]: 454/882 cut-off events. [2025-03-04 09:43:29,098 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 09:43:29,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 882 events. 454/882 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4552 event pairs, 242 based on Foata normal form. 94/858 useless extension candidates. Maximal degree in co-relation 1569. Up to 512 conditions per place. [2025-03-04 09:43:29,107 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-03-04 09:43:29,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2025-03-04 09:43:29,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 09:43:29,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-03-04 09:43:29,118 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2025-03-04 09:43:29,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2025-03-04 09:43:29,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:43:29,125 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2025-03-04 09:43:29,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-04 09:43:29,131 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-03-04 09:43:29,131 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2025-03-04 09:43:29,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:29,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:29,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:29,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:43:29,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:29,133 INFO L85 PathProgramCache]: Analyzing trace with hash 247371278, now seen corresponding path program 1 times [2025-03-04 09:43:29,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:29,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038481407] [2025-03-04 09:43:29,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:29,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:43:29,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:43:29,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:29,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:29,684 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-04 09:43:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038481407] [2025-03-04 09:43:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038481407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185117018] [2025-03-04 09:43:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:29,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:43:29,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:29,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:43:29,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:43:29,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:43:29,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-04 09:43:29,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:29,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:43:29,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:30,007 INFO L124 PetriNetUnfolderBase]: 750/1387 cut-off events. [2025-03-04 09:43:30,007 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 09:43:30,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1387 events. 750/1387 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7450 event pairs, 125 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 806. Up to 848 conditions per place. [2025-03-04 09:43:30,019 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-03-04 09:43:30,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2025-03-04 09:43:30,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:43:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:43:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-03-04 09:43:30,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-03-04 09:43:30,021 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2025-03-04 09:43:30,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2025-03-04 09:43:30,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:43:30,026 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2025-03-04 09:43:30,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2025-03-04 09:43:30,028 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-04 09:43:30,028 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2025-03-04 09:43:30,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-04 09:43:30,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:30,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:30,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:43:30,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:30,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash -743960369, now seen corresponding path program 1 times [2025-03-04 09:43:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:30,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558015033] [2025-03-04 09:43:30,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:30,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:43:30,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:43:30,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:30,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:30,189 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-04 09:43:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558015033] [2025-03-04 09:43:30,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558015033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:30,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:30,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303282536] [2025-03-04 09:43:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:30,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:30,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:30,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:30,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:30,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-04 09:43:30,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-03-04 09:43:30,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:30,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-04 09:43:30,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:30,425 INFO L124 PetriNetUnfolderBase]: 663/1273 cut-off events. [2025-03-04 09:43:30,425 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-03-04 09:43:30,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1273 events. 663/1273 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6593 event pairs, 176 based on Foata normal form. 34/1194 useless extension candidates. Maximal degree in co-relation 2590. Up to 721 conditions per place. [2025-03-04 09:43:30,433 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-03-04 09:43:30,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 376 flow [2025-03-04 09:43:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:43:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:43:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-03-04 09:43:30,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2025-03-04 09:43:30,436 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 5 states and 160 transitions. [2025-03-04 09:43:30,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 376 flow [2025-03-04 09:43:30,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:30,439 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 161 flow [2025-03-04 09:43:30,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-04 09:43:30,440 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-03-04 09:43:30,440 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 161 flow [2025-03-04 09:43:30,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-03-04 09:43:30,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:30,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:30,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:43:30,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:30,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash -973350060, now seen corresponding path program 1 times [2025-03-04 09:43:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:30,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885423437] [2025-03-04 09:43:30,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:30,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:43:30,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:43:30,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:30,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:30,633 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-04 09:43:30,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:30,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885423437] [2025-03-04 09:43:30,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885423437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:30,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:30,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:30,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967368037] [2025-03-04 09:43:30,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:30,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:30,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:30,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:30,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:30,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-04 09:43:30,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-04 09:43:30,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:30,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-04 09:43:30,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:30,939 INFO L124 PetriNetUnfolderBase]: 971/1834 cut-off events. [2025-03-04 09:43:30,939 INFO L125 PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES. [2025-03-04 09:43:30,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4025 conditions, 1834 events. 971/1834 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9766 event pairs, 464 based on Foata normal form. 0/1710 useless extension candidates. Maximal degree in co-relation 3354. Up to 1051 conditions per place. [2025-03-04 09:43:30,953 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-03-04 09:43:30,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 429 flow [2025-03-04 09:43:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-03-04 09:43:30,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2025-03-04 09:43:30,956 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 161 flow. Second operand 4 states and 139 transitions. [2025-03-04 09:43:30,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 429 flow [2025-03-04 09:43:30,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:43:30,962 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 197 flow [2025-03-04 09:43:30,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-03-04 09:43:30,963 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-04 09:43:30,963 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 197 flow [2025-03-04 09:43:30,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-04 09:43:30,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:30,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:30,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:43:30,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:30,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1240885308, now seen corresponding path program 1 times [2025-03-04 09:43:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:30,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438450004] [2025-03-04 09:43:30,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:30,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:30,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:43:31,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:43:31,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:31,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:31,083 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-04 09:43:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:31,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438450004] [2025-03-04 09:43:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438450004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:31,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:31,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:31,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358888197] [2025-03-04 09:43:31,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:31,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:31,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:31,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:31,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:31,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-04 09:43:31,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-04 09:43:31,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:31,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-04 09:43:31,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:31,332 INFO L124 PetriNetUnfolderBase]: 1096/2028 cut-off events. [2025-03-04 09:43:31,332 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2025-03-04 09:43:31,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4872 conditions, 2028 events. 1096/2028 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 10942 event pairs, 514 based on Foata normal form. 22/1931 useless extension candidates. Maximal degree in co-relation 4010. Up to 1284 conditions per place. [2025-03-04 09:43:31,344 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 62 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-03-04 09:43:31,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 397 flow [2025-03-04 09:43:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-04 09:43:31,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2025-03-04 09:43:31,346 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 197 flow. Second operand 3 states and 106 transitions. [2025-03-04 09:43:31,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 397 flow [2025-03-04 09:43:31,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 391 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:31,353 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 203 flow [2025-03-04 09:43:31,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-03-04 09:43:31,355 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2025-03-04 09:43:31,355 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 203 flow [2025-03-04 09:43:31,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-04 09:43:31,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:31,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:31,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:43:31,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:31,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:31,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1291060816, now seen corresponding path program 1 times [2025-03-04 09:43:31,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:31,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134350056] [2025-03-04 09:43:31,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:31,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:31,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:43:31,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:43:31,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:31,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:31,564 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-04 09:43:31,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:31,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134350056] [2025-03-04 09:43:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134350056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:31,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:43:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087431146] [2025-03-04 09:43:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:31,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:31,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:31,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:31,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:43:31,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:31,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:31,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:43:31,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:31,783 INFO L124 PetriNetUnfolderBase]: 1006/1857 cut-off events. [2025-03-04 09:43:31,783 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-03-04 09:43:31,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4371 conditions, 1857 events. 1006/1857 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9888 event pairs, 361 based on Foata normal form. 14/1753 useless extension candidates. Maximal degree in co-relation 3872. Up to 1410 conditions per place. [2025-03-04 09:43:31,795 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-04 09:43:31,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 313 flow [2025-03-04 09:43:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-04 09:43:31,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2025-03-04 09:43:31,796 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 203 flow. Second operand 3 states and 96 transitions. [2025-03-04 09:43:31,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 313 flow [2025-03-04 09:43:31,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 09:43:31,801 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 180 flow [2025-03-04 09:43:31,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2025-03-04 09:43:31,801 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-03-04 09:43:31,801 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 180 flow [2025-03-04 09:43:31,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:31,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:31,802 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:31,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:43:31,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:31,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:31,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1568733478, now seen corresponding path program 1 times [2025-03-04 09:43:31,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:31,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920958032] [2025-03-04 09:43:31,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:31,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:31,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:43:31,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:43:31,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:31,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:32,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920958032] [2025-03-04 09:43:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920958032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624292502] [2025-03-04 09:43:32,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:32,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:32,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:32,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:43:32,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:43:32,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:43:32,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:32,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:32,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 09:43:32,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:32,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:33,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624292502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:33,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:33,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-04 09:43:33,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660448097] [2025-03-04 09:43:33,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:33,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:43:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:33,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:43:33,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:43:33,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:43:33,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 180 flow. Second operand has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 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-04 09:43:33,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:33,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:43:33,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:34,512 INFO L124 PetriNetUnfolderBase]: 4128/7721 cut-off events. [2025-03-04 09:43:34,512 INFO L125 PetriNetUnfolderBase]: For 2487/2487 co-relation queries the response was YES. [2025-03-04 09:43:34,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17863 conditions, 7721 events. 4128/7721 cut-off events. For 2487/2487 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 50498 event pairs, 309 based on Foata normal form. 192/7403 useless extension candidates. Maximal degree in co-relation 7413. Up to 1423 conditions per place. [2025-03-04 09:43:34,569 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/386 dead transitions. [2025-03-04 09:43:34,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 1892 flow [2025-03-04 09:43:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 09:43:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 09:43:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2025-03-04 09:43:34,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2025-03-04 09:43:34,576 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 180 flow. Second operand 20 states and 685 transitions. [2025-03-04 09:43:34,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 386 transitions, 1892 flow [2025-03-04 09:43:34,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 386 transitions, 1850 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:34,591 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 592 flow [2025-03-04 09:43:34,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=592, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2025-03-04 09:43:34,592 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2025-03-04 09:43:34,592 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 592 flow [2025-03-04 09:43:34,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 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-04 09:43:34,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:34,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:34,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:43:34,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:34,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1373286756, now seen corresponding path program 1 times [2025-03-04 09:43:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431260035] [2025-03-04 09:43:34,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:34,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:43:34,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:43:34,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:34,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:34,985 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-04 09:43:34,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:34,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431260035] [2025-03-04 09:43:34,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431260035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:34,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:34,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107834232] [2025-03-04 09:43:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:34,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:34,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:34,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:34,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:34,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-04 09:43:34,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 09:43:34,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:34,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-04 09:43:34,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:35,302 INFO L124 PetriNetUnfolderBase]: 1833/3827 cut-off events. [2025-03-04 09:43:35,302 INFO L125 PetriNetUnfolderBase]: For 2280/2280 co-relation queries the response was YES. [2025-03-04 09:43:35,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9378 conditions, 3827 events. 1833/3827 cut-off events. For 2280/2280 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 22371 event pairs, 372 based on Foata normal form. 234/3905 useless extension candidates. Maximal degree in co-relation 9176. Up to 2311 conditions per place. [2025-03-04 09:43:35,330 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2025-03-04 09:43:35,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 609 flow [2025-03-04 09:43:35,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-03-04 09:43:35,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2025-03-04 09:43:35,332 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 592 flow. Second operand 3 states and 94 transitions. [2025-03-04 09:43:35,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 609 flow [2025-03-04 09:43:35,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 561 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-04 09:43:35,347 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 389 flow [2025-03-04 09:43:35,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2025-03-04 09:43:35,348 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2025-03-04 09:43:35,348 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 389 flow [2025-03-04 09:43:35,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 09:43:35,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:35,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:35,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:43:35,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:35,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1923544413, now seen corresponding path program 1 times [2025-03-04 09:43:35,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:35,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596085963] [2025-03-04 09:43:35,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:35,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:35,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 09:43:35,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 09:43:35,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:35,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:35,677 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-04 09:43:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596085963] [2025-03-04 09:43:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596085963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:35,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:35,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:35,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261919099] [2025-03-04 09:43:35,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:35,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:43:35,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:35,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:43:35,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:43:35,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:43:35,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-04 09:43:35,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:35,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:43:35,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:36,030 INFO L124 PetriNetUnfolderBase]: 1838/3729 cut-off events. [2025-03-04 09:43:36,031 INFO L125 PetriNetUnfolderBase]: For 1499/1499 co-relation queries the response was YES. [2025-03-04 09:43:36,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9362 conditions, 3729 events. 1838/3729 cut-off events. For 1499/1499 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21488 event pairs, 1002 based on Foata normal form. 0/3604 useless extension candidates. Maximal degree in co-relation 7893. Up to 2166 conditions per place. [2025-03-04 09:43:36,050 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 56 selfloop transitions, 18 changer transitions 0/88 dead transitions. [2025-03-04 09:43:36,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 565 flow [2025-03-04 09:43:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:43:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:43:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-03-04 09:43:36,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44363636363636366 [2025-03-04 09:43:36,052 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 389 flow. Second operand 5 states and 122 transitions. [2025-03-04 09:43:36,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 565 flow [2025-03-04 09:43:36,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 88 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:36,060 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 419 flow [2025-03-04 09:43:36,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2025-03-04 09:43:36,060 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2025-03-04 09:43:36,061 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 419 flow [2025-03-04 09:43:36,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-04 09:43:36,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:36,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:36,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:43:36,062 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:36,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:36,062 INFO L85 PathProgramCache]: Analyzing trace with hash -609979858, now seen corresponding path program 1 times [2025-03-04 09:43:36,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:36,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133217314] [2025-03-04 09:43:36,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:36,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:36,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 09:43:36,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 09:43:36,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:36,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:36,480 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-04 09:43:36,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:36,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133217314] [2025-03-04 09:43:36,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133217314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:36,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:36,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:43:36,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379036827] [2025-03-04 09:43:36,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:36,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:43:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:36,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:43:36,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:43:36,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:43:36,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 419 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-04 09:43:36,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:36,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:43:36,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:36,892 INFO L124 PetriNetUnfolderBase]: 1961/3996 cut-off events. [2025-03-04 09:43:36,892 INFO L125 PetriNetUnfolderBase]: For 2202/2202 co-relation queries the response was YES. [2025-03-04 09:43:36,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10050 conditions, 3996 events. 1961/3996 cut-off events. For 2202/2202 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 23177 event pairs, 461 based on Foata normal form. 0/3836 useless extension candidates. Maximal degree in co-relation 8546. Up to 2936 conditions per place. [2025-03-04 09:43:36,914 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 105 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2025-03-04 09:43:36,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 126 transitions, 806 flow [2025-03-04 09:43:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:43:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:43:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2025-03-04 09:43:36,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116883116883116 [2025-03-04 09:43:36,917 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 419 flow. Second operand 7 states and 197 transitions. [2025-03-04 09:43:36,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 126 transitions, 806 flow [2025-03-04 09:43:36,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 762 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:43:36,926 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 440 flow [2025-03-04 09:43:36,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2025-03-04 09:43:36,927 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2025-03-04 09:43:36,927 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 440 flow [2025-03-04 09:43:36,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-04 09:43:36,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:36,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:36,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:43:36,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:36,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1367795226, now seen corresponding path program 1 times [2025-03-04 09:43:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351547098] [2025-03-04 09:43:36,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:36,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:43:36,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:43:36,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:36,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:37,027 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-04 09:43:37,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351547098] [2025-03-04 09:43:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351547098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:37,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:37,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:37,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992026344] [2025-03-04 09:43:37,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:37,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:37,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:37,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:37,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-04 09:43:37,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-04 09:43:37,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:37,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-04 09:43:37,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:37,443 INFO L124 PetriNetUnfolderBase]: 2879/6068 cut-off events. [2025-03-04 09:43:37,443 INFO L125 PetriNetUnfolderBase]: For 3099/3099 co-relation queries the response was YES. [2025-03-04 09:43:37,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15012 conditions, 6068 events. 2879/6068 cut-off events. For 3099/3099 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 40586 event pairs, 1373 based on Foata normal form. 137/5983 useless extension candidates. Maximal degree in co-relation 12985. Up to 3403 conditions per place. [2025-03-04 09:43:37,514 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 124 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2025-03-04 09:43:37,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 140 transitions, 1050 flow [2025-03-04 09:43:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-04 09:43:37,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2025-03-04 09:43:37,517 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 440 flow. Second operand 3 states and 107 transitions. [2025-03-04 09:43:37,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 140 transitions, 1050 flow [2025-03-04 09:43:37,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1038 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:43:37,535 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 445 flow [2025-03-04 09:43:37,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2025-03-04 09:43:37,536 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2025-03-04 09:43:37,536 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 445 flow [2025-03-04 09:43:37,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-04 09:43:37,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:37,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:37,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:43:37,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:37,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 94957668, now seen corresponding path program 1 times [2025-03-04 09:43:37,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:37,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363831437] [2025-03-04 09:43:37,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:37,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:37,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:43:37,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:43:37,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:37,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:37,887 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-04 09:43:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:37,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363831437] [2025-03-04 09:43:37,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363831437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:37,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:37,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:37,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864061639] [2025-03-04 09:43:37,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:37,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:43:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:37,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:43:37,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:43:37,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-04 09:43:37,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 445 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-04 09:43:37,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:37,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-04 09:43:37,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:38,354 INFO L124 PetriNetUnfolderBase]: 3194/6486 cut-off events. [2025-03-04 09:43:38,355 INFO L125 PetriNetUnfolderBase]: For 4318/4318 co-relation queries the response was YES. [2025-03-04 09:43:38,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17919 conditions, 6486 events. 3194/6486 cut-off events. For 4318/4318 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 42414 event pairs, 475 based on Foata normal form. 105/6409 useless extension candidates. Maximal degree in co-relation 14839. Up to 2632 conditions per place. [2025-03-04 09:43:38,389 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 109 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2025-03-04 09:43:38,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 133 transitions, 930 flow [2025-03-04 09:43:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:43:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:43:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-03-04 09:43:38,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2025-03-04 09:43:38,390 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 445 flow. Second operand 5 states and 152 transitions. [2025-03-04 09:43:38,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 133 transitions, 930 flow [2025-03-04 09:43:38,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:38,405 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 519 flow [2025-03-04 09:43:38,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=519, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-03-04 09:43:38,405 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2025-03-04 09:43:38,405 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 519 flow [2025-03-04 09:43:38,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-04 09:43:38,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:38,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:38,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:43:38,406 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:38,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1741501060, now seen corresponding path program 1 times [2025-03-04 09:43:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:38,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274892721] [2025-03-04 09:43:38,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:38,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:38,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:43:38,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:43:38,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:38,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:39,418 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-04 09:43:39,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:39,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274892721] [2025-03-04 09:43:39,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274892721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:39,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:39,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:43:39,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316450211] [2025-03-04 09:43:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:39,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:43:39,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:39,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:43:39,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:43:39,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-04 09:43:39,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 519 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-04 09:43:39,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:39,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-04 09:43:39,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:40,643 INFO L124 PetriNetUnfolderBase]: 5347/10918 cut-off events. [2025-03-04 09:43:40,644 INFO L125 PetriNetUnfolderBase]: For 10089/10089 co-relation queries the response was YES. [2025-03-04 09:43:40,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30632 conditions, 10918 events. 5347/10918 cut-off events. For 10089/10089 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 78405 event pairs, 1252 based on Foata normal form. 0/10665 useless extension candidates. Maximal degree in co-relation 25007. Up to 4690 conditions per place. [2025-03-04 09:43:40,716 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 206 selfloop transitions, 29 changer transitions 0/249 dead transitions. [2025-03-04 09:43:40,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 249 transitions, 1807 flow [2025-03-04 09:43:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:43:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 09:43:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 344 transitions. [2025-03-04 09:43:40,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2025-03-04 09:43:40,720 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 519 flow. Second operand 12 states and 344 transitions. [2025-03-04 09:43:40,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 249 transitions, 1807 flow [2025-03-04 09:43:40,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 249 transitions, 1805 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:40,751 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 782 flow [2025-03-04 09:43:40,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=782, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2025-03-04 09:43:40,752 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2025-03-04 09:43:40,752 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 782 flow [2025-03-04 09:43:40,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-04 09:43:40,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:40,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:40,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:43:40,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:40,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -474821752, now seen corresponding path program 1 times [2025-03-04 09:43:40,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:40,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935231594] [2025-03-04 09:43:40,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:40,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:40,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 09:43:40,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 09:43:40,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:40,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:40,854 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-04 09:43:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935231594] [2025-03-04 09:43:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935231594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220393009] [2025-03-04 09:43:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:40,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:40,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:40,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:40,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-04 09:43:40,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 782 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-04 09:43:40,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:40,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-04 09:43:40,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:42,336 INFO L124 PetriNetUnfolderBase]: 7377/15454 cut-off events. [2025-03-04 09:43:42,336 INFO L125 PetriNetUnfolderBase]: For 19405/19405 co-relation queries the response was YES. [2025-03-04 09:43:42,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44833 conditions, 15454 events. 7377/15454 cut-off events. For 19405/19405 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 124622 event pairs, 3056 based on Foata normal form. 409/15499 useless extension candidates. Maximal degree in co-relation 37020. Up to 7613 conditions per place. [2025-03-04 09:43:42,463 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 226 selfloop transitions, 3 changer transitions 0/243 dead transitions. [2025-03-04 09:43:42,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 243 transitions, 2260 flow [2025-03-04 09:43:42,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-03-04 09:43:42,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6681818181818182 [2025-03-04 09:43:42,464 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 782 flow. Second operand 4 states and 147 transitions. [2025-03-04 09:43:42,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 243 transitions, 2260 flow [2025-03-04 09:43:42,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 243 transitions, 2220 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-03-04 09:43:42,527 INFO L231 Difference]: Finished difference. Result has 111 places, 110 transitions, 780 flow [2025-03-04 09:43:42,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=780, PETRI_PLACES=111, PETRI_TRANSITIONS=110} [2025-03-04 09:43:42,528 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2025-03-04 09:43:42,528 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 110 transitions, 780 flow [2025-03-04 09:43:42,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-04 09:43:42,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:42,528 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:42,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:43:42,528 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:42,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash 661379460, now seen corresponding path program 1 times [2025-03-04 09:43:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:42,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599570841] [2025-03-04 09:43:42,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:42,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:42,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:43:42,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:43:42,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:42,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:43,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:43,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599570841] [2025-03-04 09:43:43,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599570841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:43,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126630616] [2025-03-04 09:43:43,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:43,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:43,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:43,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:43,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:43:43,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:43:43,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:43:43,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:43,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:43,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1839 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:43:43,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:43,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126630616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:44,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:44,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2025-03-04 09:43:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735301596] [2025-03-04 09:43:44,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:44,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:43:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:44,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:43:44,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:43:44,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:43:44,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 780 flow. Second operand has 19 states, 19 states have (on average 19.94736842105263) internal successors, (379), 19 states have internal predecessors, (379), 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-04 09:43:44,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:44,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:43:44,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:47,939 INFO L124 PetriNetUnfolderBase]: 14842/30340 cut-off events. [2025-03-04 09:43:47,939 INFO L125 PetriNetUnfolderBase]: For 46006/46006 co-relation queries the response was YES. [2025-03-04 09:43:48,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94045 conditions, 30340 events. 14842/30340 cut-off events. For 46006/46006 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 256930 event pairs, 2439 based on Foata normal form. 268/29826 useless extension candidates. Maximal degree in co-relation 56274. Up to 4821 conditions per place. [2025-03-04 09:43:48,247 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 388 selfloop transitions, 95 changer transitions 0/496 dead transitions. [2025-03-04 09:43:48,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 496 transitions, 3964 flow [2025-03-04 09:43:48,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 09:43:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 09:43:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 670 transitions. [2025-03-04 09:43:48,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5537190082644629 [2025-03-04 09:43:48,250 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 780 flow. Second operand 22 states and 670 transitions. [2025-03-04 09:43:48,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 496 transitions, 3964 flow [2025-03-04 09:43:48,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 496 transitions, 3897 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:48,396 INFO L231 Difference]: Finished difference. Result has 146 places, 176 transitions, 1741 flow [2025-03-04 09:43:48,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1741, PETRI_PLACES=146, PETRI_TRANSITIONS=176} [2025-03-04 09:43:48,396 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 96 predicate places. [2025-03-04 09:43:48,396 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 176 transitions, 1741 flow [2025-03-04 09:43:48,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 19.94736842105263) internal successors, (379), 19 states have internal predecessors, (379), 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-04 09:43:48,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:48,397 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:48,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:43:48,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 09:43:48,598 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:48,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1003804399, now seen corresponding path program 1 times [2025-03-04 09:43:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:48,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972018281] [2025-03-04 09:43:48,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:48,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:43:48,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:43:48,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:48,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:48,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972018281] [2025-03-04 09:43:48,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972018281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605554214] [2025-03-04 09:43:48,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:48,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:48,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:48,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:48,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:43:48,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:43:49,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:43:49,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:49,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:49,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 1836 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 09:43:49,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:49,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:49,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605554214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:49,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:49,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-03-04 09:43:49,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132476936] [2025-03-04 09:43:49,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:49,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:43:49,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:49,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:43:49,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:43:49,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-04 09:43:49,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 176 transitions, 1741 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-04 09:43:49,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:49,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-04 09:43:49,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:51,833 INFO L124 PetriNetUnfolderBase]: 12530/25896 cut-off events. [2025-03-04 09:43:51,833 INFO L125 PetriNetUnfolderBase]: For 61996/61996 co-relation queries the response was YES. [2025-03-04 09:43:52,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85248 conditions, 25896 events. 12530/25896 cut-off events. For 61996/61996 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 209087 event pairs, 3718 based on Foata normal form. 21/25254 useless extension candidates. Maximal degree in co-relation 81079. Up to 19270 conditions per place. [2025-03-04 09:43:52,136 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 181 selfloop transitions, 15 changer transitions 0/210 dead transitions. [2025-03-04 09:43:52,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 210 transitions, 2158 flow [2025-03-04 09:43:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:43:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:43:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2025-03-04 09:43:52,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2025-03-04 09:43:52,137 INFO L175 Difference]: Start difference. First operand has 146 places, 176 transitions, 1741 flow. Second operand 6 states and 189 transitions. [2025-03-04 09:43:52,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 210 transitions, 2158 flow [2025-03-04 09:43:52,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 210 transitions, 1994 flow, removed 73 selfloop flow, removed 5 redundant places. [2025-03-04 09:43:52,477 INFO L231 Difference]: Finished difference. Result has 149 places, 158 transitions, 1434 flow [2025-03-04 09:43:52,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1434, PETRI_PLACES=149, PETRI_TRANSITIONS=158} [2025-03-04 09:43:52,478 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 99 predicate places. [2025-03-04 09:43:52,478 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 158 transitions, 1434 flow [2025-03-04 09:43:52,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-04 09:43:52,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:52,478 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:52,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:43:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:52,679 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:52,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2095884609, now seen corresponding path program 1 times [2025-03-04 09:43:52,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:52,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159383746] [2025-03-04 09:43:52,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:52,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 09:43:52,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 09:43:52,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:52,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:43:52,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:43:52,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 09:43:52,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 09:43:52,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:52,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:43:52,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:43:52,803 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:43:52,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-04 09:43:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-04 09:43:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-03-04 09:43:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-04 09:43:52,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-04 09:43:52,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:43:52,808 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:52,869 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:43:52,873 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:43:52,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:43:52 BasicIcfg [2025-03-04 09:43:52,878 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:43:52,879 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:43:52,879 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:43:52,879 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:43:52,879 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:27" (3/4) ... [2025-03-04 09:43:52,880 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:43:52,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:43:52,882 INFO L158 Benchmark]: Toolchain (without parser) took 37236.42ms. Allocated memory was 142.6MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 110.2MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.9GB. Max. memory is 16.1GB. [2025-03-04 09:43:52,882 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:43:52,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.12ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 72.8MB in the end (delta: 37.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 09:43:52,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.61ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 64.1MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:43:52,883 INFO L158 Benchmark]: Boogie Preprocessor took 118.21ms. Allocated memory is still 142.6MB. Free memory was 64.1MB in the beginning and 56.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:43:52,883 INFO L158 Benchmark]: IcfgBuilder took 11532.91ms. Allocated memory was 142.6MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 56.6MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-03-04 09:43:52,883 INFO L158 Benchmark]: TraceAbstraction took 25005.38ms. Allocated memory was 4.8GB in the beginning and 7.0GB in the end (delta: 2.3GB). Free memory was 4.5GB in the beginning and 3.1GB in the end (delta: 1.4GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2025-03-04 09:43:52,883 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 7.0GB. Free memory was 3.1GB in the beginning and 3.1GB in the end (delta: 484.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:43:52,884 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.12ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 72.8MB in the end (delta: 37.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.61ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 64.1MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.21ms. Allocated memory is still 142.6MB. Free memory was 64.1MB in the beginning and 56.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 11532.91ms. Allocated memory was 142.6MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 56.6MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * TraceAbstraction took 25005.38ms. Allocated memory was 4.8GB in the beginning and 7.0GB in the end (delta: 2.3GB). Free memory was 4.5GB in the beginning and 3.1GB in the end (delta: 1.4GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 7.0GB. Free memory was 3.1GB in the beginning and 3.1GB in the end (delta: 484.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=0, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=0] [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1006] COND TRUE 2 i<(800) VAL [arr={3:0}, flag=1, m={4:0}, top=1] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] CALL 2 error() [L941] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack_longest-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1018]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.8s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1548 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1496 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5093 IncrementalHoareTripleChecker+Invalid, 5133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 9 mSDtfsCounter, 5093 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1741occurred in iteration=15, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 3745 SizeOfPredicates, 14 NumberOfNonLiveVariables, 5433 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 3/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 09:43:52,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/stack_longest-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:43:55,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:43:55,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 09:43:55,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:43:55,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:43:55,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:43:55,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:43:55,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:43:55,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:43:55,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:43:55,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:43:55,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:43:55,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:43:55,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:43:55,451 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:43:55,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:43:55,451 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:43:55,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:43:55,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:43:55,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:43:55,452 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:43:55,452 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:43:55,452 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:43:55,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:43:55,452 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:43:55,452 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 09:43:55,452 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 09:43:55,452 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:43:55,453 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:43:55,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:43:55,453 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:43:55,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:43:55,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:43:55,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:43:55,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:43:55,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:55,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:43:55,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:43:55,454 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 09:43:55,454 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 09:43:55,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:43:55,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:43:55,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:43:55,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:43:55,455 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2025-03-04 09:43:55,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:43:55,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:43:55,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:43:55,708 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:43:55,709 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:43:55,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-1.i [2025-03-04 09:43:56,812 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d14b360b/b28daab8f3404a358cf4458a47458435/FLAG04d8b4c6f [2025-03-04 09:43:57,060 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:43:57,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2025-03-04 09:43:57,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d14b360b/b28daab8f3404a358cf4458a47458435/FLAG04d8b4c6f [2025-03-04 09:43:57,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d14b360b/b28daab8f3404a358cf4458a47458435 [2025-03-04 09:43:57,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:43:57,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:43:57,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:57,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:43:57,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:43:57,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:57,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ded80f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57, skipping insertion in model container [2025-03-04 09:43:57,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:57,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:43:57,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:57,732 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:43:57,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:57,886 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:43:57,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57 WrapperNode [2025-03-04 09:43:57,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:57,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:57,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:43:57,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:43:57,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:57,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:57,981 INFO L138 Inliner]: procedures = 281, calls = 832, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 946 [2025-03-04 09:43:57,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:57,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:43:57,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:43:57,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:43:57,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:57,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:57,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:58,023 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 802, 5]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 800, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-03-04 09:43:58,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:58,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:58,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:58,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:58,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:58,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:58,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:43:58,092 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:43:58,092 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:43:58,092 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:43:58,093 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (1/1) ... [2025-03-04 09:43:58,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:58,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:58,118 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-04 09:43:58,121 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-04 09:43:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 09:43:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 09:43:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 09:43:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:43:58,141 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:43:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:43:58,142 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:43:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 09:43:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 09:43:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 09:43:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 09:43:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 09:43:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 09:43:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 09:43:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 09:43:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 09:43:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:43:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:43:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:43:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:43:58,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:43:58,144 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:43:58,277 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:43:58,279 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:43:59,428 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0bv32; [2025-03-04 09:43:59,428 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem38#1; [2025-03-04 09:43:59,428 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret37#1; [2025-03-04 09:43:59,429 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:43:59,429 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:44:15,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:44:15,568 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:44:15,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:15 BoogieIcfgContainer [2025-03-04 09:44:15,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:44:15,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:44:15,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:44:15,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:44:15,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:43:57" (1/3) ... [2025-03-04 09:44:15,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6343bebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:15, skipping insertion in model container [2025-03-04 09:44:15,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:57" (2/3) ... [2025-03-04 09:44:15,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6343bebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:15, skipping insertion in model container [2025-03-04 09:44:15,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:15" (3/3) ... [2025-03-04 09:44:15,578 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2025-03-04 09:44:15,591 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:44:15,593 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-1.i that has 3 procedures, 47 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-04 09:44:15,593 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:44:15,692 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 09:44:15,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2025-03-04 09:44:15,788 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2025-03-04 09:44:15,790 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:44:15,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2025-03-04 09:44:15,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2025-03-04 09:44:15,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2025-03-04 09:44:15,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:15,816 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;@48baa727, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:15,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 09:44:15,856 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:15,856 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-04 09:44:15,857 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:44:15,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:15,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:15,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:44:15,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:15,864 INFO L85 PathProgramCache]: Analyzing trace with hash 443027981, now seen corresponding path program 1 times [2025-03-04 09:44:15,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:15,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382254244] [2025-03-04 09:44:15,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:15,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:15,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:15,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:15,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:44:16,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:44:17,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:44:17,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:17,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:17,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:44:17,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:17,285 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-04 09:44:17,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:17,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:17,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382254244] [2025-03-04 09:44:17,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382254244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:17,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:17,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116267877] [2025-03-04 09:44:17,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:17,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:44:17,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:17,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:44:17,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:44:17,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:44:17,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:17,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:17,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:44:17,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:17,675 INFO L124 PetriNetUnfolderBase]: 454/882 cut-off events. [2025-03-04 09:44:17,675 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 09:44:17,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 882 events. 454/882 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4573 event pairs, 242 based on Foata normal form. 94/858 useless extension candidates. Maximal degree in co-relation 1569. Up to 512 conditions per place. [2025-03-04 09:44:17,681 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-03-04 09:44:17,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2025-03-04 09:44:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:44:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:44:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 09:44:17,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-03-04 09:44:17,694 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2025-03-04 09:44:17,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2025-03-04 09:44:17,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:44:17,702 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2025-03-04 09:44:17,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-04 09:44:17,707 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-03-04 09:44:17,707 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2025-03-04 09:44:17,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:17,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:17,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:17,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:44:17,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:17,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:44:17,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash 443027982, now seen corresponding path program 1 times [2025-03-04 09:44:17,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:17,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868642423] [2025-03-04 09:44:17,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:17,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:17,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:17,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:17,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:44:18,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:44:18,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:44:18,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:18,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:19,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 09:44:19,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:19,204 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-04 09:44:19,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:19,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:19,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868642423] [2025-03-04 09:44:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868642423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:19,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:19,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668058631] [2025-03-04 09:44:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:19,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:19,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:19,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:19,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:44:19,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-04 09:44:19,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:19,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:44:19,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:19,760 INFO L124 PetriNetUnfolderBase]: 750/1387 cut-off events. [2025-03-04 09:44:19,760 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 09:44:19,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1387 events. 750/1387 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7429 event pairs, 125 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 806. Up to 848 conditions per place. [2025-03-04 09:44:19,770 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-03-04 09:44:19,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2025-03-04 09:44:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-03-04 09:44:19,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-03-04 09:44:19,772 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2025-03-04 09:44:19,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2025-03-04 09:44:19,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:44:19,776 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2025-03-04 09:44:19,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2025-03-04 09:44:19,777 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-04 09:44:19,777 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2025-03-04 09:44:19,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-04 09:44:19,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:19,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:19,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:44:19,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:19,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:44:19,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash -205720121, now seen corresponding path program 1 times [2025-03-04 09:44:19,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:19,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503900062] [2025-03-04 09:44:19,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:19,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:19,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:19,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:19,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:44:20,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:20,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:20,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:20,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:21,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 09:44:21,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:21,103 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-04 09:44:21,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:21,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503900062] [2025-03-04 09:44:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503900062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:21,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:21,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199326889] [2025-03-04 09:44:21,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:21,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:21,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:21,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:21,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2025-03-04 09:44:21,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-04 09:44:21,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:21,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2025-03-04 09:44:21,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:21,418 INFO L124 PetriNetUnfolderBase]: 793/1526 cut-off events. [2025-03-04 09:44:21,419 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-03-04 09:44:21,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 1526 events. 793/1526 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7965 event pairs, 348 based on Foata normal form. 0/1383 useless extension candidates. Maximal degree in co-relation 3059. Up to 734 conditions per place. [2025-03-04 09:44:21,428 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 56 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-03-04 09:44:21,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 303 flow [2025-03-04 09:44:21,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-04 09:44:21,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2025-03-04 09:44:21,432 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 3 states and 102 transitions. [2025-03-04 09:44:21,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 303 flow [2025-03-04 09:44:21,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 301 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:21,438 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 148 flow [2025-03-04 09:44:21,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2025-03-04 09:44:21,439 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2025-03-04 09:44:21,439 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 148 flow [2025-03-04 09:44:21,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-04 09:44:21,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:21,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:21,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:21,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:21,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:44:21,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:21,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1467771564, now seen corresponding path program 1 times [2025-03-04 09:44:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:21,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827662518] [2025-03-04 09:44:21,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:21,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:21,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:21,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:21,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:44:21,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:44:22,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:44:22,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:22,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:22,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:44:22,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:22,794 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-04 09:44:22,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:22,794 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:22,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827662518] [2025-03-04 09:44:22,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827662518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:22,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:22,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:44:22,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477567293] [2025-03-04 09:44:22,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:22,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:44:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:22,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:44:22,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:44:22,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-04 09:44:22,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-04 09:44:22,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:22,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-04 09:44:22,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:23,171 INFO L124 PetriNetUnfolderBase]: 1096/2110 cut-off events. [2025-03-04 09:44:23,171 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-03-04 09:44:23,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4373 conditions, 2110 events. 1096/2110 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12250 event pairs, 518 based on Foata normal form. 0/1972 useless extension candidates. Maximal degree in co-relation 1577. Up to 1077 conditions per place. [2025-03-04 09:44:23,183 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 68 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-03-04 09:44:23,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 386 flow [2025-03-04 09:44:23,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:44:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:44:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-03-04 09:44:23,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2025-03-04 09:44:23,185 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 148 flow. Second operand 4 states and 139 transitions. [2025-03-04 09:44:23,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 386 flow [2025-03-04 09:44:23,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:23,189 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 175 flow [2025-03-04 09:44:23,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2025-03-04 09:44:23,190 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-03-04 09:44:23,190 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 175 flow [2025-03-04 09:44:23,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-04 09:44:23,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:23,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:23,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:44:23,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:23,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:44:23,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:23,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1201279436, now seen corresponding path program 1 times [2025-03-04 09:44:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:23,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079584793] [2025-03-04 09:44:23,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:23,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:23,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:23,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:23,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:44:23,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:44:24,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:44:24,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:24,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:24,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 09:44:24,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:24,496 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-04 09:44:24,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:24,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:24,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079584793] [2025-03-04 09:44:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079584793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:24,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:24,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333533186] [2025-03-04 09:44:24,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:24,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:24,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:24,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:24,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:24,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:44:24,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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-04 09:44:24,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:24,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:44:24,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:24,780 INFO L124 PetriNetUnfolderBase]: 1073/2100 cut-off events. [2025-03-04 09:44:24,780 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2025-03-04 09:44:24,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4667 conditions, 2100 events. 1073/2100 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 12333 event pairs, 864 based on Foata normal form. 5/1962 useless extension candidates. Maximal degree in co-relation 1711. Up to 1736 conditions per place. [2025-03-04 09:44:24,792 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 35 selfloop transitions, 1 changer transitions 2/52 dead transitions. [2025-03-04 09:44:24,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 247 flow [2025-03-04 09:44:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-04 09:44:24,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-04 09:44:24,793 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 175 flow. Second operand 3 states and 80 transitions. [2025-03-04 09:44:24,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 247 flow [2025-03-04 09:44:24,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 242 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:24,797 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 165 flow [2025-03-04 09:44:24,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-04 09:44:24,797 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-03-04 09:44:24,797 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 165 flow [2025-03-04 09:44:24,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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-04 09:44:24,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:24,798 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:24,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:44:24,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:24,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:44:24,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash 934932518, now seen corresponding path program 1 times [2025-03-04 09:44:25,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:25,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413335771] [2025-03-04 09:44:25,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:25,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:25,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:25,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:25,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:44:25,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:44:26,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:44:26,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:26,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:26,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:44:26,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:26,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:27,042 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413335771] [2025-03-04 09:44:27,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413335771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:27,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:44:27,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-04 09:44:27,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404029660] [2025-03-04 09:44:27,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:27,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:44:27,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:27,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:44:27,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:44:27,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 09:44:27,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 165 flow. Second operand has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 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-04 09:44:27,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:27,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 09:44:27,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:31,249 INFO L124 PetriNetUnfolderBase]: 5287/10050 cut-off events. [2025-03-04 09:44:31,249 INFO L125 PetriNetUnfolderBase]: For 2267/2267 co-relation queries the response was YES. [2025-03-04 09:44:31,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22160 conditions, 10050 events. 5287/10050 cut-off events. For 2267/2267 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 69863 event pairs, 756 based on Foata normal form. 264/9717 useless extension candidates. Maximal degree in co-relation 22145. Up to 1753 conditions per place. [2025-03-04 09:44:31,322 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 317 selfloop transitions, 45 changer transitions 0/375 dead transitions. [2025-03-04 09:44:31,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 375 transitions, 1774 flow [2025-03-04 09:44:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 09:44:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 09:44:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 679 transitions. [2025-03-04 09:44:31,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6172727272727273 [2025-03-04 09:44:31,326 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 165 flow. Second operand 20 states and 679 transitions. [2025-03-04 09:44:31,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 375 transitions, 1774 flow [2025-03-04 09:44:31,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 375 transitions, 1773 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:31,340 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 582 flow [2025-03-04 09:44:31,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=582, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2025-03-04 09:44:31,341 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-03-04 09:44:31,342 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 582 flow [2025-03-04 09:44:31,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 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-04 09:44:31,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:31,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:31,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:44:31,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:31,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:44:31,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1808593420, now seen corresponding path program 1 times [2025-03-04 09:44:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:31,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327007536] [2025-03-04 09:44:31,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:31,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:31,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:31,547 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:31,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:44:31,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:44:32,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:44:32,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:32,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat