./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:53:25,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:53:25,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:53:25,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:53:25,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:53:25,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:53:25,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:53:25,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:53:25,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:53:25,206 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:53:25,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:53:25,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:53:25,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:53:25,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:53:25,206 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:53:25,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:53:25,206 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:53:25,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:53:25,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:53:25,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:53:25,207 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:53:25,207 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:53:25,207 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:53:25,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:53:25,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:53:25,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:53:25,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:53:25,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:53:25,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:53:25,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:53:25,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:53:25,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:53:25,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:53:25,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:53:25,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:53:25,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:53:25,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:53:25,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:53:25,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:53:25,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:53:25,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:53:25,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:53:25,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:53:25,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:53:25,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:53:25,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:53:25,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:53:25,209 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d [2025-01-10 00:53:25,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:53:25,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:53:25,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:53:25,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:53:25,443 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:53:25,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2025-01-10 00:53:26,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb01b3f20/1fc1f40d078e4bf5802caf71c8c7a491/FLAG5c8dd7ded [2025-01-10 00:53:27,140 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:53:27,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2025-01-10 00:53:27,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb01b3f20/1fc1f40d078e4bf5802caf71c8c7a491/FLAG5c8dd7ded [2025-01-10 00:53:27,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb01b3f20/1fc1f40d078e4bf5802caf71c8c7a491 [2025-01-10 00:53:27,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:53:27,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:53:27,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:53:27,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:53:27,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:53:27,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693fb11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27, skipping insertion in model container [2025-01-10 00:53:27,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:53:27,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:53:27,756 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:53:27,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:53:27,899 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:53:27,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27 WrapperNode [2025-01-10 00:53:27,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:53:27,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:53:27,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:53:27,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:53:27,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,938 INFO L138 Inliner]: procedures = 487, calls = 37, calls flagged for inlining = 16, calls inlined = 21, statements flattened = 209 [2025-01-10 00:53:27,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:53:27,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:53:27,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:53:27,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:53:27,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,967 INFO L175 MemorySlicer]: Split 9 memory accesses to 4 slices as follows [2, 5, 1, 1]. 56 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 2 writes are split as follows [0, 0, 1, 1]. [2025-01-10 00:53:27,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,983 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:27,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:28,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:53:28,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:53:28,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:53:28,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:53:28,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (1/1) ... [2025-01-10 00:53:28,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:53:28,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:53:28,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:53:28,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:53:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2025-01-10 00:53:28,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2025-01-10 00:53:28,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:53:28,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:53:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:53:28,063 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:53:28,271 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:53:28,272 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:53:28,504 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:53:28,504 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:53:28,668 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:53:28,669 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 00:53:28,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:28 BoogieIcfgContainer [2025-01-10 00:53:28,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:53:28,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:53:28,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:53:28,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:53:28,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:53:27" (1/3) ... [2025-01-10 00:53:28,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f1cd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:28, skipping insertion in model container [2025-01-10 00:53:28,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:27" (2/3) ... [2025-01-10 00:53:28,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f1cd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:28, skipping insertion in model container [2025-01-10 00:53:28,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:28" (3/3) ... [2025-01-10 00:53:28,677 INFO L128 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2025-01-10 00:53:28,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:53:28,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-4_1-thread_local_vars.i that has 3 procedures, 81 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-01-10 00:53:28,702 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:53:28,784 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-01-10 00:53:28,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 152 transitions, 331 flow [2025-01-10 00:53:28,855 INFO L124 PetriNetUnfolderBase]: 36/156 cut-off events. [2025-01-10 00:53:28,861 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 00:53:28,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 156 events. 36/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 505 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 107. Up to 11 conditions per place. [2025-01-10 00:53:28,868 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 152 transitions, 331 flow [2025-01-10 00:53:28,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 106 transitions, 228 flow [2025-01-10 00:53:28,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:53:28,895 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;@6cda6bd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:53:28,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-10 00:53:28,900 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:53:28,903 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2025-01-10 00:53:28,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:53:28,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:28,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:53:28,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:28,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 18481471, now seen corresponding path program 1 times [2025-01-10 00:53:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:28,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405597509] [2025-01-10 00:53:28,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:29,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:53:29,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:53:29,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:29,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:29,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405597509] [2025-01-10 00:53:29,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405597509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:29,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:29,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:29,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346825613] [2025-01-10 00:53:29,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:29,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:29,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:29,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:29,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 152 [2025-01-10 00:53:29,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 106 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-01-10 00:53:29,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:29,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 152 [2025-01-10 00:53:29,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:29,714 INFO L124 PetriNetUnfolderBase]: 2021/3758 cut-off events. [2025-01-10 00:53:29,714 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-10 00:53:29,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6832 conditions, 3758 events. 2021/3758 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 25232 event pairs, 1646 based on Foata normal form. 321/3595 useless extension candidates. Maximal degree in co-relation 6490. Up to 2977 conditions per place. [2025-01-10 00:53:29,735 INFO L140 encePairwiseOnDemand]: 135/152 looper letters, 54 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2025-01-10 00:53:29,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 312 flow [2025-01-10 00:53:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2025-01-10 00:53:29,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5109649122807017 [2025-01-10 00:53:29,744 INFO L175 Difference]: Start difference. First operand has 86 places, 106 transitions, 228 flow. Second operand 3 states and 233 transitions. [2025-01-10 00:53:29,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 312 flow [2025-01-10 00:53:29,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:53:29,749 INFO L231 Difference]: Finished difference. Result has 71 places, 77 transitions, 178 flow [2025-01-10 00:53:29,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=71, PETRI_TRANSITIONS=77} [2025-01-10 00:53:29,757 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2025-01-10 00:53:29,757 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 77 transitions, 178 flow [2025-01-10 00:53:29,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-01-10 00:53:29,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:29,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:29,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:53:29,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:29,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:29,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1638826227, now seen corresponding path program 1 times [2025-01-10 00:53:29,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:29,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53338148] [2025-01-10 00:53:29,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:29,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:29,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:53:29,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:53:29,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:29,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53338148] [2025-01-10 00:53:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53338148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:29,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:29,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:53:29,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393277103] [2025-01-10 00:53:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:29,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:53:29,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:29,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:53:29,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:53:29,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 152 [2025-01-10 00:53:29,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 77 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:29,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:29,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 152 [2025-01-10 00:53:29,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:30,183 INFO L124 PetriNetUnfolderBase]: 1295/2395 cut-off events. [2025-01-10 00:53:30,184 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 00:53:30,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4487 conditions, 2395 events. 1295/2395 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14627 event pairs, 383 based on Foata normal form. 0/2223 useless extension candidates. Maximal degree in co-relation 4244. Up to 1159 conditions per place. [2025-01-10 00:53:30,194 INFO L140 encePairwiseOnDemand]: 148/152 looper letters, 108 selfloop transitions, 3 changer transitions 2/144 dead transitions. [2025-01-10 00:53:30,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 144 transitions, 556 flow [2025-01-10 00:53:30,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:53:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:53:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 338 transitions. [2025-01-10 00:53:30,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555921052631579 [2025-01-10 00:53:30,196 INFO L175 Difference]: Start difference. First operand has 71 places, 77 transitions, 178 flow. Second operand 4 states and 338 transitions. [2025-01-10 00:53:30,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 144 transitions, 556 flow [2025-01-10 00:53:30,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 144 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:53:30,201 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 183 flow [2025-01-10 00:53:30,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2025-01-10 00:53:30,201 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -12 predicate places. [2025-01-10 00:53:30,202 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 183 flow [2025-01-10 00:53:30,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:30,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:30,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:30,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:53:30,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:30,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:30,203 INFO L85 PathProgramCache]: Analyzing trace with hash -847697605, now seen corresponding path program 1 times [2025-01-10 00:53:30,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:30,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677886859] [2025-01-10 00:53:30,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:30,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:30,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:53:30,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:53:30,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:30,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:30,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:30,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677886859] [2025-01-10 00:53:30,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677886859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:30,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:30,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:53:30,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842844281] [2025-01-10 00:53:30,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:30,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:30,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:30,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:30,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:30,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-01-10 00:53:30,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:30,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:30,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:30,756 INFO L124 PetriNetUnfolderBase]: 2329/4170 cut-off events. [2025-01-10 00:53:30,756 INFO L125 PetriNetUnfolderBase]: For 2902/2902 co-relation queries the response was YES. [2025-01-10 00:53:30,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9293 conditions, 4170 events. 2329/4170 cut-off events. For 2902/2902 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 23788 event pairs, 1035 based on Foata normal form. 0/3834 useless extension candidates. Maximal degree in co-relation 4080. Up to 2197 conditions per place. [2025-01-10 00:53:30,776 INFO L140 encePairwiseOnDemand]: 147/152 looper letters, 70 selfloop transitions, 4 changer transitions 6/109 dead transitions. [2025-01-10 00:53:30,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 417 flow [2025-01-10 00:53:30,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2025-01-10 00:53:30,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5350877192982456 [2025-01-10 00:53:30,781 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 183 flow. Second operand 3 states and 244 transitions. [2025-01-10 00:53:30,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 417 flow [2025-01-10 00:53:30,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 109 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:53:30,785 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 194 flow [2025-01-10 00:53:30,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2025-01-10 00:53:30,786 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2025-01-10 00:53:30,786 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 194 flow [2025-01-10 00:53:30,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-01-10 00:53:30,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:30,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:30,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:53:30,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread_usbErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:30,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1508963061, now seen corresponding path program 1 times [2025-01-10 00:53:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:30,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362526597] [2025-01-10 00:53:30,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:30,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:53:30,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:53:30,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:30,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:30,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:30,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362526597] [2025-01-10 00:53:30,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362526597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:30,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:30,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:53:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193435566] [2025-01-10 00:53:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:30,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:30,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:30,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:30,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:30,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 152 [2025-01-10 00:53:30,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-01-10 00:53:30,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:30,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 152 [2025-01-10 00:53:30,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:31,149 INFO L124 PetriNetUnfolderBase]: 2336/4118 cut-off events. [2025-01-10 00:53:31,150 INFO L125 PetriNetUnfolderBase]: For 3366/3368 co-relation queries the response was YES. [2025-01-10 00:53:31,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9856 conditions, 4118 events. 2336/4118 cut-off events. For 3366/3368 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 22605 event pairs, 1456 based on Foata normal form. 0/3787 useless extension candidates. Maximal degree in co-relation 4110. Up to 2919 conditions per place. [2025-01-10 00:53:31,166 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 56 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2025-01-10 00:53:31,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 351 flow [2025-01-10 00:53:31,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2025-01-10 00:53:31,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48464912280701755 [2025-01-10 00:53:31,167 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 194 flow. Second operand 3 states and 221 transitions. [2025-01-10 00:53:31,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 351 flow [2025-01-10 00:53:31,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 316 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 00:53:31,170 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 170 flow [2025-01-10 00:53:31,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2025-01-10 00:53:31,171 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -21 predicate places. [2025-01-10 00:53:31,171 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 170 flow [2025-01-10 00:53:31,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-01-10 00:53:31,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:31,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:31,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:53:31,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:31,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash -454243082, now seen corresponding path program 1 times [2025-01-10 00:53:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:31,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178152142] [2025-01-10 00:53:31,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:31,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:53:31,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:53:31,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:31,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:31,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178152142] [2025-01-10 00:53:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178152142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:31,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:31,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:31,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023886364] [2025-01-10 00:53:31,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:31,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:31,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:31,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:31,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:31,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:31,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-01-10 00:53:31,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:31,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:31,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:31,578 INFO L124 PetriNetUnfolderBase]: 2363/4298 cut-off events. [2025-01-10 00:53:31,578 INFO L125 PetriNetUnfolderBase]: For 606/612 co-relation queries the response was YES. [2025-01-10 00:53:31,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8504 conditions, 4298 events. 2363/4298 cut-off events. For 606/612 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 25276 event pairs, 1441 based on Foata normal form. 6/3941 useless extension candidates. Maximal degree in co-relation 3428. Up to 2856 conditions per place. [2025-01-10 00:53:31,593 INFO L140 encePairwiseOnDemand]: 147/152 looper letters, 71 selfloop transitions, 5 changer transitions 0/101 dead transitions. [2025-01-10 00:53:31,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 101 transitions, 406 flow [2025-01-10 00:53:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2025-01-10 00:53:31,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2025-01-10 00:53:31,595 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 170 flow. Second operand 3 states and 240 transitions. [2025-01-10 00:53:31,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 101 transitions, 406 flow [2025-01-10 00:53:31,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 101 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:53:31,601 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 192 flow [2025-01-10 00:53:31,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2025-01-10 00:53:31,602 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -19 predicate places. [2025-01-10 00:53:31,602 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 192 flow [2025-01-10 00:53:31,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-01-10 00:53:31,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:31,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:31,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:53:31,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:31,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash -428082101, now seen corresponding path program 1 times [2025-01-10 00:53:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:31,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519614257] [2025-01-10 00:53:31,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:31,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:53:31,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:53:31,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:31,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519614257] [2025-01-10 00:53:31,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519614257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:31,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:31,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:31,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217666186] [2025-01-10 00:53:31,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:31,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:31,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:31,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:31,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:31,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:31,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-01-10 00:53:31,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:31,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:31,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:32,061 INFO L124 PetriNetUnfolderBase]: 2350/4259 cut-off events. [2025-01-10 00:53:32,062 INFO L125 PetriNetUnfolderBase]: For 1944/1954 co-relation queries the response was YES. [2025-01-10 00:53:32,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8911 conditions, 4259 events. 2350/4259 cut-off events. For 1944/1954 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 24796 event pairs, 1430 based on Foata normal form. 32/3942 useless extension candidates. Maximal degree in co-relation 5556. Up to 2490 conditions per place. [2025-01-10 00:53:32,081 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 72 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2025-01-10 00:53:32,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 100 transitions, 413 flow [2025-01-10 00:53:32,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2025-01-10 00:53:32,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5197368421052632 [2025-01-10 00:53:32,084 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 192 flow. Second operand 3 states and 237 transitions. [2025-01-10 00:53:32,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 100 transitions, 413 flow [2025-01-10 00:53:32,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:53:32,089 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 186 flow [2025-01-10 00:53:32,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2025-01-10 00:53:32,090 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2025-01-10 00:53:32,091 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 186 flow [2025-01-10 00:53:32,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-01-10 00:53:32,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:32,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:32,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:53:32,092 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:32,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:32,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1994315457, now seen corresponding path program 1 times [2025-01-10 00:53:32,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:32,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786002023] [2025-01-10 00:53:32,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:32,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:32,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:53:32,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:53:32,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:32,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:32,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:32,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786002023] [2025-01-10 00:53:32,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786002023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:32,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:32,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:53:32,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501173071] [2025-01-10 00:53:32,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:32,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:32,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:32,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:32,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:32,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:32,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-01-10 00:53:32,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:32,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:32,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:32,487 INFO L124 PetriNetUnfolderBase]: 2349/4021 cut-off events. [2025-01-10 00:53:32,487 INFO L125 PetriNetUnfolderBase]: For 1943/1947 co-relation queries the response was YES. [2025-01-10 00:53:32,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8634 conditions, 4021 events. 2349/4021 cut-off events. For 1943/1947 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 21329 event pairs, 1390 based on Foata normal form. 0/3653 useless extension candidates. Maximal degree in co-relation 5331. Up to 2929 conditions per place. [2025-01-10 00:53:32,503 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 64 selfloop transitions, 2 changer transitions 2/90 dead transitions. [2025-01-10 00:53:32,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 389 flow [2025-01-10 00:53:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2025-01-10 00:53:32,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49780701754385964 [2025-01-10 00:53:32,505 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 186 flow. Second operand 3 states and 227 transitions. [2025-01-10 00:53:32,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 389 flow [2025-01-10 00:53:32,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:53:32,509 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 174 flow [2025-01-10 00:53:32,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=63, PETRI_TRANSITIONS=66} [2025-01-10 00:53:32,509 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -23 predicate places. [2025-01-10 00:53:32,509 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 174 flow [2025-01-10 00:53:32,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-01-10 00:53:32,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:32,510 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:32,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:53:32,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbThread1of1ForFork1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:32,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash 246192719, now seen corresponding path program 1 times [2025-01-10 00:53:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:32,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471277988] [2025-01-10 00:53:32,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:32,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:32,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:53:32,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:53:32,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:32,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:32,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-01-10 00:53:32,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:32,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471277988] [2025-01-10 00:53:32,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471277988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:32,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:32,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:53:32,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009395158] [2025-01-10 00:53:32,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:32,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:32,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:32,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:32,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:32,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 152 [2025-01-10 00:53:32,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-01-10 00:53:32,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:32,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 152 [2025-01-10 00:53:32,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:32,804 INFO L124 PetriNetUnfolderBase]: 2070/3671 cut-off events. [2025-01-10 00:53:32,804 INFO L125 PetriNetUnfolderBase]: For 1018/1021 co-relation queries the response was YES. [2025-01-10 00:53:32,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7421 conditions, 3671 events. 2070/3671 cut-off events. For 1018/1021 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 20058 event pairs, 660 based on Foata normal form. 288/3711 useless extension candidates. Maximal degree in co-relation 5001. Up to 1525 conditions per place. [2025-01-10 00:53:32,816 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 60 selfloop transitions, 3 changer transitions 2/85 dead transitions. [2025-01-10 00:53:32,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 357 flow [2025-01-10 00:53:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2025-01-10 00:53:32,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4780701754385965 [2025-01-10 00:53:32,817 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 174 flow. Second operand 3 states and 218 transitions. [2025-01-10 00:53:32,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 357 flow [2025-01-10 00:53:32,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 343 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:53:32,821 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 183 flow [2025-01-10 00:53:32,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2025-01-10 00:53:32,821 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -25 predicate places. [2025-01-10 00:53:32,821 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 183 flow [2025-01-10 00:53:32,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-01-10 00:53:32,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:32,822 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-01-10 00:53:32,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:53:32,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:32,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash -665546195, now seen corresponding path program 1 times [2025-01-10 00:53:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594452053] [2025-01-10 00:53:32,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:32,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:53:32,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:53:32,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:32,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594452053] [2025-01-10 00:53:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594452053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:32,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:32,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:32,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545622484] [2025-01-10 00:53:32,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:32,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:53:32,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:32,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:53:32,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:53:32,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:32,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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-01-10 00:53:32,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:32,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:32,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:33,244 INFO L124 PetriNetUnfolderBase]: 2173/3984 cut-off events. [2025-01-10 00:53:33,244 INFO L125 PetriNetUnfolderBase]: For 1259/1265 co-relation queries the response was YES. [2025-01-10 00:53:33,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8228 conditions, 3984 events. 2173/3984 cut-off events. For 1259/1265 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 22666 event pairs, 1103 based on Foata normal form. 15/3761 useless extension candidates. Maximal degree in co-relation 2302. Up to 1887 conditions per place. [2025-01-10 00:53:33,254 INFO L140 encePairwiseOnDemand]: 147/152 looper letters, 85 selfloop transitions, 4 changer transitions 8/118 dead transitions. [2025-01-10 00:53:33,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 118 transitions, 506 flow [2025-01-10 00:53:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:53:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:53:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 316 transitions. [2025-01-10 00:53:33,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5197368421052632 [2025-01-10 00:53:33,257 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 183 flow. Second operand 4 states and 316 transitions. [2025-01-10 00:53:33,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 118 transitions, 506 flow [2025-01-10 00:53:33,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 118 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:53:33,261 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 202 flow [2025-01-10 00:53:33,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2025-01-10 00:53:33,262 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2025-01-10 00:53:33,262 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 202 flow [2025-01-10 00:53:33,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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-01-10 00:53:33,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:33,263 INFO L206 CegarLoopForPetriNet]: trace histogram [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-01-10 00:53:33,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:53:33,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:33,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:33,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1539207558, now seen corresponding path program 1 times [2025-01-10 00:53:33,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:33,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532054999] [2025-01-10 00:53:33,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:33,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:33,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:53:33,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:53:33,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:33,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:33,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:33,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532054999] [2025-01-10 00:53:33,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532054999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:33,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:33,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:33,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534926841] [2025-01-10 00:53:33,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:33,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:33,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:33,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:33,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:33,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:33,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-01-10 00:53:33,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:33,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:33,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:33,639 INFO L124 PetriNetUnfolderBase]: 1938/3588 cut-off events. [2025-01-10 00:53:33,639 INFO L125 PetriNetUnfolderBase]: For 2212/2213 co-relation queries the response was YES. [2025-01-10 00:53:33,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7910 conditions, 3588 events. 1938/3588 cut-off events. For 2212/2213 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 20101 event pairs, 1477 based on Foata normal form. 5/3361 useless extension candidates. Maximal degree in co-relation 5422. Up to 2816 conditions per place. [2025-01-10 00:53:33,650 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 52 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2025-01-10 00:53:33,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 344 flow [2025-01-10 00:53:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2025-01-10 00:53:33,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4780701754385965 [2025-01-10 00:53:33,653 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 202 flow. Second operand 3 states and 218 transitions. [2025-01-10 00:53:33,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 344 flow [2025-01-10 00:53:33,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 331 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 00:53:33,657 INFO L231 Difference]: Finished difference. Result has 62 places, 65 transitions, 197 flow [2025-01-10 00:53:33,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=62, PETRI_TRANSITIONS=65} [2025-01-10 00:53:33,658 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -24 predicate places. [2025-01-10 00:53:33,659 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 65 transitions, 197 flow [2025-01-10 00:53:33,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-01-10 00:53:33,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:33,659 INFO L206 CegarLoopForPetriNet]: trace histogram [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-01-10 00:53:33,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:53:33,660 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:33,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1539207557, now seen corresponding path program 1 times [2025-01-10 00:53:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:33,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847603591] [2025-01-10 00:53:33,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:33,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:53:33,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:53:33,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:33,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:33,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:33,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847603591] [2025-01-10 00:53:33,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847603591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:33,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:33,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:33,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660352638] [2025-01-10 00:53:33,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:33,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:33,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:33,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:33,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:33,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:33,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-01-10 00:53:33,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:33,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:33,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:33,929 INFO L124 PetriNetUnfolderBase]: 1938/3583 cut-off events. [2025-01-10 00:53:33,929 INFO L125 PetriNetUnfolderBase]: For 1979/1980 co-relation queries the response was YES. [2025-01-10 00:53:33,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7793 conditions, 3583 events. 1938/3583 cut-off events. For 1979/1980 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 20068 event pairs, 1477 based on Foata normal form. 5/3356 useless extension candidates. Maximal degree in co-relation 5388. Up to 2816 conditions per place. [2025-01-10 00:53:33,939 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 52 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2025-01-10 00:53:33,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 339 flow [2025-01-10 00:53:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2025-01-10 00:53:33,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4780701754385965 [2025-01-10 00:53:33,941 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 197 flow. Second operand 3 states and 218 transitions. [2025-01-10 00:53:33,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 339 flow [2025-01-10 00:53:33,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:53:33,943 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 195 flow [2025-01-10 00:53:33,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2025-01-10 00:53:33,944 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -25 predicate places. [2025-01-10 00:53:33,944 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 195 flow [2025-01-10 00:53:33,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-01-10 00:53:33,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:33,944 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:33,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:53:33,945 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:33,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1634786472, now seen corresponding path program 1 times [2025-01-10 00:53:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931996129] [2025-01-10 00:53:33,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:33,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 00:53:33,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 00:53:33,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:33,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:34,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:34,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931996129] [2025-01-10 00:53:34,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931996129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:34,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:34,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:53:34,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443303925] [2025-01-10 00:53:34,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:34,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:53:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:34,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:53:34,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:53:34,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 152 [2025-01-10 00:53:34,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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-01-10 00:53:34,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:34,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 152 [2025-01-10 00:53:34,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:34,574 INFO L124 PetriNetUnfolderBase]: 2098/3919 cut-off events. [2025-01-10 00:53:34,574 INFO L125 PetriNetUnfolderBase]: For 2128/2140 co-relation queries the response was YES. [2025-01-10 00:53:34,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8539 conditions, 3919 events. 2098/3919 cut-off events. For 2128/2140 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 23042 event pairs, 1201 based on Foata normal form. 12/3669 useless extension candidates. Maximal degree in co-relation 6102. Up to 2202 conditions per place. [2025-01-10 00:53:34,585 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 80 selfloop transitions, 9 changer transitions 0/108 dead transitions. [2025-01-10 00:53:34,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 493 flow [2025-01-10 00:53:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:53:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:53:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 301 transitions. [2025-01-10 00:53:34,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49506578947368424 [2025-01-10 00:53:34,587 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 195 flow. Second operand 4 states and 301 transitions. [2025-01-10 00:53:34,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 493 flow [2025-01-10 00:53:34,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 108 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:53:34,591 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 253 flow [2025-01-10 00:53:34,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2025-01-10 00:53:34,591 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -21 predicate places. [2025-01-10 00:53:34,592 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 253 flow [2025-01-10 00:53:34,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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-01-10 00:53:34,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:34,592 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:34,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:53:34,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:34,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:34,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1097616826, now seen corresponding path program 2 times [2025-01-10 00:53:34,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:34,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959943159] [2025-01-10 00:53:34,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:53:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:34,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 1 equivalence classes. [2025-01-10 00:53:34,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 00:53:34,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:53:34,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:34,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:34,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959943159] [2025-01-10 00:53:34,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959943159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:34,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:34,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:53:34,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324389924] [2025-01-10 00:53:34,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:34,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:53:34,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:34,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:53:34,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:53:34,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 152 [2025-01-10 00:53:34,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 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-01-10 00:53:34,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:34,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 152 [2025-01-10 00:53:34,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:35,089 INFO L124 PetriNetUnfolderBase]: 2089/3891 cut-off events. [2025-01-10 00:53:35,089 INFO L125 PetriNetUnfolderBase]: For 4196/4214 co-relation queries the response was YES. [2025-01-10 00:53:35,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9039 conditions, 3891 events. 2089/3891 cut-off events. For 4196/4214 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 22728 event pairs, 1131 based on Foata normal form. 30/3676 useless extension candidates. Maximal degree in co-relation 6298. Up to 1785 conditions per place. [2025-01-10 00:53:35,100 INFO L140 encePairwiseOnDemand]: 147/152 looper letters, 86 selfloop transitions, 14 changer transitions 0/119 dead transitions. [2025-01-10 00:53:35,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 119 transitions, 580 flow [2025-01-10 00:53:35,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:53:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:53:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 362 transitions. [2025-01-10 00:53:35,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4763157894736842 [2025-01-10 00:53:35,102 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 253 flow. Second operand 5 states and 362 transitions. [2025-01-10 00:53:35,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 119 transitions, 580 flow [2025-01-10 00:53:35,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 574 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 00:53:35,108 INFO L231 Difference]: Finished difference. Result has 68 places, 70 transitions, 297 flow [2025-01-10 00:53:35,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2025-01-10 00:53:35,109 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -18 predicate places. [2025-01-10 00:53:35,109 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 297 flow [2025-01-10 00:53:35,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 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-01-10 00:53:35,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:35,110 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:35,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:53:35,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:35,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1704984453, now seen corresponding path program 1 times [2025-01-10 00:53:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:35,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082746396] [2025-01-10 00:53:35,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:35,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:35,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 00:53:35,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 00:53:35,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:35,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:35,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:35,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082746396] [2025-01-10 00:53:35,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082746396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:35,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:35,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:53:35,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494826027] [2025-01-10 00:53:35,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:35,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:53:35,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:35,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:53:35,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:53:35,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:35,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 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-01-10 00:53:35,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:35,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:35,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:35,638 INFO L124 PetriNetUnfolderBase]: 2187/4090 cut-off events. [2025-01-10 00:53:35,638 INFO L125 PetriNetUnfolderBase]: For 5808/5832 co-relation queries the response was YES. [2025-01-10 00:53:35,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9716 conditions, 4090 events. 2187/4090 cut-off events. For 5808/5832 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 24141 event pairs, 1199 based on Foata normal form. 35/3877 useless extension candidates. Maximal degree in co-relation 6849. Up to 1784 conditions per place. [2025-01-10 00:53:35,695 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 101 selfloop transitions, 9 changer transitions 8/136 dead transitions. [2025-01-10 00:53:35,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 136 transitions, 698 flow [2025-01-10 00:53:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:53:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:53:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2025-01-10 00:53:35,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5078947368421053 [2025-01-10 00:53:35,697 INFO L175 Difference]: Start difference. First operand has 68 places, 70 transitions, 297 flow. Second operand 5 states and 386 transitions. [2025-01-10 00:53:35,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 136 transitions, 698 flow [2025-01-10 00:53:35,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 136 transitions, 688 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-01-10 00:53:35,706 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 329 flow [2025-01-10 00:53:35,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2025-01-10 00:53:35,708 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -12 predicate places. [2025-01-10 00:53:35,708 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 329 flow [2025-01-10 00:53:35,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 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-01-10 00:53:35,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:35,708 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:35,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:53:35,708 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:35,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2142772145, now seen corresponding path program 2 times [2025-01-10 00:53:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:35,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772744171] [2025-01-10 00:53:35,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:53:35,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:35,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 1 equivalence classes. [2025-01-10 00:53:35,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 00:53:35,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:53:35,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:35,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772744171] [2025-01-10 00:53:35,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772744171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:35,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:35,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:53:35,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216838273] [2025-01-10 00:53:35,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:35,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:53:35,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:35,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:53:35,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:53:35,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:35,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 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-01-10 00:53:35,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:35,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:35,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:36,373 INFO L124 PetriNetUnfolderBase]: 2485/4691 cut-off events. [2025-01-10 00:53:36,373 INFO L125 PetriNetUnfolderBase]: For 10086/10116 co-relation queries the response was YES. [2025-01-10 00:53:36,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11439 conditions, 4691 events. 2485/4691 cut-off events. For 10086/10116 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 27466 event pairs, 1292 based on Foata normal form. 41/4440 useless extension candidates. Maximal degree in co-relation 9483. Up to 2183 conditions per place. [2025-01-10 00:53:36,388 INFO L140 encePairwiseOnDemand]: 145/152 looper letters, 125 selfloop transitions, 6 changer transitions 12/161 dead transitions. [2025-01-10 00:53:36,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 161 transitions, 854 flow [2025-01-10 00:53:36,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:53:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:53:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 465 transitions. [2025-01-10 00:53:36,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5098684210526315 [2025-01-10 00:53:36,390 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 329 flow. Second operand 6 states and 465 transitions. [2025-01-10 00:53:36,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 161 transitions, 854 flow [2025-01-10 00:53:36,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 161 transitions, 819 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-10 00:53:36,402 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 356 flow [2025-01-10 00:53:36,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=356, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2025-01-10 00:53:36,403 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-01-10 00:53:36,403 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 356 flow [2025-01-10 00:53:36,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 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-01-10 00:53:36,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:36,403 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:36,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:53:36,404 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:36,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1321718877, now seen corresponding path program 3 times [2025-01-10 00:53:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:36,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680630202] [2025-01-10 00:53:36,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:53:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:36,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 1 equivalence classes. [2025-01-10 00:53:36,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 00:53:36,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:53:36,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:36,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:36,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680630202] [2025-01-10 00:53:36,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680630202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:36,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:36,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:53:36,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078828338] [2025-01-10 00:53:36,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:36,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:53:36,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:36,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:53:36,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:53:36,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:36,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 356 flow. Second operand has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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-01-10 00:53:36,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:36,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:36,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:37,158 INFO L124 PetriNetUnfolderBase]: 2593/5009 cut-off events. [2025-01-10 00:53:37,159 INFO L125 PetriNetUnfolderBase]: For 10141/10171 co-relation queries the response was YES. [2025-01-10 00:53:37,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12185 conditions, 5009 events. 2593/5009 cut-off events. For 10141/10171 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 29505 event pairs, 1435 based on Foata normal form. 41/4721 useless extension candidates. Maximal degree in co-relation 10326. Up to 1782 conditions per place. [2025-01-10 00:53:37,178 INFO L140 encePairwiseOnDemand]: 145/152 looper letters, 132 selfloop transitions, 15 changer transitions 13/178 dead transitions. [2025-01-10 00:53:37,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 178 transitions, 948 flow [2025-01-10 00:53:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:53:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:53:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 535 transitions. [2025-01-10 00:53:37,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028195488721805 [2025-01-10 00:53:37,180 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 356 flow. Second operand 7 states and 535 transitions. [2025-01-10 00:53:37,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 178 transitions, 948 flow [2025-01-10 00:53:37,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 178 transitions, 927 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-10 00:53:37,194 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 417 flow [2025-01-10 00:53:37,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=417, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2025-01-10 00:53:37,195 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -3 predicate places. [2025-01-10 00:53:37,195 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 417 flow [2025-01-10 00:53:37,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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-01-10 00:53:37,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:37,196 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-10 00:53:37,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:53:37,196 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:37,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1267611045, now seen corresponding path program 4 times [2025-01-10 00:53:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:37,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655991191] [2025-01-10 00:53:37,197 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:53:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:37,211 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-01-10 00:53:37,236 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 00:53:37,236 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:53:37,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 00:53:37,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:37,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655991191] [2025-01-10 00:53:37,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655991191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:37,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:37,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:53:37,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205683631] [2025-01-10 00:53:37,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:37,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:53:37,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:37,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:53:37,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:53:37,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 152 [2025-01-10 00:53:37,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 417 flow. Second operand has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 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-01-10 00:53:37,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:37,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 152 [2025-01-10 00:53:37,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:38,091 INFO L124 PetriNetUnfolderBase]: 2967/5781 cut-off events. [2025-01-10 00:53:38,092 INFO L125 PetriNetUnfolderBase]: For 13361/13391 co-relation queries the response was YES. [2025-01-10 00:53:38,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13956 conditions, 5781 events. 2967/5781 cut-off events. For 13361/13391 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 33922 event pairs, 1597 based on Foata normal form. 41/5452 useless extension candidates. Maximal degree in co-relation 11406. Up to 2709 conditions per place. [2025-01-10 00:53:38,105 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 94 selfloop transitions, 3 changer transitions 26/141 dead transitions. [2025-01-10 00:53:38,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 141 transitions, 851 flow [2025-01-10 00:53:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:53:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:53:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2025-01-10 00:53:38,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-01-10 00:53:38,106 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 417 flow. Second operand 5 states and 385 transitions. [2025-01-10 00:53:38,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 141 transitions, 851 flow [2025-01-10 00:53:38,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 141 transitions, 796 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-01-10 00:53:38,114 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 339 flow [2025-01-10 00:53:38,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2025-01-10 00:53:38,115 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -3 predicate places. [2025-01-10 00:53:38,115 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 339 flow [2025-01-10 00:53:38,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 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-01-10 00:53:38,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:38,115 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-10 00:53:38,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:53:38,115 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:38,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:38,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1603282833, now seen corresponding path program 5 times [2025-01-10 00:53:38,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:38,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246799130] [2025-01-10 00:53:38,116 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:53:38,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:38,128 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-01-10 00:53:38,136 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 00:53:38,136 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:53:38,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246799130] [2025-01-10 00:53:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246799130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:53:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415543194] [2025-01-10 00:53:39,546 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:53:39,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:53:39,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:53:39,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:53:39,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:53:39,643 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-01-10 00:53:39,681 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 00:53:39,682 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:53:39,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:39,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 00:53:39,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:53:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 00:53:40,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:53:40,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415543194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:40,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:53:40,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2025-01-10 00:53:40,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764350071] [2025-01-10 00:53:40,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:40,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:53:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:40,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:53:40,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:53:40,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 152 [2025-01-10 00:53:40,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 339 flow. Second operand has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 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-01-10 00:53:40,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:40,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 152 [2025-01-10 00:53:40,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:41,259 INFO L124 PetriNetUnfolderBase]: 2347/4539 cut-off events. [2025-01-10 00:53:41,260 INFO L125 PetriNetUnfolderBase]: For 9754/9781 co-relation queries the response was YES. [2025-01-10 00:53:41,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10911 conditions, 4539 events. 2347/4539 cut-off events. For 9754/9781 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 24969 event pairs, 1338 based on Foata normal form. 39/4277 useless extension candidates. Maximal degree in co-relation 9979. Up to 1760 conditions per place. [2025-01-10 00:53:41,272 INFO L140 encePairwiseOnDemand]: 145/152 looper letters, 78 selfloop transitions, 6 changer transitions 66/168 dead transitions. [2025-01-10 00:53:41,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 168 transitions, 856 flow [2025-01-10 00:53:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:53:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:53:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 576 transitions. [2025-01-10 00:53:41,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-01-10 00:53:41,274 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 339 flow. Second operand 8 states and 576 transitions. [2025-01-10 00:53:41,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 168 transitions, 856 flow [2025-01-10 00:53:41,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 168 transitions, 836 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 00:53:41,283 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 274 flow [2025-01-10 00:53:41,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=274, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2025-01-10 00:53:41,283 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -3 predicate places. [2025-01-10 00:53:41,284 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 274 flow [2025-01-10 00:53:41,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 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-01-10 00:53:41,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:41,284 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:41,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:53:41,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 00:53:41,488 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:53:41,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:41,489 INFO L85 PathProgramCache]: Analyzing trace with hash -306553795, now seen corresponding path program 6 times [2025-01-10 00:53:41,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:41,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021497002] [2025-01-10 00:53:41,489 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:53:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:41,516 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 92 statements into 2 equivalence classes. [2025-01-10 00:53:41,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:53:41,530 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-10 00:53:41,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-10 00:53:42,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021497002] [2025-01-10 00:53:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021497002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:53:42,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557587759] [2025-01-10 00:53:42,086 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:53:42,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:53:42,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:53:42,089 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:53:42,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:53:42,180 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 92 statements into 2 equivalence classes. [2025-01-10 00:53:42,224 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:53:42,225 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-10 00:53:42,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:42,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 00:53:42,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:53:42,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-10 00:53:42,409 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:53:42,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2025-01-10 00:53:42,431 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:53:42,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2025-01-10 00:53:42,567 INFO L349 Elim1Store]: treesize reduction 64, result has 23.8 percent of original size [2025-01-10 00:53:42,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 49 [2025-01-10 00:53:42,604 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:53:42,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2025-01-10 00:53:42,716 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-01-10 00:53:42,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2025-01-10 00:53:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 00:53:42,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:53:42,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557587759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:42,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:53:42,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 9 [2025-01-10 00:53:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957934417] [2025-01-10 00:53:42,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:42,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:53:42,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:42,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:53:42,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:53:42,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 152 [2025-01-10 00:53:42,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 274 flow. Second operand has 10 states, 10 states have (on average 59.0) internal successors, (590), 10 states have internal predecessors, (590), 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-01-10 00:53:42,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:42,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 152 [2025-01-10 00:53:42,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:43,445 INFO L124 PetriNetUnfolderBase]: 2024/3770 cut-off events. [2025-01-10 00:53:43,445 INFO L125 PetriNetUnfolderBase]: For 10029/10050 co-relation queries the response was YES. [2025-01-10 00:53:43,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9358 conditions, 3770 events. 2024/3770 cut-off events. For 10029/10050 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 19281 event pairs, 1120 based on Foata normal form. 33/3562 useless extension candidates. Maximal degree in co-relation 9343. Up to 1760 conditions per place. [2025-01-10 00:53:43,452 INFO L140 encePairwiseOnDemand]: 145/152 looper letters, 0 selfloop transitions, 0 changer transitions 158/158 dead transitions. [2025-01-10 00:53:43,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 158 transitions, 751 flow [2025-01-10 00:53:43,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:53:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:53:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 614 transitions. [2025-01-10 00:53:43,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44883040935672514 [2025-01-10 00:53:43,454 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 274 flow. Second operand 9 states and 614 transitions. [2025-01-10 00:53:43,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 158 transitions, 751 flow [2025-01-10 00:53:43,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 158 transitions, 700 flow, removed 3 selfloop flow, removed 11 redundant places. [2025-01-10 00:53:43,461 INFO L231 Difference]: Finished difference. Result has 75 places, 0 transitions, 0 flow [2025-01-10 00:53:43,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=75, PETRI_TRANSITIONS=0} [2025-01-10 00:53:43,462 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -11 predicate places. [2025-01-10 00:53:43,462 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 0 transitions, 0 flow [2025-01-10 00:53:43,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 59.0) internal successors, (590), 10 states have internal predecessors, (590), 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-01-10 00:53:43,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2025-01-10 00:53:43,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (17 of 19 remaining) [2025-01-10 00:53:43,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (16 of 19 remaining) [2025-01-10 00:53:43,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (15 of 19 remaining) [2025-01-10 00:53:43,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2025-01-10 00:53:43,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2025-01-10 00:53:43,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (12 of 19 remaining) [2025-01-10 00:53:43,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 19 remaining) [2025-01-10 00:53:43,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONMEMORY_LEAK (10 of 19 remaining) [2025-01-10 00:53:43,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 19 remaining) [2025-01-10 00:53:43,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 19 remaining) [2025-01-10 00:53:43,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONMEMORY_LEAK (7 of 19 remaining) [2025-01-10 00:53:43,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 19 remaining) [2025-01-10 00:53:43,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 19 remaining) [2025-01-10 00:53:43,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONMEMORY_LEAK (4 of 19 remaining) [2025-01-10 00:53:43,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2025-01-10 00:53:43,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2025-01-10 00:53:43,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONMEMORY_LEAK (1 of 19 remaining) [2025-01-10 00:53:43,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 19 remaining) [2025-01-10 00:53:43,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:53:43,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:53:43,670 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:43,675 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:53:43,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:53:43,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:53:43 BasicIcfg [2025-01-10 00:53:43,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:53:43,680 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:53:43,680 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:53:43,681 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:53:43,681 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:28" (3/4) ... [2025-01-10 00:53:43,682 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:53:43,684 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_ath9k [2025-01-10 00:53:43,684 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_usb [2025-01-10 00:53:43,686 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2025-01-10 00:53:43,687 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-01-10 00:53:43,687 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 00:53:43,688 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 00:53:43,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:53:43,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:53:43,745 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:53:43,746 INFO L158 Benchmark]: Toolchain (without parser) took 16495.93ms. Allocated memory was 201.3MB in the beginning and 872.4MB in the end (delta: 671.1MB). Free memory was 154.5MB in the beginning and 717.3MB in the end (delta: -562.8MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. [2025-01-10 00:53:43,746 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 218.1MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:53:43,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 648.69ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 101.1MB in the end (delta: 53.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 00:53:43,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.48ms. Allocated memory is still 201.3MB. Free memory was 101.1MB in the beginning and 97.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:53:43,747 INFO L158 Benchmark]: Boogie Preprocessor took 67.85ms. Allocated memory is still 201.3MB. Free memory was 97.7MB in the beginning and 94.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:53:43,748 INFO L158 Benchmark]: RCFGBuilder took 660.31ms. Allocated memory is still 201.3MB. Free memory was 94.3MB in the beginning and 151.5MB in the end (delta: -57.2MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2025-01-10 00:53:43,748 INFO L158 Benchmark]: TraceAbstraction took 15009.24ms. Allocated memory was 201.3MB in the beginning and 872.4MB in the end (delta: 671.1MB). Free memory was 150.5MB in the beginning and 722.9MB in the end (delta: -572.4MB). Peak memory consumption was 512.5MB. Max. memory is 16.1GB. [2025-01-10 00:53:43,748 INFO L158 Benchmark]: Witness Printer took 64.88ms. Allocated memory is still 872.4MB. Free memory was 722.9MB in the beginning and 717.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:53:43,750 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.17ms. Allocated memory is still 218.1MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 648.69ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 101.1MB in the end (delta: 53.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.48ms. Allocated memory is still 201.3MB. Free memory was 101.1MB in the beginning and 97.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.85ms. Allocated memory is still 201.3MB. Free memory was 97.7MB in the beginning and 94.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 660.31ms. Allocated memory is still 201.3MB. Free memory was 94.3MB in the beginning and 151.5MB in the end (delta: -57.2MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15009.24ms. Allocated memory was 201.3MB in the beginning and 872.4MB in the end (delta: 671.1MB). Free memory was 150.5MB in the beginning and 722.9MB in the end (delta: -572.4MB). Peak memory consumption was 512.5MB. Max. memory is 16.1GB. * Witness Printer took 64.88ms. Allocated memory is still 872.4MB. Free memory was 722.9MB in the beginning and 717.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1691]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1691]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1691]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1795]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1691]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1691]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1691]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 133 locations, 19 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: 14.9s, OverallIterations: 19, TraceHistogramMax: 7, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 982 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4567 IncrementalHoareTripleChecker+Invalid, 4608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 25 mSDtfsCounter, 4567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 178 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=16, InterpolantAutomatonStates: 84, 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, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 783 ConstructedInterpolants, 95 QuantifiedInterpolants, 4946 SizeOfPredicates, 0 NumberOfNonLiveVariables, 861 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 58/67 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 - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 00:53:43,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Writing output log to file Ultimate.log Result: TRUE