./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-551b009-m [2025-01-10 00:38:47,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:38:47,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:38:47,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:38:47,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:38:47,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:38:47,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:38:47,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:38:47,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:38:47,125 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:38:47,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:38:47,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:38:47,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:38:47,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:38:47,126 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:38:47,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:38:47,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:38:47,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:38:47,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:38:47,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:38:47,127 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:38:47,127 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:38:47,127 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:38:47,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:47,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:47,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:47,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:38:47,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:38:47,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:38:47,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:38:47,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:38:47,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:38:47,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:38:47,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:38:47,129 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-01-10 00:38:47,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:38:47,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:38:47,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:38:47,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:38:47,381 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:38:47,383 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-01-10 00:38:48,489 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/376503950/d509ac70d8794f6faab46ab3281c0a8d/FLAGcb1264e68 [2025-01-10 00:38:48,770 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:38:48,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-01-10 00:38:48,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/376503950/d509ac70d8794f6faab46ab3281c0a8d/FLAGcb1264e68 [2025-01-10 00:38:48,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/376503950/d509ac70d8794f6faab46ab3281c0a8d [2025-01-10 00:38:48,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:38:48,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:38:48,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:48,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:38:48,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:38:48,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:48" (1/1) ... [2025-01-10 00:38:48,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4fab0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:48, skipping insertion in model container [2025-01-10 00:38:48,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:48" (1/1) ... [2025-01-10 00:38:48,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:38:49,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:49,098 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:38:49,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:49,165 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:38:49,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49 WrapperNode [2025-01-10 00:38:49,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:49,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:49,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:38:49,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:38:49,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,199 INFO L138 Inliner]: procedures = 170, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2025-01-10 00:38:49,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:49,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:38:49,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:38:49,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:38:49,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,221 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-01-10 00:38:49,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:38:49,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:38:49,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:38:49,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:38:49,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (1/1) ... [2025-01-10 00:38:49,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:49,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:49,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:38:49,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:38:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:38:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:38:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:38:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:38:49,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:38:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:38:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:38:49,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:38:49,286 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:38:49,381 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:38:49,383 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:38:49,550 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:38:49,550 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:38:49,716 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:38:49,717 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 00:38:49,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:49 BoogieIcfgContainer [2025-01-10 00:38:49,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:38:49,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:38:49,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:38:49,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:38:49,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:38:48" (1/3) ... [2025-01-10 00:38:49,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f174f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:49, skipping insertion in model container [2025-01-10 00:38:49,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:49" (2/3) ... [2025-01-10 00:38:49,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f174f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:49, skipping insertion in model container [2025-01-10 00:38:49,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:49" (3/3) ... [2025-01-10 00:38:49,725 INFO L128 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2025-01-10 00:38:49,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:38:49,736 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02_inc_cas.i that has 2 procedures, 32 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-01-10 00:38:49,737 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:38:49,807 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:38:49,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 35 transitions, 74 flow [2025-01-10 00:38:49,873 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-01-10 00:38:49,876 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:49,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 39 events. 3/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 138 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-01-10 00:38:49,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 35 transitions, 74 flow [2025-01-10 00:38:49,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 35 transitions, 74 flow [2025-01-10 00:38:49,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:49,896 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;@fe7d065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:49,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-01-10 00:38:49,900 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:49,902 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:38:49,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:49,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:49,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:38:49,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-01-10 00:38:49,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash 274037, now seen corresponding path program 1 times [2025-01-10 00:38:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:49,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573219086] [2025-01-10 00:38:49,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:49,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:38:49,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:38:49,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:49,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:50,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573219086] [2025-01-10 00:38:50,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573219086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:50,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:50,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253787589] [2025-01-10 00:38:50,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:50,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:38:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:50,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:38:50,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:38:50,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-01-10 00:38:50,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:50,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:50,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-01-10 00:38:50,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:50,130 INFO L124 PetriNetUnfolderBase]: 42/114 cut-off events. [2025-01-10 00:38:50,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:50,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 114 events. 42/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 407 event pairs, 36 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 208. Up to 102 conditions per place. [2025-01-10 00:38:50,133 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 24 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2025-01-10 00:38:50,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 110 flow [2025-01-10 00:38:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:38:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:38:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2025-01-10 00:38:50,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 00:38:50,147 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 74 flow. Second operand 2 states and 40 transitions. [2025-01-10 00:38:50,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 110 flow [2025-01-10 00:38:50,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:50,153 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 62 flow [2025-01-10 00:38:50,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-01-10 00:38:50,160 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2025-01-10 00:38:50,161 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 62 flow [2025-01-10 00:38:50,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:50,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:50,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:38:50,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:38:50,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-01-10 00:38:50,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash 263417078, now seen corresponding path program 1 times [2025-01-10 00:38:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:50,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121211596] [2025-01-10 00:38:50,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:50,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:50,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:38:50,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:38:50,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:50,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:50,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:50,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121211596] [2025-01-10 00:38:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121211596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:50,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:50,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059913555] [2025-01-10 00:38:50,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:50,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:38:50,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:50,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:38:50,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:38:50,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-01-10 00:38:50,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:50,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:50,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-01-10 00:38:50,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:50,405 INFO L124 PetriNetUnfolderBase]: 36/99 cut-off events. [2025-01-10 00:38:50,406 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:50,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 99 events. 36/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 345 event pairs, 30 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 187. Up to 86 conditions per place. [2025-01-10 00:38:50,409 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 20 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-01-10 00:38:50,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 98 flow [2025-01-10 00:38:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-01-10 00:38:50,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-01-10 00:38:50,411 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 62 flow. Second operand 3 states and 42 transitions. [2025-01-10 00:38:50,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 98 flow [2025-01-10 00:38:50,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 98 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:50,413 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 58 flow [2025-01-10 00:38:50,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2025-01-10 00:38:50,414 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-01-10 00:38:50,414 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 58 flow [2025-01-10 00:38:50,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:50,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:50,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:38:50,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:38:50,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-01-10 00:38:50,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash 263417077, now seen corresponding path program 1 times [2025-01-10 00:38:50,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:50,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558229707] [2025-01-10 00:38:50,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:50,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:38:50,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:38:50,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:50,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558229707] [2025-01-10 00:38:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558229707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:50,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:50,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364595068] [2025-01-10 00:38:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:50,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:38:50,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:50,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:38:50,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:38:50,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-01-10 00:38:50,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:50,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:50,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-01-10 00:38:50,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:50,592 INFO L124 PetriNetUnfolderBase]: 30/84 cut-off events. [2025-01-10 00:38:50,592 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:50,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 84 events. 30/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 271 event pairs, 22 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 158. Up to 63 conditions per place. [2025-01-10 00:38:50,593 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 17 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2025-01-10 00:38:50,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 96 flow [2025-01-10 00:38:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-01-10 00:38:50,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2025-01-10 00:38:50,594 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 58 flow. Second operand 3 states and 41 transitions. [2025-01-10 00:38:50,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 96 flow [2025-01-10 00:38:50,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 95 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:50,595 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 57 flow [2025-01-10 00:38:50,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2025-01-10 00:38:50,596 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -7 predicate places. [2025-01-10 00:38:50,596 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 57 flow [2025-01-10 00:38:50,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:50,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:50,596 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 00:38:50,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:38:50,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-01-10 00:38:50,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:50,597 INFO L85 PathProgramCache]: Analyzing trace with hash -424017547, now seen corresponding path program 1 times [2025-01-10 00:38:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:50,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504026129] [2025-01-10 00:38:50,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:50,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:38:50,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:38:50,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:50,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:38:50,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:38:50,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:38:50,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:38:50,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:50,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:38:50,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:38:50,618 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:38:50,618 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-01-10 00:38:50,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2025-01-10 00:38:50,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2025-01-10 00:38:50,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2025-01-10 00:38:50,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2025-01-10 00:38:50,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (26 of 32 remaining) [2025-01-10 00:38:50,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2025-01-10 00:38:50,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2025-01-10 00:38:50,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2025-01-10 00:38:50,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2025-01-10 00:38:50,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (10 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2025-01-10 00:38:50,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 32 remaining) [2025-01-10 00:38:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:38:50,622 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:38:50,624 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:38:50,624 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:38:50,688 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:38:50,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 63 transitions, 136 flow [2025-01-10 00:38:50,699 INFO L124 PetriNetUnfolderBase]: 6/72 cut-off events. [2025-01-10 00:38:50,699 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:38:50,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 72 events. 6/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 314 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 59. Up to 3 conditions per place. [2025-01-10 00:38:50,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 63 transitions, 136 flow [2025-01-10 00:38:50,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 63 transitions, 136 flow [2025-01-10 00:38:50,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:50,702 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;@fe7d065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:50,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-01-10 00:38:50,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:50,703 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:38:50,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:50,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:50,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:38:50,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:38:50,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash 336596, now seen corresponding path program 1 times [2025-01-10 00:38:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335725904] [2025-01-10 00:38:50,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:50,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:38:50,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:38:50,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:50,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:50,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:50,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335725904] [2025-01-10 00:38:50,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335725904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:50,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:50,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:50,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863242080] [2025-01-10 00:38:50,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:50,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:38:50,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:50,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:38:50,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:38:50,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2025-01-10 00:38:50,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 136 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:50,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:50,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2025-01-10 00:38:50,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:51,101 INFO L124 PetriNetUnfolderBase]: 1980/3340 cut-off events. [2025-01-10 00:38:51,101 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-10 00:38:51,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6525 conditions, 3340 events. 1980/3340 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 19326 event pairs, 1746 based on Foata normal form. 0/1690 useless extension candidates. Maximal degree in co-relation 4917. Up to 3123 conditions per place. [2025-01-10 00:38:51,132 INFO L140 encePairwiseOnDemand]: 56/63 looper letters, 45 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2025-01-10 00:38:51,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 208 flow [2025-01-10 00:38:51,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:38:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:38:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2025-01-10 00:38:51,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 00:38:51,134 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 136 flow. Second operand 2 states and 72 transitions. [2025-01-10 00:38:51,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 208 flow [2025-01-10 00:38:51,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:51,138 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 118 flow [2025-01-10 00:38:51,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2025-01-10 00:38:51,139 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 00:38:51,139 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 118 flow [2025-01-10 00:38:51,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:51,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:51,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:38:51,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:38:51,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:38:51,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash 323565103, now seen corresponding path program 1 times [2025-01-10 00:38:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:51,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836660251] [2025-01-10 00:38:51,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:51,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:38:51,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:38:51,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:51,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:51,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836660251] [2025-01-10 00:38:51,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836660251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:51,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:51,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:51,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811051690] [2025-01-10 00:38:51,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:51,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:38:51,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:51,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:38:51,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:38:51,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2025-01-10 00:38:51,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:51,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:51,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2025-01-10 00:38:51,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:51,638 INFO L124 PetriNetUnfolderBase]: 1508/2681 cut-off events. [2025-01-10 00:38:51,638 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-10 00:38:51,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5164 conditions, 2681 events. 1508/2681 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 16227 event pairs, 1078 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 5159. Up to 1893 conditions per place. [2025-01-10 00:38:51,656 INFO L140 encePairwiseOnDemand]: 36/63 looper letters, 91 selfloop transitions, 25 changer transitions 0/125 dead transitions. [2025-01-10 00:38:51,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 125 transitions, 497 flow [2025-01-10 00:38:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:38:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:38:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2025-01-10 00:38:51,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 00:38:51,659 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 118 flow. Second operand 4 states and 168 transitions. [2025-01-10 00:38:51,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 125 transitions, 497 flow [2025-01-10 00:38:51,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 125 transitions, 497 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:51,663 INFO L231 Difference]: Finished difference. Result has 62 places, 78 transitions, 330 flow [2025-01-10 00:38:51,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=62, PETRI_TRANSITIONS=78} [2025-01-10 00:38:51,665 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2025-01-10 00:38:51,665 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 330 flow [2025-01-10 00:38:51,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:51,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:51,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:38:51,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:38:51,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:38:51,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:51,666 INFO L85 PathProgramCache]: Analyzing trace with hash 323565104, now seen corresponding path program 1 times [2025-01-10 00:38:51,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:51,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851102376] [2025-01-10 00:38:51,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:51,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:51,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:38:51,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:38:51,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:51,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:51,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851102376] [2025-01-10 00:38:51,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851102376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:51,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:51,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872809237] [2025-01-10 00:38:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:51,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:38:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:51,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:38:51,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:38:51,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2025-01-10 00:38:51,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:51,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:51,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2025-01-10 00:38:51,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:52,012 INFO L124 PetriNetUnfolderBase]: 1034/1882 cut-off events. [2025-01-10 00:38:52,012 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-01-10 00:38:52,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 1882 events. 1034/1882 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 10896 event pairs, 682 based on Foata normal form. 261/1522 useless extension candidates. Maximal degree in co-relation 4707. Up to 1227 conditions per place. [2025-01-10 00:38:52,023 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 85 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-01-10 00:38:52,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 589 flow [2025-01-10 00:38:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:38:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:38:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-01-10 00:38:52,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2025-01-10 00:38:52,025 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 330 flow. Second operand 4 states and 122 transitions. [2025-01-10 00:38:52,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 589 flow [2025-01-10 00:38:52,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 589 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:52,030 INFO L231 Difference]: Finished difference. Result has 59 places, 72 transitions, 328 flow [2025-01-10 00:38:52,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=59, PETRI_TRANSITIONS=72} [2025-01-10 00:38:52,031 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-01-10 00:38:52,031 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 72 transitions, 328 flow [2025-01-10 00:38:52,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:52,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:52,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:52,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:38:52,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:38:52,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:52,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1708431707, now seen corresponding path program 1 times [2025-01-10 00:38:52,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:52,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027339362] [2025-01-10 00:38:52,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:52,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:38:52,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:38:52,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:52,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:52,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027339362] [2025-01-10 00:38:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027339362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:52,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:52,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37648094] [2025-01-10 00:38:52,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:52,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:52,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:52,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:52,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2025-01-10 00:38:52,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 72 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:52,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:52,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2025-01-10 00:38:52,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:52,335 INFO L124 PetriNetUnfolderBase]: 888/1592 cut-off events. [2025-01-10 00:38:52,336 INFO L125 PetriNetUnfolderBase]: For 394/394 co-relation queries the response was YES. [2025-01-10 00:38:52,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4155 conditions, 1592 events. 888/1592 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9032 event pairs, 96 based on Foata normal form. 45/1187 useless extension candidates. Maximal degree in co-relation 4146. Up to 1119 conditions per place. [2025-01-10 00:38:52,345 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 69 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-01-10 00:38:52,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 525 flow [2025-01-10 00:38:52,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-01-10 00:38:52,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-01-10 00:38:52,347 INFO L175 Difference]: Start difference. First operand has 59 places, 72 transitions, 328 flow. Second operand 3 states and 84 transitions. [2025-01-10 00:38:52,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 525 flow [2025-01-10 00:38:52,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:52,356 INFO L231 Difference]: Finished difference. Result has 56 places, 67 transitions, 314 flow [2025-01-10 00:38:52,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=56, PETRI_TRANSITIONS=67} [2025-01-10 00:38:52,357 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 00:38:52,357 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 67 transitions, 314 flow [2025-01-10 00:38:52,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:52,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:52,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:52,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:38:52,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:38:52,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1708431704, now seen corresponding path program 1 times [2025-01-10 00:38:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26209763] [2025-01-10 00:38:52,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:52,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:38:52,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:38:52,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:52,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:52,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:52,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26209763] [2025-01-10 00:38:52,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26209763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:52,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:52,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:52,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170637483] [2025-01-10 00:38:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:52,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:52,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:52,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:52,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 63 [2025-01-10 00:38:52,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 67 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:52,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:52,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 63 [2025-01-10 00:38:52,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:52,610 INFO L124 PetriNetUnfolderBase]: 851/1464 cut-off events. [2025-01-10 00:38:52,610 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-01-10 00:38:52,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4040 conditions, 1464 events. 851/1464 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7481 event pairs, 186 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 4031. Up to 938 conditions per place. [2025-01-10 00:38:52,620 INFO L140 encePairwiseOnDemand]: 53/63 looper letters, 80 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2025-01-10 00:38:52,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 617 flow [2025-01-10 00:38:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-01-10 00:38:52,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5026455026455027 [2025-01-10 00:38:52,622 INFO L175 Difference]: Start difference. First operand has 56 places, 67 transitions, 314 flow. Second operand 3 states and 95 transitions. [2025-01-10 00:38:52,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 617 flow [2025-01-10 00:38:52,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 96 transitions, 599 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:52,628 INFO L231 Difference]: Finished difference. Result has 58 places, 73 transitions, 390 flow [2025-01-10 00:38:52,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=58, PETRI_TRANSITIONS=73} [2025-01-10 00:38:52,629 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-01-10 00:38:52,630 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 73 transitions, 390 flow [2025-01-10 00:38:52,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:52,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:52,630 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-10 00:38:52,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:38:52,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:38:52,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:52,631 INFO L85 PathProgramCache]: Analyzing trace with hash -49729813, now seen corresponding path program 1 times [2025-01-10 00:38:52,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:52,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022692803] [2025-01-10 00:38:52,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:52,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:52,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:38:52,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:38:52,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:52,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:38:52,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:38:52,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:38:52,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:38:52,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:52,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:38:52,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:38:52,654 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:38:52,654 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 47 remaining) [2025-01-10 00:38:52,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 47 remaining) [2025-01-10 00:38:52,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 47 remaining) [2025-01-10 00:38:52,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (41 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (30 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (25 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 47 remaining) [2025-01-10 00:38:52,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (10 of 47 remaining) [2025-01-10 00:38:52,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 47 remaining) [2025-01-10 00:38:52,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 47 remaining) [2025-01-10 00:38:52,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 47 remaining) [2025-01-10 00:38:52,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 47 remaining) [2025-01-10 00:38:52,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 47 remaining) [2025-01-10 00:38:52,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 47 remaining) [2025-01-10 00:38:52,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 47 remaining) [2025-01-10 00:38:52,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 47 remaining) [2025-01-10 00:38:52,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 47 remaining) [2025-01-10 00:38:52,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 47 remaining) [2025-01-10 00:38:52,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:38:52,656 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-10 00:38:52,660 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:38:52,660 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:38:52,732 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:38:52,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 91 transitions, 200 flow [2025-01-10 00:38:52,741 INFO L124 PetriNetUnfolderBase]: 9/105 cut-off events. [2025-01-10 00:38:52,742 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:38:52,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 9/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 499 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2025-01-10 00:38:52,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 91 transitions, 200 flow [2025-01-10 00:38:52,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 91 transitions, 200 flow [2025-01-10 00:38:52,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:52,745 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;@fe7d065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:52,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-01-10 00:38:52,747 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:52,747 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:38:52,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:52,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:52,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:38:52,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:38:52,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash 426959, now seen corresponding path program 1 times [2025-01-10 00:38:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:52,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068631380] [2025-01-10 00:38:52,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:52,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:38:52,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:38:52,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:52,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:52,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:52,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068631380] [2025-01-10 00:38:52,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068631380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:52,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:52,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:52,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007026923] [2025-01-10 00:38:52,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:52,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:38:52,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:52,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:38:52,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:38:52,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 91 [2025-01-10 00:38:52,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 200 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:52,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:52,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 91 [2025-01-10 00:38:52,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:57,065 INFO L124 PetriNetUnfolderBase]: 60462/86204 cut-off events. [2025-01-10 00:38:57,065 INFO L125 PetriNetUnfolderBase]: For 2431/2431 co-relation queries the response was YES. [2025-01-10 00:38:57,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169893 conditions, 86204 events. 60462/86204 cut-off events. For 2431/2431 co-relation queries the response was YES. Maximal size of possible extension queue 3228. Compared 598802 event pairs, 53730 based on Foata normal form. 0/40040 useless extension candidates. Maximal degree in co-relation 33051. Up to 82182 conditions per place. [2025-01-10 00:38:57,621 INFO L140 encePairwiseOnDemand]: 81/91 looper letters, 66 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2025-01-10 00:38:57,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 308 flow [2025-01-10 00:38:57,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:38:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:38:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2025-01-10 00:38:57,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 00:38:57,623 INFO L175 Difference]: Start difference. First operand has 89 places, 91 transitions, 200 flow. Second operand 2 states and 104 transitions. [2025-01-10 00:38:57,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 308 flow [2025-01-10 00:38:57,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 306 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:57,627 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 174 flow [2025-01-10 00:38:57,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=174, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2025-01-10 00:38:57,627 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -8 predicate places. [2025-01-10 00:38:57,627 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 174 flow [2025-01-10 00:38:57,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:57,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:57,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:38:57,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:38:57,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:38:57,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash 410432805, now seen corresponding path program 1 times [2025-01-10 00:38:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:57,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34644195] [2025-01-10 00:38:57,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:57,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:38:57,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:38:57,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:57,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:57,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34644195] [2025-01-10 00:38:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34644195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:57,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:57,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830715908] [2025-01-10 00:38:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:57,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:38:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:57,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:38:57,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:38:57,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 91 [2025-01-10 00:38:57,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:57,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:57,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 91 [2025-01-10 00:38:57,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:01,527 INFO L124 PetriNetUnfolderBase]: 43095/65066 cut-off events. [2025-01-10 00:39:01,528 INFO L125 PetriNetUnfolderBase]: For 1052/1052 co-relation queries the response was YES. [2025-01-10 00:39:01,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126111 conditions, 65066 events. 43095/65066 cut-off events. For 1052/1052 co-relation queries the response was YES. Maximal size of possible extension queue 3047. Compared 496627 event pairs, 26389 based on Foata normal form. 0/34094 useless extension candidates. Maximal degree in co-relation 126105. Up to 39243 conditions per place. [2025-01-10 00:39:01,862 INFO L140 encePairwiseOnDemand]: 51/91 looper letters, 138 selfloop transitions, 37 changer transitions 0/188 dead transitions. [2025-01-10 00:39:01,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 188 transitions, 757 flow [2025-01-10 00:39:01,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:39:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:39:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2025-01-10 00:39:01,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6840659340659341 [2025-01-10 00:39:01,864 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 174 flow. Second operand 4 states and 249 transitions. [2025-01-10 00:39:01,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 188 transitions, 757 flow [2025-01-10 00:39:01,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 188 transitions, 757 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:01,868 INFO L231 Difference]: Finished difference. Result has 87 places, 115 transitions, 490 flow [2025-01-10 00:39:01,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=490, PETRI_PLACES=87, PETRI_TRANSITIONS=115} [2025-01-10 00:39:01,869 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -2 predicate places. [2025-01-10 00:39:01,869 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 115 transitions, 490 flow [2025-01-10 00:39:01,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:01,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:01,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:39:01,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:39:01,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:39:01,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash 410432806, now seen corresponding path program 1 times [2025-01-10 00:39:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:01,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296583642] [2025-01-10 00:39:01,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:01,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:01,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:39:01,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:39:01,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:01,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:01,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:01,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296583642] [2025-01-10 00:39:01,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296583642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:01,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:39:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67200716] [2025-01-10 00:39:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:01,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:39:01,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:01,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:39:01,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:39:01,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 91 [2025-01-10 00:39:01,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 115 transitions, 490 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:01,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:01,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 91 [2025-01-10 00:39:01,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:03,955 INFO L124 PetriNetUnfolderBase]: 24834/38246 cut-off events. [2025-01-10 00:39:03,956 INFO L125 PetriNetUnfolderBase]: For 5227/5227 co-relation queries the response was YES. [2025-01-10 00:39:04,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100394 conditions, 38246 events. 24834/38246 cut-off events. For 5227/5227 co-relation queries the response was YES. Maximal size of possible extension queue 1959. Compared 283087 event pairs, 13465 based on Foata normal form. 5823/31013 useless extension candidates. Maximal degree in co-relation 100385. Up to 20379 conditions per place. [2025-01-10 00:39:04,161 INFO L140 encePairwiseOnDemand]: 75/91 looper letters, 126 selfloop transitions, 7 changer transitions 0/146 dead transitions. [2025-01-10 00:39:04,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 146 transitions, 876 flow [2025-01-10 00:39:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:39:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:39:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2025-01-10 00:39:04,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48626373626373626 [2025-01-10 00:39:04,163 INFO L175 Difference]: Start difference. First operand has 87 places, 115 transitions, 490 flow. Second operand 4 states and 177 transitions. [2025-01-10 00:39:04,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 146 transitions, 876 flow [2025-01-10 00:39:04,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 146 transitions, 876 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:04,183 INFO L231 Difference]: Finished difference. Result has 81 places, 106 transitions, 486 flow [2025-01-10 00:39:04,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=486, PETRI_PLACES=81, PETRI_TRANSITIONS=106} [2025-01-10 00:39:04,183 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -8 predicate places. [2025-01-10 00:39:04,183 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 106 transitions, 486 flow [2025-01-10 00:39:04,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:04,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:04,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:04,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:39:04,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:39:04,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash -711049682, now seen corresponding path program 1 times [2025-01-10 00:39:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:04,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597281061] [2025-01-10 00:39:04,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:04,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:39:04,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:39:04,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:04,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:04,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:04,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597281061] [2025-01-10 00:39:04,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597281061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:04,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:04,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:39:04,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126288807] [2025-01-10 00:39:04,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:04,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:04,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:04,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:04,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:04,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 91 [2025-01-10 00:39:04,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 106 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:04,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:04,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 91 [2025-01-10 00:39:04,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:06,197 INFO L124 PetriNetUnfolderBase]: 26571/39945 cut-off events. [2025-01-10 00:39:06,198 INFO L125 PetriNetUnfolderBase]: For 11370/11370 co-relation queries the response was YES. [2025-01-10 00:39:06,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109286 conditions, 39945 events. 26571/39945 cut-off events. For 11370/11370 co-relation queries the response was YES. Maximal size of possible extension queue 1903. Compared 288697 event pairs, 6830 based on Foata normal form. 0/27897 useless extension candidates. Maximal degree in co-relation 109276. Up to 21964 conditions per place. [2025-01-10 00:39:06,498 INFO L140 encePairwiseOnDemand]: 79/91 looper letters, 154 selfloop transitions, 20 changer transitions 0/185 dead transitions. [2025-01-10 00:39:06,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 185 transitions, 1210 flow [2025-01-10 00:39:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2025-01-10 00:39:06,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5494505494505495 [2025-01-10 00:39:06,499 INFO L175 Difference]: Start difference. First operand has 81 places, 106 transitions, 486 flow. Second operand 3 states and 150 transitions. [2025-01-10 00:39:06,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 185 transitions, 1210 flow [2025-01-10 00:39:06,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 185 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:39:06,531 INFO L231 Difference]: Finished difference. Result has 83 places, 122 transitions, 682 flow [2025-01-10 00:39:06,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=83, PETRI_TRANSITIONS=122} [2025-01-10 00:39:06,532 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -6 predicate places. [2025-01-10 00:39:06,532 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 122 transitions, 682 flow [2025-01-10 00:39:06,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:06,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:06,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:06,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:39:06,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:39:06,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash -711049681, now seen corresponding path program 1 times [2025-01-10 00:39:06,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:06,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893258390] [2025-01-10 00:39:06,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:06,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:06,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:39:06,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:39:06,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:06,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:06,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:06,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893258390] [2025-01-10 00:39:06,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893258390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:06,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:06,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:39:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640129487] [2025-01-10 00:39:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:06,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:06,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:06,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:06,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:06,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-01-10 00:39:06,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 122 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:06,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:06,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-01-10 00:39:06,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:09,026 INFO L124 PetriNetUnfolderBase]: 21181/32176 cut-off events. [2025-01-10 00:39:09,026 INFO L125 PetriNetUnfolderBase]: For 19925/19925 co-relation queries the response was YES. [2025-01-10 00:39:09,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97441 conditions, 32176 events. 21181/32176 cut-off events. For 19925/19925 co-relation queries the response was YES. Maximal size of possible extension queue 1493. Compared 229553 event pairs, 4516 based on Foata normal form. 1392/24979 useless extension candidates. Maximal degree in co-relation 97430. Up to 22665 conditions per place. [2025-01-10 00:39:09,276 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 153 selfloop transitions, 9 changer transitions 0/175 dead transitions. [2025-01-10 00:39:09,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 175 transitions, 1270 flow [2025-01-10 00:39:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-01-10 00:39:09,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4945054945054945 [2025-01-10 00:39:09,277 INFO L175 Difference]: Start difference. First operand has 83 places, 122 transitions, 682 flow. Second operand 3 states and 135 transitions. [2025-01-10 00:39:09,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 175 transitions, 1270 flow [2025-01-10 00:39:09,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 175 transitions, 1230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:39:09,322 INFO L231 Difference]: Finished difference. Result has 80 places, 117 transitions, 638 flow [2025-01-10 00:39:09,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=80, PETRI_TRANSITIONS=117} [2025-01-10 00:39:09,322 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -9 predicate places. [2025-01-10 00:39:09,322 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 117 transitions, 638 flow [2025-01-10 00:39:09,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:09,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:09,323 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:09,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:39:09,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:39:09,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2143353307, now seen corresponding path program 1 times [2025-01-10 00:39:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:09,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805200496] [2025-01-10 00:39:09,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:09,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:39:09,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:39:09,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:09,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:09,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:09,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805200496] [2025-01-10 00:39:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805200496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:09,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:09,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:39:09,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894991315] [2025-01-10 00:39:09,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:09,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:09,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:09,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:09,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:09,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-01-10 00:39:09,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 117 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:09,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:09,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-01-10 00:39:09,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:10,904 INFO L124 PetriNetUnfolderBase]: 18533/28539 cut-off events. [2025-01-10 00:39:10,904 INFO L125 PetriNetUnfolderBase]: For 16796/16802 co-relation queries the response was YES. [2025-01-10 00:39:10,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84388 conditions, 28539 events. 18533/28539 cut-off events. For 16796/16802 co-relation queries the response was YES. Maximal size of possible extension queue 1346. Compared 206079 event pairs, 2813 based on Foata normal form. 531/21635 useless extension candidates. Maximal degree in co-relation 84377. Up to 18423 conditions per place. [2025-01-10 00:39:11,024 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 149 selfloop transitions, 13 changer transitions 0/174 dead transitions. [2025-01-10 00:39:11,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 174 transitions, 1299 flow [2025-01-10 00:39:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-01-10 00:39:11,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-01-10 00:39:11,025 INFO L175 Difference]: Start difference. First operand has 80 places, 117 transitions, 638 flow. Second operand 3 states and 130 transitions. [2025-01-10 00:39:11,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 174 transitions, 1299 flow [2025-01-10 00:39:11,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 174 transitions, 1263 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:39:11,053 INFO L231 Difference]: Finished difference. Result has 77 places, 112 transitions, 624 flow [2025-01-10 00:39:11,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=77, PETRI_TRANSITIONS=112} [2025-01-10 00:39:11,053 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -12 predicate places. [2025-01-10 00:39:11,053 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 112 transitions, 624 flow [2025-01-10 00:39:11,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:11,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:11,053 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:11,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:39:11,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:39:11,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2143353310, now seen corresponding path program 1 times [2025-01-10 00:39:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286762359] [2025-01-10 00:39:11,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:11,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:39:11,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:39:11,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:11,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:11,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:11,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286762359] [2025-01-10 00:39:11,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286762359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:11,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:11,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:39:11,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132227009] [2025-01-10 00:39:11,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:11,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:11,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:11,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:11,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:11,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 91 [2025-01-10 00:39:11,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 112 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:11,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:11,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 91 [2025-01-10 00:39:11,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:12,614 INFO L124 PetriNetUnfolderBase]: 20801/31331 cut-off events. [2025-01-10 00:39:12,614 INFO L125 PetriNetUnfolderBase]: For 17535/17571 co-relation queries the response was YES. [2025-01-10 00:39:12,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93606 conditions, 31331 events. 20801/31331 cut-off events. For 17535/17571 co-relation queries the response was YES. Maximal size of possible extension queue 1380. Compared 218939 event pairs, 4821 based on Foata normal form. 6/24058 useless extension candidates. Maximal degree in co-relation 93595. Up to 15768 conditions per place. [2025-01-10 00:39:12,864 INFO L140 encePairwiseOnDemand]: 79/91 looper letters, 153 selfloop transitions, 28 changer transitions 0/191 dead transitions. [2025-01-10 00:39:12,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 191 transitions, 1421 flow [2025-01-10 00:39:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2025-01-10 00:39:12,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164835164835165 [2025-01-10 00:39:12,865 INFO L175 Difference]: Start difference. First operand has 77 places, 112 transitions, 624 flow. Second operand 3 states and 141 transitions. [2025-01-10 00:39:12,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 191 transitions, 1421 flow [2025-01-10 00:39:12,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 191 transitions, 1387 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:39:12,889 INFO L231 Difference]: Finished difference. Result has 79 places, 134 transitions, 920 flow [2025-01-10 00:39:12,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=920, PETRI_PLACES=79, PETRI_TRANSITIONS=134} [2025-01-10 00:39:12,890 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -10 predicate places. [2025-01-10 00:39:12,890 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 134 transitions, 920 flow [2025-01-10 00:39:12,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:12,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:12,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:12,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:39:12,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:39:12,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash -101805474, now seen corresponding path program 1 times [2025-01-10 00:39:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:12,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140450022] [2025-01-10 00:39:12,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:12,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:39:12,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:39:12,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:12,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140450022] [2025-01-10 00:39:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140450022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:39:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692204193] [2025-01-10 00:39:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:13,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:39:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:13,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:39:13,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:39:13,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-01-10 00:39:13,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 134 transitions, 920 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:13,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:13,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-01-10 00:39:13,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:16,486 INFO L124 PetriNetUnfolderBase]: 37856/58740 cut-off events. [2025-01-10 00:39:16,487 INFO L125 PetriNetUnfolderBase]: For 57648/57939 co-relation queries the response was YES. [2025-01-10 00:39:16,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186080 conditions, 58740 events. 37856/58740 cut-off events. For 57648/57939 co-relation queries the response was YES. Maximal size of possible extension queue 2352. Compared 460484 event pairs, 6373 based on Foata normal form. 33/46344 useless extension candidates. Maximal degree in co-relation 186068. Up to 24605 conditions per place. [2025-01-10 00:39:16,935 INFO L140 encePairwiseOnDemand]: 78/91 looper letters, 397 selfloop transitions, 47 changer transitions 0/455 dead transitions. [2025-01-10 00:39:16,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 455 transitions, 3966 flow [2025-01-10 00:39:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:39:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:39:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2025-01-10 00:39:16,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2025-01-10 00:39:16,937 INFO L175 Difference]: Start difference. First operand has 79 places, 134 transitions, 920 flow. Second operand 6 states and 287 transitions. [2025-01-10 00:39:16,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 455 transitions, 3966 flow [2025-01-10 00:39:17,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 455 transitions, 3798 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:39:17,090 INFO L231 Difference]: Finished difference. Result has 85 places, 186 transitions, 1346 flow [2025-01-10 00:39:17,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1346, PETRI_PLACES=85, PETRI_TRANSITIONS=186} [2025-01-10 00:39:17,091 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -4 predicate places. [2025-01-10 00:39:17,091 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 186 transitions, 1346 flow [2025-01-10 00:39:17,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:17,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:17,091 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:17,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:39:17,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:39:17,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:17,092 INFO L85 PathProgramCache]: Analyzing trace with hash 651770438, now seen corresponding path program 1 times [2025-01-10 00:39:17,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:17,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611092472] [2025-01-10 00:39:17,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:17,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:17,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:39:17,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:17,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:17,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:17,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611092472] [2025-01-10 00:39:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611092472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:17,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:17,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:39:17,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223145067] [2025-01-10 00:39:17,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:17,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:39:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:17,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:39:17,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:39:17,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 91 [2025-01-10 00:39:17,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 186 transitions, 1346 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:17,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:17,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 91 [2025-01-10 00:39:17,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:23,956 INFO L124 PetriNetUnfolderBase]: 67707/106346 cut-off events. [2025-01-10 00:39:23,956 INFO L125 PetriNetUnfolderBase]: For 103629/104106 co-relation queries the response was YES. [2025-01-10 00:39:24,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357602 conditions, 106346 events. 67707/106346 cut-off events. For 103629/104106 co-relation queries the response was YES. Maximal size of possible extension queue 4134. Compared 912130 event pairs, 9750 based on Foata normal form. 1308/90098 useless extension candidates. Maximal degree in co-relation 357587. Up to 54161 conditions per place. [2025-01-10 00:39:24,698 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 393 selfloop transitions, 45 changer transitions 0/453 dead transitions. [2025-01-10 00:39:24,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 453 transitions, 4134 flow [2025-01-10 00:39:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:39:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:39:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2025-01-10 00:39:24,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2025-01-10 00:39:24,699 INFO L175 Difference]: Start difference. First operand has 85 places, 186 transitions, 1346 flow. Second operand 5 states and 230 transitions. [2025-01-10 00:39:24,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 453 transitions, 4134 flow [2025-01-10 00:39:25,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 453 transitions, 4134 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:25,364 INFO L231 Difference]: Finished difference. Result has 92 places, 230 transitions, 1977 flow [2025-01-10 00:39:25,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1977, PETRI_PLACES=92, PETRI_TRANSITIONS=230} [2025-01-10 00:39:25,365 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 3 predicate places. [2025-01-10 00:39:25,365 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 230 transitions, 1977 flow [2025-01-10 00:39:25,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:25,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:25,365 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:25,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:39:25,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:39:25,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2019443111, now seen corresponding path program 1 times [2025-01-10 00:39:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315191265] [2025-01-10 00:39:25,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:25,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:25,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:39:25,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:25,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:25,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:25,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:25,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315191265] [2025-01-10 00:39:25,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315191265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:25,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:25,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:39:25,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415131880] [2025-01-10 00:39:25,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:25,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:39:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:25,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:39:25,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:39:25,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 91 [2025-01-10 00:39:25,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 230 transitions, 1977 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:25,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:25,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 91 [2025-01-10 00:39:25,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand