./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:11:46,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:11:46,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:11:46,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:11:46,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:11:46,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:11:46,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:11:46,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:11:46,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:11:46,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:11:46,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:11:46,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:11:46,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:11:46,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:11:46,209 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:11:46,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:11:46,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:11:46,211 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:11:46,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:11:46,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:11:46,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:11:46,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:11:46,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:11:46,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:11:46,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:11:46,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:11:46,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:11:46,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:11:46,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:11:46,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:11:46,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:11:46,213 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2025-02-08 08:11:46,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:11:46,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:11:46,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:11:46,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:11:46,615 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:11:46,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-02-08 08:11:47,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2646dc27f/ce6fb8526dbb47e39b2309380bc61e13/FLAG1aecd83c5 [2025-02-08 08:11:48,194 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:11:48,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-02-08 08:11:48,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2646dc27f/ce6fb8526dbb47e39b2309380bc61e13/FLAG1aecd83c5 [2025-02-08 08:11:48,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2646dc27f/ce6fb8526dbb47e39b2309380bc61e13 [2025-02-08 08:11:48,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:11:48,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:11:48,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:11:48,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:11:48,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:11:48,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48, skipping insertion in model container [2025-02-08 08:11:48,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:11:48,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:11:48,772 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:11:48,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:11:48,851 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:11:48,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48 WrapperNode [2025-02-08 08:11:48,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:11:48,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:11:48,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:11:48,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:11:48,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,886 INFO L138 Inliner]: procedures = 170, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2025-02-08 08:11:48,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:11:48,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:11:48,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:11:48,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:11:48,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,906 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 5, 3]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-02-08 08:11:48,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:11:48,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:11:48,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:11:48,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:11:48,921 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (1/1) ... [2025-02-08 08:11:48,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:11:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:11:48,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:11:48,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:11:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:11:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:11:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:11:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 08:11:48,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:11:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:11:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:11:48,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:11:48,982 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:11:49,118 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:11:49,120 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:11:49,335 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc ~#casret~0#1.base, ~#casret~0#1.offset; [2025-02-08 08:11:49,336 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: SUMMARY for call ULTIMATE.dealloc(~#casret~0#1.base, ~#casret~0#1.offset); srcloc: null [2025-02-08 08:11:49,376 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:11:49,377 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:11:49,597 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:11:49,598 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:11:49,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:11:49 BoogieIcfgContainer [2025-02-08 08:11:49,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:11:49,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:11:49,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:11:49,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:11:49,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:11:48" (1/3) ... [2025-02-08 08:11:49,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271e5123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:11:49, skipping insertion in model container [2025-02-08 08:11:49,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:48" (2/3) ... [2025-02-08 08:11:49,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271e5123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:11:49, skipping insertion in model container [2025-02-08 08:11:49,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:11:49" (3/3) ... [2025-02-08 08:11:49,610 INFO L128 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2025-02-08 08:11:49,626 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:11:49,627 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02_inc_cas.i that has 2 procedures, 33 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-02-08 08:11:49,628 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:11:49,701 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:11:49,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 36 transitions, 76 flow [2025-02-08 08:11:49,776 INFO L124 PetriNetUnfolderBase]: 3/40 cut-off events. [2025-02-08 08:11:49,778 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:49,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 40 events. 3/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 119 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-02-08 08:11:49,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 36 transitions, 76 flow [2025-02-08 08:11:49,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 36 transitions, 76 flow [2025-02-08 08:11:49,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:11:49,808 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;@319cee31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:11:49,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-08 08:11:49,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:11:49,811 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:11:49,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:49,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:49,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:11:49,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 08:11:49,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash 230854, now seen corresponding path program 1 times [2025-02-08 08:11:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:49,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568105682] [2025-02-08 08:11:49,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:49,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:11:49,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:11:49,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:49,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:49,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:49,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568105682] [2025-02-08 08:11:49,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568105682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:49,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:49,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:49,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228833168] [2025-02-08 08:11:49,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:49,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:11:49,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:49,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:11:49,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:11:49,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-08 08:11:49,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 76 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:49,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:49,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-08 08:11:49,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:50,087 INFO L124 PetriNetUnfolderBase]: 42/119 cut-off events. [2025-02-08 08:11:50,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:50,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 119 events. 42/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 467 event pairs, 36 based on Foata normal form. 3/76 useless extension candidates. Maximal degree in co-relation 209. Up to 102 conditions per place. [2025-02-08 08:11:50,091 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 24 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2025-02-08 08:11:50,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 112 flow [2025-02-08 08:11:50,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:11:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:11:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2025-02-08 08:11:50,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-08 08:11:50,109 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 76 flow. Second operand 2 states and 42 transitions. [2025-02-08 08:11:50,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 112 flow [2025-02-08 08:11:50,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:50,116 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 64 flow [2025-02-08 08:11:50,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2025-02-08 08:11:50,122 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2025-02-08 08:11:50,124 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 64 flow [2025-02-08 08:11:50,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:50,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:50,125 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:11:50,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:11:50,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 08:11:50,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1710488964, now seen corresponding path program 1 times [2025-02-08 08:11:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:50,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928206086] [2025-02-08 08:11:50,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:50,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:50,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:50,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:50,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:50,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:11:50,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:50,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:50,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:50,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:50,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:11:50,194 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:11:50,196 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-02-08 08:11:50,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (26 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2025-02-08 08:11:50,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2025-02-08 08:11:50,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2025-02-08 08:11:50,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2025-02-08 08:11:50,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2025-02-08 08:11:50,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 32 remaining) [2025-02-08 08:11:50,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2025-02-08 08:11:50,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2025-02-08 08:11:50,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2025-02-08 08:11:50,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2025-02-08 08:11:50,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (10 of 32 remaining) [2025-02-08 08:11:50,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2025-02-08 08:11:50,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2025-02-08 08:11:50,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2025-02-08 08:11:50,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2025-02-08 08:11:50,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2025-02-08 08:11:50,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2025-02-08 08:11:50,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2025-02-08 08:11:50,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2025-02-08 08:11:50,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2025-02-08 08:11:50,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 32 remaining) [2025-02-08 08:11:50,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:11:50,205 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:11:50,208 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:11:50,208 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:11:50,278 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:11:50,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 65 transitions, 140 flow [2025-02-08 08:11:50,304 INFO L124 PetriNetUnfolderBase]: 6/74 cut-off events. [2025-02-08 08:11:50,304 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:11:50,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 74 events. 6/74 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 317 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 61. Up to 3 conditions per place. [2025-02-08 08:11:50,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 65 transitions, 140 flow [2025-02-08 08:11:50,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 65 transitions, 140 flow [2025-02-08 08:11:50,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:11:50,311 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;@319cee31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:11:50,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-02-08 08:11:50,314 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:11:50,314 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:11:50,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:50,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:50,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:11:50,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:11:50,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash 295399, now seen corresponding path program 1 times [2025-02-08 08:11:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734357454] [2025-02-08 08:11:50,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:50,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:11:50,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:11:50,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:50,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:50,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734357454] [2025-02-08 08:11:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734357454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293046752] [2025-02-08 08:11:50,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:50,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:11:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:50,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:11:50,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:11:50,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2025-02-08 08:11:50,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 140 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:50,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:50,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2025-02-08 08:11:50,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:50,973 INFO L124 PetriNetUnfolderBase]: 1980/3395 cut-off events. [2025-02-08 08:11:50,974 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-08 08:11:50,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6580 conditions, 3395 events. 1980/3395 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 21248 event pairs, 1746 based on Foata normal form. 117/1846 useless extension candidates. Maximal degree in co-relation 4959. Up to 3123 conditions per place. [2025-02-08 08:11:51,008 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 45 selfloop transitions, 0 changer transitions 0/56 dead transitions. [2025-02-08 08:11:51,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 212 flow [2025-02-08 08:11:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:11:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:11:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2025-02-08 08:11:51,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846153846153846 [2025-02-08 08:11:51,010 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 140 flow. Second operand 2 states and 76 transitions. [2025-02-08 08:11:51,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 212 flow [2025-02-08 08:11:51,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:51,015 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 122 flow [2025-02-08 08:11:51,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=122, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2025-02-08 08:11:51,016 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2025-02-08 08:11:51,016 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 122 flow [2025-02-08 08:11:51,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:51,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:51,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:11:51,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:11:51,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:11:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash 213315862, now seen corresponding path program 1 times [2025-02-08 08:11:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298769563] [2025-02-08 08:11:51,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:51,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:51,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:51,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:51,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:51,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:51,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298769563] [2025-02-08 08:11:51,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298769563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:51,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:51,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:51,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924560844] [2025-02-08 08:11:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:51,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:11:51,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:51,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:11:51,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:11:51,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2025-02-08 08:11:51,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:51,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:51,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2025-02-08 08:11:51,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:51,784 INFO L124 PetriNetUnfolderBase]: 1508/2718 cut-off events. [2025-02-08 08:11:51,784 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 08:11:51,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5201 conditions, 2718 events. 1508/2718 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 17218 event pairs, 1078 based on Foata normal form. 0/1523 useless extension candidates. Maximal degree in co-relation 5196. Up to 1893 conditions per place. [2025-02-08 08:11:51,806 INFO L140 encePairwiseOnDemand]: 38/65 looper letters, 91 selfloop transitions, 25 changer transitions 0/127 dead transitions. [2025-02-08 08:11:51,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 127 transitions, 501 flow [2025-02-08 08:11:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:11:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:11:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2025-02-08 08:11:51,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.676923076923077 [2025-02-08 08:11:51,809 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 122 flow. Second operand 4 states and 176 transitions. [2025-02-08 08:11:51,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 127 transitions, 501 flow [2025-02-08 08:11:51,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 127 transitions, 501 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:51,814 INFO L231 Difference]: Finished difference. Result has 64 places, 80 transitions, 334 flow [2025-02-08 08:11:51,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=334, PETRI_PLACES=64, PETRI_TRANSITIONS=80} [2025-02-08 08:11:51,815 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2025-02-08 08:11:51,817 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 80 transitions, 334 flow [2025-02-08 08:11:51,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:51,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:51,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:11:51,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:11:51,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:11:51,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:51,818 INFO L85 PathProgramCache]: Analyzing trace with hash 213315863, now seen corresponding path program 1 times [2025-02-08 08:11:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:51,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934224374] [2025-02-08 08:11:51,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:51,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:51,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:51,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:51,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:51,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:52,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:52,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934224374] [2025-02-08 08:11:52,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934224374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:52,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:52,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:52,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427249928] [2025-02-08 08:11:52,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:52,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:11:52,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:52,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:11:52,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:11:52,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2025-02-08 08:11:52,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 80 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:52,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:52,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2025-02-08 08:11:52,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:52,334 INFO L124 PetriNetUnfolderBase]: 1034/1907 cut-off events. [2025-02-08 08:11:52,334 INFO L125 PetriNetUnfolderBase]: For 249/264 co-relation queries the response was YES. [2025-02-08 08:11:52,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4740 conditions, 1907 events. 1034/1907 cut-off events. For 249/264 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 11287 event pairs, 682 based on Foata normal form. 266/1545 useless extension candidates. Maximal degree in co-relation 4732. Up to 1227 conditions per place. [2025-02-08 08:11:52,350 INFO L140 encePairwiseOnDemand]: 54/65 looper letters, 85 selfloop transitions, 5 changer transitions 0/101 dead transitions. [2025-02-08 08:11:52,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 593 flow [2025-02-08 08:11:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:11:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:11:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-02-08 08:11:52,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:11:52,356 INFO L175 Difference]: Start difference. First operand has 64 places, 80 transitions, 334 flow. Second operand 4 states and 130 transitions. [2025-02-08 08:11:52,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 593 flow [2025-02-08 08:11:52,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 593 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:52,367 INFO L231 Difference]: Finished difference. Result has 61 places, 74 transitions, 332 flow [2025-02-08 08:11:52,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=61, PETRI_TRANSITIONS=74} [2025-02-08 08:11:52,369 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2025-02-08 08:11:52,369 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 74 transitions, 332 flow [2025-02-08 08:11:52,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:52,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:52,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:11:52,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:11:52,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:11:52,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1161874655, now seen corresponding path program 1 times [2025-02-08 08:11:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:52,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691770302] [2025-02-08 08:11:52,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:52,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:52,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:11:52,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:11:52,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:52,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:52,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691770302] [2025-02-08 08:11:52,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691770302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:52,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061577969] [2025-02-08 08:11:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:52,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:11:52,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:52,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:11:52,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:11:52,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 65 [2025-02-08 08:11:52,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 74 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:52,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:52,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 65 [2025-02-08 08:11:52,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:52,794 INFO L124 PetriNetUnfolderBase]: 1001/1810 cut-off events. [2025-02-08 08:11:52,794 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2025-02-08 08:11:52,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4687 conditions, 1810 events. 1001/1810 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10594 event pairs, 134 based on Foata normal form. 0/1357 useless extension candidates. Maximal degree in co-relation 4678. Up to 1152 conditions per place. [2025-02-08 08:11:52,806 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 86 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2025-02-08 08:11:52,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 105 transitions, 653 flow [2025-02-08 08:11:52,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:11:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:11:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-02-08 08:11:52,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-02-08 08:11:52,808 INFO L175 Difference]: Start difference. First operand has 61 places, 74 transitions, 332 flow. Second operand 3 states and 105 transitions. [2025-02-08 08:11:52,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 105 transitions, 653 flow [2025-02-08 08:11:52,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:11:52,814 INFO L231 Difference]: Finished difference. Result has 63 places, 80 transitions, 416 flow [2025-02-08 08:11:52,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=63, PETRI_TRANSITIONS=80} [2025-02-08 08:11:52,815 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -1 predicate places. [2025-02-08 08:11:52,815 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 80 transitions, 416 flow [2025-02-08 08:11:52,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:52,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:52,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:11:52,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:11:52,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:11:52,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1161874656, now seen corresponding path program 1 times [2025-02-08 08:11:52,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:52,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832913749] [2025-02-08 08:11:52,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:52,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:11:52,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:11:52,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:52,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832913749] [2025-02-08 08:11:52,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832913749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:52,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:52,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:52,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067612340] [2025-02-08 08:11:52,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:52,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:11:52,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:52,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:11:52,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:11:52,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2025-02-08 08:11:52,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 80 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:52,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:52,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2025-02-08 08:11:52,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:53,155 INFO L124 PetriNetUnfolderBase]: 782/1449 cut-off events. [2025-02-08 08:11:53,155 INFO L125 PetriNetUnfolderBase]: For 919/919 co-relation queries the response was YES. [2025-02-08 08:11:53,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 1449 events. 782/1449 cut-off events. For 919/919 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8078 event pairs, 96 based on Foata normal form. 90/1245 useless extension candidates. Maximal degree in co-relation 4205. Up to 950 conditions per place. [2025-02-08 08:11:53,166 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 70 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2025-02-08 08:11:53,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 90 transitions, 603 flow [2025-02-08 08:11:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:11:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:11:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-02-08 08:11:53,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-02-08 08:11:53,167 INFO L175 Difference]: Start difference. First operand has 63 places, 80 transitions, 416 flow. Second operand 3 states and 90 transitions. [2025-02-08 08:11:53,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 90 transitions, 603 flow [2025-02-08 08:11:53,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 583 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:11:53,175 INFO L231 Difference]: Finished difference. Result has 60 places, 75 transitions, 392 flow [2025-02-08 08:11:53,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=60, PETRI_TRANSITIONS=75} [2025-02-08 08:11:53,176 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -4 predicate places. [2025-02-08 08:11:53,176 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 75 transitions, 392 flow [2025-02-08 08:11:53,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:53,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:53,177 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 08:11:53,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:11:53,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:11:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1265851584, now seen corresponding path program 1 times [2025-02-08 08:11:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493053176] [2025-02-08 08:11:53,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:53,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:11:53,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:11:53,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:53,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:53,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:11:53,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:11:53,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:11:53,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:53,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:53,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:11:53,198 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:11:53,198 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 47 remaining) [2025-02-08 08:11:53,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 47 remaining) [2025-02-08 08:11:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 47 remaining) [2025-02-08 08:11:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 47 remaining) [2025-02-08 08:11:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 47 remaining) [2025-02-08 08:11:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (41 of 47 remaining) [2025-02-08 08:11:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 47 remaining) [2025-02-08 08:11:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 47 remaining) [2025-02-08 08:11:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 47 remaining) [2025-02-08 08:11:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 47 remaining) [2025-02-08 08:11:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 47 remaining) [2025-02-08 08:11:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 47 remaining) [2025-02-08 08:11:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 47 remaining) [2025-02-08 08:11:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 47 remaining) [2025-02-08 08:11:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 47 remaining) [2025-02-08 08:11:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 47 remaining) [2025-02-08 08:11:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (30 of 47 remaining) [2025-02-08 08:11:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 47 remaining) [2025-02-08 08:11:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 47 remaining) [2025-02-08 08:11:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 47 remaining) [2025-02-08 08:11:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 47 remaining) [2025-02-08 08:11:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (25 of 47 remaining) [2025-02-08 08:11:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 47 remaining) [2025-02-08 08:11:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 47 remaining) [2025-02-08 08:11:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 47 remaining) [2025-02-08 08:11:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 47 remaining) [2025-02-08 08:11:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 47 remaining) [2025-02-08 08:11:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 47 remaining) [2025-02-08 08:11:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 47 remaining) [2025-02-08 08:11:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 47 remaining) [2025-02-08 08:11:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 47 remaining) [2025-02-08 08:11:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 47 remaining) [2025-02-08 08:11:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 47 remaining) [2025-02-08 08:11:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 47 remaining) [2025-02-08 08:11:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 47 remaining) [2025-02-08 08:11:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 47 remaining) [2025-02-08 08:11:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (10 of 47 remaining) [2025-02-08 08:11:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 47 remaining) [2025-02-08 08:11:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 47 remaining) [2025-02-08 08:11:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 47 remaining) [2025-02-08 08:11:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 47 remaining) [2025-02-08 08:11:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 47 remaining) [2025-02-08 08:11:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 47 remaining) [2025-02-08 08:11:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 47 remaining) [2025-02-08 08:11:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 47 remaining) [2025-02-08 08:11:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 47 remaining) [2025-02-08 08:11:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 47 remaining) [2025-02-08 08:11:53,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:11:53,204 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 08:11:53,205 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:11:53,205 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:11:53,278 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:11:53,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 94 transitions, 206 flow [2025-02-08 08:11:53,291 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2025-02-08 08:11:53,292 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:11:53,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 9/108 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 504 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 89. Up to 4 conditions per place. [2025-02-08 08:11:53,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 94 transitions, 206 flow [2025-02-08 08:11:53,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 94 transitions, 206 flow [2025-02-08 08:11:53,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:11:53,297 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;@319cee31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:11:53,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-02-08 08:11:53,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:11:53,299 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:11:53,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:53,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:53,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:11:53,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-02-08 08:11:53,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:53,300 INFO L85 PathProgramCache]: Analyzing trace with hash 388741, now seen corresponding path program 1 times [2025-02-08 08:11:53,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:53,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085670] [2025-02-08 08:11:53,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:53,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:53,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:11:53,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:11:53,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:53,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085670] [2025-02-08 08:11:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:53,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:53,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586046916] [2025-02-08 08:11:53,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:53,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:11:53,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:53,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:11:53,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:11:53,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 94 [2025-02-08 08:11:53,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 206 flow. Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:53,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:53,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 94 [2025-02-08 08:11:53,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:58,978 INFO L124 PetriNetUnfolderBase]: 60462/87069 cut-off events. [2025-02-08 08:11:58,978 INFO L125 PetriNetUnfolderBase]: For 2423/2423 co-relation queries the response was YES. [2025-02-08 08:11:59,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170758 conditions, 87069 events. 60462/87069 cut-off events. For 2423/2423 co-relation queries the response was YES. Maximal size of possible extension queue 3953. Compared 647386 event pairs, 53730 based on Foata normal form. 3366/43989 useless extension candidates. Maximal degree in co-relation 33093. Up to 82182 conditions per place. [2025-02-08 08:11:59,508 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 66 selfloop transitions, 0 changer transitions 0/82 dead transitions. [2025-02-08 08:11:59,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 314 flow [2025-02-08 08:11:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:11:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:11:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2025-02-08 08:11:59,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5851063829787234 [2025-02-08 08:11:59,510 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 206 flow. Second operand 2 states and 110 transitions. [2025-02-08 08:11:59,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 314 flow [2025-02-08 08:11:59,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 82 transitions, 312 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:59,515 INFO L231 Difference]: Finished difference. Result has 84 places, 82 transitions, 180 flow [2025-02-08 08:11:59,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=84, PETRI_TRANSITIONS=82} [2025-02-08 08:11:59,517 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -8 predicate places. [2025-02-08 08:11:59,517 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 180 flow [2025-02-08 08:11:59,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:59,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:59,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:11:59,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:11:59,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-02-08 08:11:59,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1299972422, now seen corresponding path program 1 times [2025-02-08 08:11:59,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:59,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-02-08 08:11:59,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:59,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:59,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:59,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:59,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:59,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:59,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-02-08 08:11:59,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825343523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:59,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:59,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120108746] [2025-02-08 08:11:59,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:59,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:11:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:59,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:11:59,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:11:59,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 94 [2025-02-08 08:11:59,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:11:59,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:59,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 94 [2025-02-08 08:11:59,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:03,412 INFO L124 PetriNetUnfolderBase]: 43095/65562 cut-off events. [2025-02-08 08:12:03,412 INFO L125 PetriNetUnfolderBase]: For 1046/1046 co-relation queries the response was YES. [2025-02-08 08:12:03,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126607 conditions, 65562 events. 43095/65562 cut-off events. For 1046/1046 co-relation queries the response was YES. Maximal size of possible extension queue 3275. Compared 520062 event pairs, 26389 based on Foata normal form. 0/34447 useless extension candidates. Maximal degree in co-relation 126601. Up to 39243 conditions per place. [2025-02-08 08:12:03,840 INFO L140 encePairwiseOnDemand]: 54/94 looper letters, 138 selfloop transitions, 37 changer transitions 0/191 dead transitions. [2025-02-08 08:12:03,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 191 transitions, 763 flow [2025-02-08 08:12:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:12:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:12:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2025-02-08 08:12:03,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6941489361702128 [2025-02-08 08:12:03,842 INFO L175 Difference]: Start difference. First operand has 84 places, 82 transitions, 180 flow. Second operand 4 states and 261 transitions. [2025-02-08 08:12:03,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 191 transitions, 763 flow [2025-02-08 08:12:03,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 191 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:03,849 INFO L231 Difference]: Finished difference. Result has 90 places, 118 transitions, 496 flow [2025-02-08 08:12:03,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=496, PETRI_PLACES=90, PETRI_TRANSITIONS=118} [2025-02-08 08:12:03,851 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -2 predicate places. [2025-02-08 08:12:03,852 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 118 transitions, 496 flow [2025-02-08 08:12:03,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:03,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:03,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:12:03,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:12:03,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-02-08 08:12:03,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:03,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1299972421, now seen corresponding path program 1 times [2025-02-08 08:12:03,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:03,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150333911] [2025-02-08 08:12:03,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:03,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:03,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:12:03,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:12:03,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:03,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:03,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-02-08 08:12:03,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:03,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150333911] [2025-02-08 08:12:03,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150333911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:03,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:03,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:12:03,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314853373] [2025-02-08 08:12:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:03,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:12:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:03,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:12:03,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:12:03,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 94 [2025-02-08 08:12:03,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 118 transitions, 496 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:03,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:03,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 94 [2025-02-08 08:12:03,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:06,408 INFO L124 PetriNetUnfolderBase]: 24834/38469 cut-off events. [2025-02-08 08:12:06,408 INFO L125 PetriNetUnfolderBase]: For 6288/6453 co-relation queries the response was YES. [2025-02-08 08:12:06,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100617 conditions, 38469 events. 24834/38469 cut-off events. For 6288/6453 co-relation queries the response was YES. Maximal size of possible extension queue 1929. Compared 290571 event pairs, 18336 based on Foata normal form. 5753/30982 useless extension candidates. Maximal degree in co-relation 100608. Up to 34793 conditions per place. [2025-02-08 08:12:06,581 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 92 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2025-02-08 08:12:06,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 109 transitions, 664 flow [2025-02-08 08:12:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-02-08 08:12:06,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4148936170212766 [2025-02-08 08:12:06,582 INFO L175 Difference]: Start difference. First operand has 90 places, 118 transitions, 496 flow. Second operand 3 states and 117 transitions. [2025-02-08 08:12:06,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 109 transitions, 664 flow [2025-02-08 08:12:06,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 109 transitions, 664 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:06,598 INFO L231 Difference]: Finished difference. Result has 83 places, 109 transitions, 480 flow [2025-02-08 08:12:06,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=83, PETRI_TRANSITIONS=109} [2025-02-08 08:12:06,599 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -9 predicate places. [2025-02-08 08:12:06,599 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 109 transitions, 480 flow [2025-02-08 08:12:06,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:06,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:06,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:06,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:12:06,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-02-08 08:12:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash 562000771, now seen corresponding path program 1 times [2025-02-08 08:12:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:06,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156848148] [2025-02-08 08:12:06,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:06,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:12:06,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:12:06,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:06,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:06,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:06,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156848148] [2025-02-08 08:12:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156848148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:06,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:06,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:12:06,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014176044] [2025-02-08 08:12:06,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:06,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:06,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:06,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:06,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:06,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 94 [2025-02-08 08:12:06,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 109 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:06,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:06,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 94 [2025-02-08 08:12:06,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:09,766 INFO L124 PetriNetUnfolderBase]: 26571/41173 cut-off events. [2025-02-08 08:12:09,767 INFO L125 PetriNetUnfolderBase]: For 7915/7930 co-relation queries the response was YES. [2025-02-08 08:12:09,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107922 conditions, 41173 events. 26571/41173 cut-off events. For 7915/7930 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 312421 event pairs, 11459 based on Foata normal form. 0/28237 useless extension candidates. Maximal degree in co-relation 107912. Up to 21964 conditions per place. [2025-02-08 08:12:10,062 INFO L140 encePairwiseOnDemand]: 82/94 looper letters, 154 selfloop transitions, 20 changer transitions 0/188 dead transitions. [2025-02-08 08:12:10,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 188 transitions, 1196 flow [2025-02-08 08:12:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2025-02-08 08:12:10,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5638297872340425 [2025-02-08 08:12:10,063 INFO L175 Difference]: Start difference. First operand has 83 places, 109 transitions, 480 flow. Second operand 3 states and 159 transitions. [2025-02-08 08:12:10,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 188 transitions, 1196 flow [2025-02-08 08:12:10,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 188 transitions, 1195 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:10,083 INFO L231 Difference]: Finished difference. Result has 86 places, 125 transitions, 679 flow [2025-02-08 08:12:10,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=86, PETRI_TRANSITIONS=125} [2025-02-08 08:12:10,086 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -6 predicate places. [2025-02-08 08:12:10,086 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 125 transitions, 679 flow [2025-02-08 08:12:10,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:10,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:10,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:10,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:12:10,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-02-08 08:12:10,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash 562000772, now seen corresponding path program 1 times [2025-02-08 08:12:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:10,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316769066] [2025-02-08 08:12:10,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:10,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:12:10,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:12:10,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:10,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:10,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316769066] [2025-02-08 08:12:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316769066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:10,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:10,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:12:10,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061487854] [2025-02-08 08:12:10,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:10,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:10,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:10,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:10,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 94 [2025-02-08 08:12:10,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 125 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:10,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:10,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 94 [2025-02-08 08:12:10,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:12,736 INFO L124 PetriNetUnfolderBase]: 21181/33222 cut-off events. [2025-02-08 08:12:12,737 INFO L125 PetriNetUnfolderBase]: For 21053/21074 co-relation queries the response was YES. [2025-02-08 08:12:12,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96409 conditions, 33222 events. 21181/33222 cut-off events. For 21053/21074 co-relation queries the response was YES. Maximal size of possible extension queue 1530. Compared 254887 event pairs, 3124 based on Foata normal form. 1398/26094 useless extension candidates. Maximal degree in co-relation 96398. Up to 22665 conditions per place. [2025-02-08 08:12:13,060 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 153 selfloop transitions, 9 changer transitions 0/178 dead transitions. [2025-02-08 08:12:13,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 178 transitions, 1267 flow [2025-02-08 08:12:13,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-02-08 08:12:13,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2025-02-08 08:12:13,062 INFO L175 Difference]: Start difference. First operand has 86 places, 125 transitions, 679 flow. Second operand 3 states and 144 transitions. [2025-02-08 08:12:13,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 178 transitions, 1267 flow [2025-02-08 08:12:13,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 178 transitions, 1227 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:12:13,126 INFO L231 Difference]: Finished difference. Result has 83 places, 120 transitions, 635 flow [2025-02-08 08:12:13,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=83, PETRI_TRANSITIONS=120} [2025-02-08 08:12:13,126 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -9 predicate places. [2025-02-08 08:12:13,127 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 120 transitions, 635 flow [2025-02-08 08:12:13,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:13,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:13,127 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:13,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:12:13,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-02-08 08:12:13,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1365764675, now seen corresponding path program 1 times [2025-02-08 08:12:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:13,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419300998] [2025-02-08 08:12:13,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:13,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:12:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:13,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:13,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:13,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419300998] [2025-02-08 08:12:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419300998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:12:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875934197] [2025-02-08 08:12:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:13,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:13,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:13,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:13,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 94 [2025-02-08 08:12:13,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 120 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:13,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:13,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 94 [2025-02-08 08:12:13,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:15,931 INFO L124 PetriNetUnfolderBase]: 23833/37039 cut-off events. [2025-02-08 08:12:15,931 INFO L125 PetriNetUnfolderBase]: For 22602/22608 co-relation queries the response was YES. [2025-02-08 08:12:16,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106178 conditions, 37039 events. 23833/37039 cut-off events. For 22602/22608 co-relation queries the response was YES. Maximal size of possible extension queue 1698. Compared 282919 event pairs, 5192 based on Foata normal form. 0/27766 useless extension candidates. Maximal degree in co-relation 106167. Up to 17258 conditions per place. [2025-02-08 08:12:16,393 INFO L140 encePairwiseOnDemand]: 82/94 looper letters, 159 selfloop transitions, 28 changer transitions 0/201 dead transitions. [2025-02-08 08:12:16,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 201 transitions, 1456 flow [2025-02-08 08:12:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2025-02-08 08:12:16,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2025-02-08 08:12:16,394 INFO L175 Difference]: Start difference. First operand has 83 places, 120 transitions, 635 flow. Second operand 3 states and 154 transitions. [2025-02-08 08:12:16,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 201 transitions, 1456 flow [2025-02-08 08:12:16,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 201 transitions, 1420 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:12:16,492 INFO L231 Difference]: Finished difference. Result has 85 places, 142 transitions, 933 flow [2025-02-08 08:12:16,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=85, PETRI_TRANSITIONS=142} [2025-02-08 08:12:16,492 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -7 predicate places. [2025-02-08 08:12:16,492 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 142 transitions, 933 flow [2025-02-08 08:12:16,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:16,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:16,493 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:16,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:12:16,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-02-08 08:12:16,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1365764674, now seen corresponding path program 1 times [2025-02-08 08:12:16,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:16,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146613893] [2025-02-08 08:12:16,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:16,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:12:16,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:16,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:16,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:16,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:16,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146613893] [2025-02-08 08:12:16,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146613893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:16,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:16,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:12:16,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151460879] [2025-02-08 08:12:16,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:16,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:16,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:16,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:16,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:16,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 94 [2025-02-08 08:12:16,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 142 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:16,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:16,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 94 [2025-02-08 08:12:16,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:19,098 INFO L124 PetriNetUnfolderBase]: 19443/30581 cut-off events. [2025-02-08 08:12:19,098 INFO L125 PetriNetUnfolderBase]: For 31291/31303 co-relation queries the response was YES. [2025-02-08 08:12:19,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94464 conditions, 30581 events. 19443/30581 cut-off events. For 31291/31303 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 228762 event pairs, 4739 based on Foata normal form. 1155/24662 useless extension candidates. Maximal degree in co-relation 94452. Up to 19666 conditions per place. [2025-02-08 08:12:19,281 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 160 selfloop transitions, 17 changer transitions 0/193 dead transitions. [2025-02-08 08:12:19,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 193 transitions, 1572 flow [2025-02-08 08:12:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-02-08 08:12:19,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4929078014184397 [2025-02-08 08:12:19,282 INFO L175 Difference]: Start difference. First operand has 85 places, 142 transitions, 933 flow. Second operand 3 states and 139 transitions. [2025-02-08 08:12:19,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 193 transitions, 1572 flow [2025-02-08 08:12:19,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 193 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:12:19,320 INFO L231 Difference]: Finished difference. Result has 82 places, 137 transitions, 889 flow [2025-02-08 08:12:19,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=889, PETRI_PLACES=82, PETRI_TRANSITIONS=137} [2025-02-08 08:12:19,321 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -10 predicate places. [2025-02-08 08:12:19,321 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 137 transitions, 889 flow [2025-02-08 08:12:19,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:19,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:19,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:19,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:12:19,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-02-08 08:12:19,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash 782992337, now seen corresponding path program 1 times [2025-02-08 08:12:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-02-08 08:12:19,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:19,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:12:19,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:19,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:19,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:19,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:19,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-02-08 08:12:19,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56326566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:19,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:19,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:12:19,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193086714] [2025-02-08 08:12:19,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:19,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:12:19,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:19,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:12:19,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:12:19,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 94 [2025-02-08 08:12:19,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 137 transitions, 889 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:19,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:19,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 94 [2025-02-08 08:12:19,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand