./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:54:42,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:54:42,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:54:42,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:54:42,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:54:42,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:54:42,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:54:42,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:54:42,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:54:42,198 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:54:42,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:54:42,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:54:42,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:54:42,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:54:42,199 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:54:42,200 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:54:42,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:54:42,200 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-03-09 00:54:42,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:54:42,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:54:42,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:54:42,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:54:42,416 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:54:42,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-03-09 00:54:43,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29705f77b/f00356f38bf04b58a70cd7f96d080aa8/FLAG2d18b5212 [2025-03-09 00:54:43,774 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:54:43,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-03-09 00:54:43,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29705f77b/f00356f38bf04b58a70cd7f96d080aa8/FLAG2d18b5212 [2025-03-09 00:54:43,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29705f77b/f00356f38bf04b58a70cd7f96d080aa8 [2025-03-09 00:54:43,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:54:43,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:54:43,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:54:43,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:54:43,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:54:43,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:54:43" (1/1) ... [2025-03-09 00:54:43,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6178d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:43, skipping insertion in model container [2025-03-09 00:54:43,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:54:43" (1/1) ... [2025-03-09 00:54:43,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:54:44,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:54:44,207 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:54:44,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:54:44,322 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:54:44,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44 WrapperNode [2025-03-09 00:54:44,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:54:44,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:54:44,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:54:44,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:54:44,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,417 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1040 [2025-03-09 00:54:44,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:54:44,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:54:44,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:54:44,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:54:44,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,467 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 403, 434]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 16 writes are split as follows [0, 0, 2, 14]. [2025-03-09 00:54:44,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:54:44,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:54:44,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:54:44,523 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:54:44,524 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (1/1) ... [2025-03-09 00:54:44,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:54:44,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:44,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:54:44,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:54:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 00:54:44,570 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 00:54:44,570 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 00:54:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 00:54:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:54:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:54:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:54:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:54:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 00:54:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:54:44,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:54:44,572 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:54:44,674 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:54:44,676 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:54:45,833 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:54:45,833 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:54:51,111 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:54:51,111 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:54:51,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:54:51 BoogieIcfgContainer [2025-03-09 00:54:51,112 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:54:51,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:54:51,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:54:51,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:54:51,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:54:43" (1/3) ... [2025-03-09 00:54:51,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583920c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:54:51, skipping insertion in model container [2025-03-09 00:54:51,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:44" (2/3) ... [2025-03-09 00:54:51,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583920c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:54:51, skipping insertion in model container [2025-03-09 00:54:51,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:54:51" (3/3) ... [2025-03-09 00:54:51,121 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-03-09 00:54:51,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:54:51,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 159 locations, 1 initial locations, 2 loop locations, and 72 error locations. [2025-03-09 00:54:51,135 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:54:51,246 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 00:54:51,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 358 flow [2025-03-09 00:54:51,353 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events. [2025-03-09 00:54:51,356 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:54:51,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 14/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 518 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place. [2025-03-09 00:54:51,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 358 flow [2025-03-09 00:54:51,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 169 transitions, 350 flow [2025-03-09 00:54:51,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:54:51,388 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;@20ab4bee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:54:51,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 134 error locations. [2025-03-09 00:54:51,407 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:54:51,407 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-09 00:54:51,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:54:51,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:51,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 00:54:51,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:54:51,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash 74642, now seen corresponding path program 1 times [2025-03-09 00:54:51,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:51,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833532942] [2025-03-09 00:54:51,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:51,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:51,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 00:54:51,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 00:54:51,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:51,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:52,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:52,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833532942] [2025-03-09 00:54:52,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833532942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:52,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:54:52,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744747984] [2025-03-09 00:54:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:52,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:54:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:52,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:54:52,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:54:52,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-03-09 00:54:52,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:52,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:52,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-03-09 00:54:52,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:52,870 INFO L124 PetriNetUnfolderBase]: 1744/4653 cut-off events. [2025-03-09 00:54:52,870 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-09 00:54:52,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7479 conditions, 4653 events. 1744/4653 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37061 event pairs, 1393 based on Foata normal form. 182/3587 useless extension candidates. Maximal degree in co-relation 7362. Up to 2745 conditions per place. [2025-03-09 00:54:52,903 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 58 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2025-03-09 00:54:52,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 440 flow [2025-03-09 00:54:52,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:54:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:54:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2025-03-09 00:54:52,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7015503875968992 [2025-03-09 00:54:52,917 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 350 flow. Second operand 3 states and 362 transitions. [2025-03-09 00:54:52,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 440 flow [2025-03-09 00:54:52,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 154 transitions, 432 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:54:52,927 INFO L231 Difference]: Finished difference. Result has 151 places, 154 transitions, 316 flow [2025-03-09 00:54:52,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=151, PETRI_TRANSITIONS=154} [2025-03-09 00:54:52,933 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -11 predicate places. [2025-03-09 00:54:52,933 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 154 transitions, 316 flow [2025-03-09 00:54:52,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:52,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:52,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 00:54:52,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:54:52,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:54:52,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash 74643, now seen corresponding path program 1 times [2025-03-09 00:54:52,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:52,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313394897] [2025-03-09 00:54:52,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:52,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:52,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 00:54:52,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 00:54:52,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:52,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:53,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313394897] [2025-03-09 00:54:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313394897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:54:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102352331] [2025-03-09 00:54:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:53,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:54:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:54:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:54:53,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-03-09 00:54:53,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 154 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:53,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:53,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-03-09 00:54:53,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:53,728 INFO L124 PetriNetUnfolderBase]: 1744/4650 cut-off events. [2025-03-09 00:54:53,728 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-09 00:54:53,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 4650 events. 1744/4650 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37055 event pairs, 1393 based on Foata normal form. 3/3407 useless extension candidates. Maximal degree in co-relation 7419. Up to 2745 conditions per place. [2025-03-09 00:54:53,751 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 58 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-03-09 00:54:53,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 151 transitions, 430 flow [2025-03-09 00:54:53,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:54:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:54:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-03-09 00:54:53,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-03-09 00:54:53,753 INFO L175 Difference]: Start difference. First operand has 151 places, 154 transitions, 316 flow. Second operand 3 states and 357 transitions. [2025-03-09 00:54:53,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 151 transitions, 430 flow [2025-03-09 00:54:53,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 151 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:54:53,756 INFO L231 Difference]: Finished difference. Result has 148 places, 151 transitions, 310 flow [2025-03-09 00:54:53,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=148, PETRI_TRANSITIONS=151} [2025-03-09 00:54:53,758 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -14 predicate places. [2025-03-09 00:54:53,758 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 151 transitions, 310 flow [2025-03-09 00:54:53,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:53,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:53,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:54:53,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:54:53,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:54:53,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2069128958, now seen corresponding path program 1 times [2025-03-09 00:54:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:53,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610059572] [2025-03-09 00:54:53,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:53,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:54:53,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:54:53,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:53,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:54,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:54,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610059572] [2025-03-09 00:54:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610059572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:54,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:54,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:54:54,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400724403] [2025-03-09 00:54:54,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:54,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:54:54,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:54,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:54:54,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:54:54,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-03-09 00:54:54,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 151 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:54,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:54,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-03-09 00:54:54,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:54,870 INFO L124 PetriNetUnfolderBase]: 1744/4648 cut-off events. [2025-03-09 00:54:54,870 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-09 00:54:54,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 4648 events. 1744/4648 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37022 event pairs, 1393 based on Foata normal form. 1/3405 useless extension candidates. Maximal degree in co-relation 7417. Up to 2744 conditions per place. [2025-03-09 00:54:54,894 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 58 selfloop transitions, 3 changer transitions 0/149 dead transitions. [2025-03-09 00:54:54,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 149 transitions, 428 flow [2025-03-09 00:54:54,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:54:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:54:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2025-03-09 00:54:54,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6613372093023255 [2025-03-09 00:54:54,896 INFO L175 Difference]: Start difference. First operand has 148 places, 151 transitions, 310 flow. Second operand 4 states and 455 transitions. [2025-03-09 00:54:54,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 149 transitions, 428 flow [2025-03-09 00:54:54,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 149 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:54:54,901 INFO L231 Difference]: Finished difference. Result has 147 places, 149 transitions, 308 flow [2025-03-09 00:54:54,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=149} [2025-03-09 00:54:54,901 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -15 predicate places. [2025-03-09 00:54:54,901 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 149 transitions, 308 flow [2025-03-09 00:54:54,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:54,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:54,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:54:54,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:54:54,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:54:54,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2069128959, now seen corresponding path program 1 times [2025-03-09 00:54:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:54,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462331562] [2025-03-09 00:54:54,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:54,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:54,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:54:54,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:54:54,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:54,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:55,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:55,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462331562] [2025-03-09 00:54:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462331562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:55,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:55,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:54:55,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802364926] [2025-03-09 00:54:55,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:55,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:54:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:55,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:54:55,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:54:55,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-03-09 00:54:55,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 149 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:55,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:55,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-03-09 00:54:55,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:55,667 INFO L124 PetriNetUnfolderBase]: 1744/4646 cut-off events. [2025-03-09 00:54:55,667 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 00:54:55,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 4646 events. 1744/4646 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36999 event pairs, 1393 based on Foata normal form. 1/3404 useless extension candidates. Maximal degree in co-relation 7412. Up to 2744 conditions per place. [2025-03-09 00:54:55,685 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 60 selfloop transitions, 3 changer transitions 0/147 dead transitions. [2025-03-09 00:54:55,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 147 transitions, 430 flow [2025-03-09 00:54:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:54:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:54:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2025-03-09 00:54:55,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6351744186046512 [2025-03-09 00:54:55,687 INFO L175 Difference]: Start difference. First operand has 147 places, 149 transitions, 308 flow. Second operand 4 states and 437 transitions. [2025-03-09 00:54:55,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 147 transitions, 430 flow [2025-03-09 00:54:55,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 147 transitions, 424 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 00:54:55,689 INFO L231 Difference]: Finished difference. Result has 145 places, 147 transitions, 304 flow [2025-03-09 00:54:55,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=145, PETRI_TRANSITIONS=147} [2025-03-09 00:54:55,691 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -17 predicate places. [2025-03-09 00:54:55,691 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 147 transitions, 304 flow [2025-03-09 00:54:55,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:55,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:55,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:55,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:54:55,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:54:55,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:55,692 INFO L85 PathProgramCache]: Analyzing trace with hash 584442062, now seen corresponding path program 1 times [2025-03-09 00:54:55,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028552597] [2025-03-09 00:54:55,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:55,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:54:55,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:54:55,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:55,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:55,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:55,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028552597] [2025-03-09 00:54:55,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028552597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:55,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:55,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:54:55,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261612013] [2025-03-09 00:54:55,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:55,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:54:55,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:55,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:54:55,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:54:56,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 172 [2025-03-09 00:54:56,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 147 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:56,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:56,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 172 [2025-03-09 00:54:56,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:56,520 INFO L124 PetriNetUnfolderBase]: 2019/4463 cut-off events. [2025-03-09 00:54:56,520 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-09 00:54:56,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7727 conditions, 4463 events. 2019/4463 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 31647 event pairs, 705 based on Foata normal form. 0/3899 useless extension candidates. Maximal degree in co-relation 7710. Up to 1807 conditions per place. [2025-03-09 00:54:56,536 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 81 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2025-03-09 00:54:56,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 150 transitions, 485 flow [2025-03-09 00:54:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:54:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:54:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2025-03-09 00:54:56,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-09 00:54:56,538 INFO L175 Difference]: Start difference. First operand has 145 places, 147 transitions, 304 flow. Second operand 5 states and 473 transitions. [2025-03-09 00:54:56,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 150 transitions, 485 flow [2025-03-09 00:54:56,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 150 transitions, 479 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 00:54:56,540 INFO L231 Difference]: Finished difference. Result has 130 places, 131 transitions, 278 flow [2025-03-09 00:54:56,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=130, PETRI_TRANSITIONS=131} [2025-03-09 00:54:56,540 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -32 predicate places. [2025-03-09 00:54:56,540 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 131 transitions, 278 flow [2025-03-09 00:54:56,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:56,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:56,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:56,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:54:56,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:54:56,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:56,542 INFO L85 PathProgramCache]: Analyzing trace with hash 584442063, now seen corresponding path program 1 times [2025-03-09 00:54:56,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:56,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099440356] [2025-03-09 00:54:56,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:56,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:56,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:54:56,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:54:56,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:56,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:56,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:56,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099440356] [2025-03-09 00:54:56,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099440356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:56,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:56,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:54:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745744807] [2025-03-09 00:54:56,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:56,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:54:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:56,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:54:56,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:54:57,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172 [2025-03-09 00:54:57,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 131 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:57,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:57,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172 [2025-03-09 00:54:57,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:57,566 INFO L124 PetriNetUnfolderBase]: 1703/3676 cut-off events. [2025-03-09 00:54:57,566 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-03-09 00:54:57,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6548 conditions, 3676 events. 1703/3676 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 24515 event pairs, 702 based on Foata normal form. 204/3341 useless extension candidates. Maximal degree in co-relation 2518. Up to 1413 conditions per place. [2025-03-09 00:54:57,579 INFO L140 encePairwiseOnDemand]: 152/172 looper letters, 73 selfloop transitions, 6 changer transitions 0/136 dead transitions. [2025-03-09 00:54:57,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 136 transitions, 447 flow [2025-03-09 00:54:57,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:54:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:54:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2025-03-09 00:54:57,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6139534883720931 [2025-03-09 00:54:57,582 INFO L175 Difference]: Start difference. First operand has 130 places, 131 transitions, 278 flow. Second operand 5 states and 528 transitions. [2025-03-09 00:54:57,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 136 transitions, 447 flow [2025-03-09 00:54:57,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 136 transitions, 435 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:54:57,584 INFO L231 Difference]: Finished difference. Result has 116 places, 117 transitions, 250 flow [2025-03-09 00:54:57,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=116, PETRI_TRANSITIONS=117} [2025-03-09 00:54:57,587 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -46 predicate places. [2025-03-09 00:54:57,587 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 117 transitions, 250 flow [2025-03-09 00:54:57,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:57,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:57,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:57,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:54:57,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:54:57,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash 937837040, now seen corresponding path program 1 times [2025-03-09 00:54:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348998828] [2025-03-09 00:54:57,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:57,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:54:57,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:54:57,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:57,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:58,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:58,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348998828] [2025-03-09 00:54:58,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348998828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:58,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:58,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:54:58,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165862486] [2025-03-09 00:54:58,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:58,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:54:58,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:58,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:54:58,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:54:58,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 172 [2025-03-09 00:54:58,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 117 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:58,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:58,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 172 [2025-03-09 00:54:58,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:59,410 INFO L124 PetriNetUnfolderBase]: 2502/5392 cut-off events. [2025-03-09 00:54:59,410 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-09 00:54:59,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9550 conditions, 5392 events. 2502/5392 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 38773 event pairs, 536 based on Foata normal form. 0/4394 useless extension candidates. Maximal degree in co-relation 3717. Up to 3436 conditions per place. [2025-03-09 00:54:59,429 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 125 selfloop transitions, 11 changer transitions 0/184 dead transitions. [2025-03-09 00:54:59,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 184 transitions, 661 flow [2025-03-09 00:54:59,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:54:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 00:54:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2025-03-09 00:54:59,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5506644518272426 [2025-03-09 00:54:59,431 INFO L175 Difference]: Start difference. First operand has 116 places, 117 transitions, 250 flow. Second operand 7 states and 663 transitions. [2025-03-09 00:54:59,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 184 transitions, 661 flow [2025-03-09 00:54:59,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 184 transitions, 647 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:54:59,436 INFO L231 Difference]: Finished difference. Result has 122 places, 127 transitions, 312 flow [2025-03-09 00:54:59,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=122, PETRI_TRANSITIONS=127} [2025-03-09 00:54:59,437 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -40 predicate places. [2025-03-09 00:54:59,437 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 127 transitions, 312 flow [2025-03-09 00:54:59,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:59,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:59,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:59,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:54:59,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:54:59,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash 584202995, now seen corresponding path program 1 times [2025-03-09 00:54:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:59,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523376305] [2025-03-09 00:54:59,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:59,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 00:54:59,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 00:54:59,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:59,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523376305] [2025-03-09 00:54:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523376305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:59,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:59,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:54:59,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076625495] [2025-03-09 00:54:59,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:59,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:54:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:59,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:54:59,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:54:59,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 172 [2025-03-09 00:54:59,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 127 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:59,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:59,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 172 [2025-03-09 00:54:59,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:00,153 INFO L124 PetriNetUnfolderBase]: 2427/5009 cut-off events. [2025-03-09 00:55:00,154 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-03-09 00:55:00,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9367 conditions, 5009 events. 2427/5009 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 34391 event pairs, 906 based on Foata normal form. 87/4642 useless extension candidates. Maximal degree in co-relation 9056. Up to 2023 conditions per place. [2025-03-09 00:55:00,173 INFO L140 encePairwiseOnDemand]: 160/172 looper letters, 109 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2025-03-09 00:55:00,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 158 transitions, 621 flow [2025-03-09 00:55:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2025-03-09 00:55:00,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6151162790697674 [2025-03-09 00:55:00,176 INFO L175 Difference]: Start difference. First operand has 122 places, 127 transitions, 312 flow. Second operand 5 states and 529 transitions. [2025-03-09 00:55:00,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 158 transitions, 621 flow [2025-03-09 00:55:00,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 158 transitions, 619 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:00,180 INFO L231 Difference]: Finished difference. Result has 117 places, 119 transitions, 302 flow [2025-03-09 00:55:00,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=117, PETRI_TRANSITIONS=119} [2025-03-09 00:55:00,181 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -45 predicate places. [2025-03-09 00:55:00,182 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 119 transitions, 302 flow [2025-03-09 00:55:00,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:00,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:00,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:00,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:55:00,183 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:00,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 584202996, now seen corresponding path program 1 times [2025-03-09 00:55:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:00,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172757136] [2025-03-09 00:55:00,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:00,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:00,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 00:55:00,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 00:55:00,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:00,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172757136] [2025-03-09 00:55:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172757136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:00,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:00,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:00,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669441432] [2025-03-09 00:55:00,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:00,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:00,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:00,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:00,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:00,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-09 00:55:00,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:00,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:00,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-09 00:55:00,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:00,564 INFO L124 PetriNetUnfolderBase]: 1382/3055 cut-off events. [2025-03-09 00:55:00,565 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-03-09 00:55:00,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5512 conditions, 3055 events. 1382/3055 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17536 event pairs, 703 based on Foata normal form. 55/2727 useless extension candidates. Maximal degree in co-relation 5504. Up to 1211 conditions per place. [2025-03-09 00:55:00,574 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 81 selfloop transitions, 3 changer transitions 0/132 dead transitions. [2025-03-09 00:55:00,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 132 transitions, 470 flow [2025-03-09 00:55:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2025-03-09 00:55:00,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2025-03-09 00:55:00,576 INFO L175 Difference]: Start difference. First operand has 117 places, 119 transitions, 302 flow. Second operand 3 states and 388 transitions. [2025-03-09 00:55:00,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 132 transitions, 470 flow [2025-03-09 00:55:00,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 132 transitions, 439 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-03-09 00:55:00,578 INFO L231 Difference]: Finished difference. Result has 107 places, 109 transitions, 235 flow [2025-03-09 00:55:00,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=107, PETRI_TRANSITIONS=109} [2025-03-09 00:55:00,579 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-03-09 00:55:00,579 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 109 transitions, 235 flow [2025-03-09 00:55:00,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:00,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:00,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:00,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:55:00,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:00,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash -576181152, now seen corresponding path program 1 times [2025-03-09 00:55:00,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:00,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702988740] [2025-03-09 00:55:00,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:00,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 00:55:00,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 00:55:00,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:00,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:00,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:00,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702988740] [2025-03-09 00:55:00,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702988740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:00,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:00,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:55:00,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857764810] [2025-03-09 00:55:00,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:00,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:00,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:00,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:00,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:00,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-09 00:55:00,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 109 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:00,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:00,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-09 00:55:00,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:01,270 INFO L124 PetriNetUnfolderBase]: 1392/3119 cut-off events. [2025-03-09 00:55:01,271 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-09 00:55:01,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 3119 events. 1392/3119 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18132 event pairs, 1089 based on Foata normal form. 0/2730 useless extension candidates. Maximal degree in co-relation 5497. Up to 2216 conditions per place. [2025-03-09 00:55:01,281 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 60 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2025-03-09 00:55:01,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 355 flow [2025-03-09 00:55:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:01,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-03-09 00:55:01,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6996124031007752 [2025-03-09 00:55:01,283 INFO L175 Difference]: Start difference. First operand has 107 places, 109 transitions, 235 flow. Second operand 3 states and 361 transitions. [2025-03-09 00:55:01,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 355 flow [2025-03-09 00:55:01,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:01,285 INFO L231 Difference]: Finished difference. Result has 107 places, 108 transitions, 232 flow [2025-03-09 00:55:01,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=107, PETRI_TRANSITIONS=108} [2025-03-09 00:55:01,285 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-03-09 00:55:01,286 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 108 transitions, 232 flow [2025-03-09 00:55:01,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:01,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:01,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:01,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:55:01,286 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:01,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:01,287 INFO L85 PathProgramCache]: Analyzing trace with hash -576181153, now seen corresponding path program 1 times [2025-03-09 00:55:01,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:01,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120111425] [2025-03-09 00:55:01,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:01,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:01,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 00:55:01,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 00:55:01,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:01,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:01,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:01,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120111425] [2025-03-09 00:55:01,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120111425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:01,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:01,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:55:01,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86292746] [2025-03-09 00:55:01,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:01,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:01,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:01,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:01,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-03-09 00:55:01,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 108 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:01,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:01,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-03-09 00:55:01,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:01,771 INFO L124 PetriNetUnfolderBase]: 1392/3052 cut-off events. [2025-03-09 00:55:01,771 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-09 00:55:01,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5422 conditions, 3052 events. 1392/3052 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17356 event pairs, 1089 based on Foata normal form. 77/2795 useless extension candidates. Maximal degree in co-relation 5417. Up to 2216 conditions per place. [2025-03-09 00:55:01,781 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 60 selfloop transitions, 1 changer transitions 0/105 dead transitions. [2025-03-09 00:55:01,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 105 transitions, 348 flow [2025-03-09 00:55:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-03-09 00:55:01,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-03-09 00:55:01,783 INFO L175 Difference]: Start difference. First operand has 107 places, 108 transitions, 232 flow. Second operand 3 states and 357 transitions. [2025-03-09 00:55:01,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 105 transitions, 348 flow [2025-03-09 00:55:01,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 105 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:01,785 INFO L231 Difference]: Finished difference. Result has 105 places, 105 transitions, 227 flow [2025-03-09 00:55:01,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=105, PETRI_TRANSITIONS=105} [2025-03-09 00:55:01,785 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -57 predicate places. [2025-03-09 00:55:01,786 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 227 flow [2025-03-09 00:55:01,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:01,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:01,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:01,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:55:01,786 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:01,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:01,791 INFO L85 PathProgramCache]: Analyzing trace with hash -681744132, now seen corresponding path program 1 times [2025-03-09 00:55:01,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:01,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725788264] [2025-03-09 00:55:01,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:01,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:01,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 00:55:01,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 00:55:01,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:01,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:01,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:01,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725788264] [2025-03-09 00:55:01,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725788264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:01,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:01,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:01,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500847203] [2025-03-09 00:55:01,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:01,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:55:01,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:01,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:55:01,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:55:02,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-03-09 00:55:02,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:02,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:02,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-03-09 00:55:02,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:02,526 INFO L124 PetriNetUnfolderBase]: 1409/3045 cut-off events. [2025-03-09 00:55:02,526 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-09 00:55:02,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 3045 events. 1409/3045 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17110 event pairs, 1074 based on Foata normal form. 0/2747 useless extension candidates. Maximal degree in co-relation 5443. Up to 2186 conditions per place. [2025-03-09 00:55:02,536 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 68 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2025-03-09 00:55:02,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 111 transitions, 384 flow [2025-03-09 00:55:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2025-03-09 00:55:02,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6255813953488372 [2025-03-09 00:55:02,538 INFO L175 Difference]: Start difference. First operand has 105 places, 105 transitions, 227 flow. Second operand 5 states and 538 transitions. [2025-03-09 00:55:02,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 111 transitions, 384 flow [2025-03-09 00:55:02,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 111 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:02,540 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 230 flow [2025-03-09 00:55:02,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2025-03-09 00:55:02,540 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -56 predicate places. [2025-03-09 00:55:02,540 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 230 flow [2025-03-09 00:55:02,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:02,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:02,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:02,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:55:02,541 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:02,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -681744131, now seen corresponding path program 1 times [2025-03-09 00:55:02,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:02,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673628757] [2025-03-09 00:55:02,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:02,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:02,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 00:55:02,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 00:55:02,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:02,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:03,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:03,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673628757] [2025-03-09 00:55:03,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673628757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:03,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:03,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:03,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941524172] [2025-03-09 00:55:03,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:03,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:03,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:03,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:03,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:03,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-09 00:55:03,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:03,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:03,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-09 00:55:03,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:03,672 INFO L124 PetriNetUnfolderBase]: 1392/3004 cut-off events. [2025-03-09 00:55:03,672 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-09 00:55:03,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5401 conditions, 3004 events. 1392/3004 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 16851 event pairs, 1074 based on Foata normal form. 24/2730 useless extension candidates. Maximal degree in co-relation 5396. Up to 2186 conditions per place. [2025-03-09 00:55:03,683 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 65 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-03-09 00:55:03,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 381 flow [2025-03-09 00:55:03,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2025-03-09 00:55:03,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6569767441860465 [2025-03-09 00:55:03,685 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 230 flow. Second operand 5 states and 565 transitions. [2025-03-09 00:55:03,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 381 flow [2025-03-09 00:55:03,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 109 transitions, 373 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:55:03,687 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 226 flow [2025-03-09 00:55:03,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2025-03-09 00:55:03,688 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -58 predicate places. [2025-03-09 00:55:03,688 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 226 flow [2025-03-09 00:55:03,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:03,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:03,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:03,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:55:03,689 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:03,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:03,689 INFO L85 PathProgramCache]: Analyzing trace with hash 340738021, now seen corresponding path program 1 times [2025-03-09 00:55:03,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:03,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327748085] [2025-03-09 00:55:03,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:03,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 00:55:03,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:55:03,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:03,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:03,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327748085] [2025-03-09 00:55:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327748085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:03,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:03,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065606115] [2025-03-09 00:55:03,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:03,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:03,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:03,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:03,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:03,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-09 00:55:03,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:03,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:03,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-09 00:55:03,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:04,081 INFO L124 PetriNetUnfolderBase]: 1380/2992 cut-off events. [2025-03-09 00:55:04,081 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-09 00:55:04,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 2992 events. 1380/2992 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 16804 event pairs, 1074 based on Foata normal form. 0/2706 useless extension candidates. Maximal degree in co-relation 5372. Up to 2176 conditions per place. [2025-03-09 00:55:04,090 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 66 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-03-09 00:55:04,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 377 flow [2025-03-09 00:55:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-03-09 00:55:04,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7189922480620154 [2025-03-09 00:55:04,091 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 226 flow. Second operand 3 states and 371 transitions. [2025-03-09 00:55:04,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 377 flow [2025-03-09 00:55:04,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 108 transitions, 369 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:55:04,093 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 220 flow [2025-03-09 00:55:04,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2025-03-09 00:55:04,093 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -60 predicate places. [2025-03-09 00:55:04,093 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 220 flow [2025-03-09 00:55:04,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:04,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:04,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:04,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:55:04,094 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:04,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash -436164801, now seen corresponding path program 1 times [2025-03-09 00:55:04,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:04,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750270914] [2025-03-09 00:55:04,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:04,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:04,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 00:55:04,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 00:55:04,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:04,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:05,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:05,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750270914] [2025-03-09 00:55:05,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750270914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:05,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:05,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 00:55:05,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138115097] [2025-03-09 00:55:05,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:05,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 00:55:05,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:05,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 00:55:05,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:55:05,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 172 [2025-03-09 00:55:05,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 220 flow. Second operand has 9 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:05,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:05,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 172 [2025-03-09 00:55:05,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:05,817 INFO L124 PetriNetUnfolderBase]: 1717/3481 cut-off events. [2025-03-09 00:55:05,817 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-09 00:55:05,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6486 conditions, 3481 events. 1717/3481 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 19000 event pairs, 388 based on Foata normal form. 0/3243 useless extension candidates. Maximal degree in co-relation 6481. Up to 2364 conditions per place. [2025-03-09 00:55:05,826 INFO L140 encePairwiseOnDemand]: 159/172 looper letters, 117 selfloop transitions, 12 changer transitions 0/160 dead transitions. [2025-03-09 00:55:05,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 160 transitions, 608 flow [2025-03-09 00:55:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:55:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 00:55:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 957 transitions. [2025-03-09 00:55:05,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6182170542635659 [2025-03-09 00:55:05,828 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 220 flow. Second operand 9 states and 957 transitions. [2025-03-09 00:55:05,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 160 transitions, 608 flow [2025-03-09 00:55:05,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 160 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:05,830 INFO L231 Difference]: Finished difference. Result has 108 places, 101 transitions, 252 flow [2025-03-09 00:55:05,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=108, PETRI_TRANSITIONS=101} [2025-03-09 00:55:05,831 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -54 predicate places. [2025-03-09 00:55:05,831 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 101 transitions, 252 flow [2025-03-09 00:55:05,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:05,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:05,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:05,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:55:05,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:05,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:05,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1976594070, now seen corresponding path program 1 times [2025-03-09 00:55:05,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:05,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483101835] [2025-03-09 00:55:05,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:05,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:05,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 00:55:05,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 00:55:05,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:05,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483101835] [2025-03-09 00:55:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483101835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:07,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:07,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 00:55:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804114407] [2025-03-09 00:55:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:07,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:55:07,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:07,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:55:07,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:55:08,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 172 [2025-03-09 00:55:08,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 101 transitions, 252 flow. Second operand has 15 states, 15 states have (on average 92.66666666666667) internal successors, (1390), 15 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:08,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:08,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 172 [2025-03-09 00:55:08,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:09,181 INFO L124 PetriNetUnfolderBase]: 1711/3420 cut-off events. [2025-03-09 00:55:09,181 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-09 00:55:09,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6719 conditions, 3420 events. 1711/3420 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 18673 event pairs, 438 based on Foata normal form. 0/3216 useless extension candidates. Maximal degree in co-relation 6713. Up to 2065 conditions per place. [2025-03-09 00:55:09,190 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 129 selfloop transitions, 14 changer transitions 0/170 dead transitions. [2025-03-09 00:55:09,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 170 transitions, 686 flow [2025-03-09 00:55:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:55:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 00:55:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1323 transitions. [2025-03-09 00:55:09,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5916815742397138 [2025-03-09 00:55:09,192 INFO L175 Difference]: Start difference. First operand has 108 places, 101 transitions, 252 flow. Second operand 13 states and 1323 transitions. [2025-03-09 00:55:09,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 170 transitions, 686 flow [2025-03-09 00:55:09,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 170 transitions, 666 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-09 00:55:09,195 INFO L231 Difference]: Finished difference. Result has 110 places, 98 transitions, 260 flow [2025-03-09 00:55:09,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=260, PETRI_PLACES=110, PETRI_TRANSITIONS=98} [2025-03-09 00:55:09,195 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -52 predicate places. [2025-03-09 00:55:09,195 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 260 flow [2025-03-09 00:55:09,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 92.66666666666667) internal successors, (1390), 15 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:09,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:09,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:09,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:55:09,196 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:09,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1096243311, now seen corresponding path program 1 times [2025-03-09 00:55:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:09,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409633866] [2025-03-09 00:55:09,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:09,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:55:09,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:55:09,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:09,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:10,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-03-09 00:55:10,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:10,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409633866] [2025-03-09 00:55:10,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409633866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:10,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:10,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 00:55:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142430036] [2025-03-09 00:55:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:10,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:55:10,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:10,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:55:10,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:55:11,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 172 [2025-03-09 00:55:11,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 260 flow. Second operand has 11 states, 11 states have (on average 76.63636363636364) internal successors, (843), 11 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:11,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:11,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 172 [2025-03-09 00:55:11,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:11,814 INFO L124 PetriNetUnfolderBase]: 2375/4664 cut-off events. [2025-03-09 00:55:11,814 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-03-09 00:55:11,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9286 conditions, 4664 events. 2375/4664 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 27631 event pairs, 226 based on Foata normal form. 56/4467 useless extension candidates. Maximal degree in co-relation 9279. Up to 2173 conditions per place. [2025-03-09 00:55:11,829 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 154 selfloop transitions, 19 changer transitions 0/201 dead transitions. [2025-03-09 00:55:11,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 201 transitions, 851 flow [2025-03-09 00:55:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:55:11,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 00:55:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 982 transitions. [2025-03-09 00:55:11,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5190274841437632 [2025-03-09 00:55:11,831 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 260 flow. Second operand 11 states and 982 transitions. [2025-03-09 00:55:11,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 201 transitions, 851 flow [2025-03-09 00:55:11,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 201 transitions, 827 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-09 00:55:11,835 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 346 flow [2025-03-09 00:55:11,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=346, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2025-03-09 00:55:11,835 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -49 predicate places. [2025-03-09 00:55:11,835 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 346 flow [2025-03-09 00:55:11,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.63636363636364) internal successors, (843), 11 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:11,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:11,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:11,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:55:11,836 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:11,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash 573709039, now seen corresponding path program 1 times [2025-03-09 00:55:11,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:11,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980278558] [2025-03-09 00:55:11,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:11,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 00:55:11,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 00:55:11,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:11,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:55:11,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:11,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980278558] [2025-03-09 00:55:11,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980278558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:11,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:11,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:11,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708261649] [2025-03-09 00:55:11,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:11,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:11,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:11,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:11,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:11,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-09 00:55:11,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:11,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:11,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-09 00:55:11,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:12,397 INFO L124 PetriNetUnfolderBase]: 3330/7329 cut-off events. [2025-03-09 00:55:12,397 INFO L125 PetriNetUnfolderBase]: For 1674/1740 co-relation queries the response was YES. [2025-03-09 00:55:12,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14796 conditions, 7329 events. 3330/7329 cut-off events. For 1674/1740 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 54336 event pairs, 1490 based on Foata normal form. 183/6957 useless extension candidates. Maximal degree in co-relation 14785. Up to 3220 conditions per place. [2025-03-09 00:55:12,431 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 127 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-03-09 00:55:12,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 823 flow [2025-03-09 00:55:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2025-03-09 00:55:12,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7887596899224806 [2025-03-09 00:55:12,433 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 346 flow. Second operand 3 states and 407 transitions. [2025-03-09 00:55:12,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 823 flow [2025-03-09 00:55:12,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 167 transitions, 788 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-09 00:55:12,438 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 338 flow [2025-03-09 00:55:12,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2025-03-09 00:55:12,439 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-03-09 00:55:12,439 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 338 flow [2025-03-09 00:55:12,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:12,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:12,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:12,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:55:12,439 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1254586864, now seen corresponding path program 1 times [2025-03-09 00:55:12,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:12,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232027809] [2025-03-09 00:55:12,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:12,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:12,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 00:55:12,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 00:55:12,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:12,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 00:55:12,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:12,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232027809] [2025-03-09 00:55:12,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232027809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:12,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:12,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946583274] [2025-03-09 00:55:12,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:12,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:12,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:12,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:12,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:12,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-09 00:55:12,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:12,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:12,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-09 00:55:12,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:13,263 INFO L124 PetriNetUnfolderBase]: 4187/8368 cut-off events. [2025-03-09 00:55:13,264 INFO L125 PetriNetUnfolderBase]: For 2332/2370 co-relation queries the response was YES. [2025-03-09 00:55:13,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18423 conditions, 8368 events. 4187/8368 cut-off events. For 2332/2370 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 58965 event pairs, 2277 based on Foata normal form. 92/7986 useless extension candidates. Maximal degree in co-relation 18410. Up to 5629 conditions per place. [2025-03-09 00:55:13,302 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 104 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-03-09 00:55:13,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 144 transitions, 667 flow [2025-03-09 00:55:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2025-03-09 00:55:13,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7093023255813954 [2025-03-09 00:55:13,303 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 338 flow. Second operand 4 states and 488 transitions. [2025-03-09 00:55:13,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 144 transitions, 667 flow [2025-03-09 00:55:13,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 144 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:13,309 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 352 flow [2025-03-09 00:55:13,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2025-03-09 00:55:13,309 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -48 predicate places. [2025-03-09 00:55:13,309 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 352 flow [2025-03-09 00:55:13,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:13,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:13,310 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:13,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 00:55:13,310 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:13,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1927667799, now seen corresponding path program 1 times [2025-03-09 00:55:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:13,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660750743] [2025-03-09 00:55:13,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:13,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:55:13,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:55:13,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:13,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 00:55:13,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660750743] [2025-03-09 00:55:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660750743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:13,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:13,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513035060] [2025-03-09 00:55:13,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:13,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:13,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:13,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:13,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:13,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-09 00:55:13,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:13,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:13,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-09 00:55:13,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:13,842 INFO L124 PetriNetUnfolderBase]: 2481/5250 cut-off events. [2025-03-09 00:55:13,842 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2025-03-09 00:55:13,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11266 conditions, 5250 events. 2481/5250 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 33856 event pairs, 1218 based on Foata normal form. 124/5126 useless extension candidates. Maximal degree in co-relation 11252. Up to 2282 conditions per place. [2025-03-09 00:55:13,863 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 80 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-03-09 00:55:13,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 523 flow [2025-03-09 00:55:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-03-09 00:55:13,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248062015503876 [2025-03-09 00:55:13,864 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 352 flow. Second operand 3 states and 374 transitions. [2025-03-09 00:55:13,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 523 flow [2025-03-09 00:55:13,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 119 transitions, 501 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 00:55:13,869 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 304 flow [2025-03-09 00:55:13,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2025-03-09 00:55:13,869 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-03-09 00:55:13,869 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 304 flow [2025-03-09 00:55:13,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:13,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:13,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:13,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 00:55:13,869 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:13,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash -678088190, now seen corresponding path program 1 times [2025-03-09 00:55:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:13,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761016514] [2025-03-09 00:55:13,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:13,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:13,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 00:55:13,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 00:55:13,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:13,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 00:55:14,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:14,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761016514] [2025-03-09 00:55:14,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761016514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:14,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:14,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:14,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579096127] [2025-03-09 00:55:14,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:14,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:14,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:14,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:14,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:14,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-09 00:55:14,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:14,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:14,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-09 00:55:14,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:14,365 INFO L124 PetriNetUnfolderBase]: 1512/3602 cut-off events. [2025-03-09 00:55:14,365 INFO L125 PetriNetUnfolderBase]: For 1075/1075 co-relation queries the response was YES. [2025-03-09 00:55:14,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7826 conditions, 3602 events. 1512/3602 cut-off events. For 1075/1075 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 21560 event pairs, 368 based on Foata normal form. 218/3654 useless extension candidates. Maximal degree in co-relation 7813. Up to 1849 conditions per place. [2025-03-09 00:55:14,376 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 72 selfloop transitions, 6 changer transitions 0/116 dead transitions. [2025-03-09 00:55:14,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 116 transitions, 504 flow [2025-03-09 00:55:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-03-09 00:55:14,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248062015503876 [2025-03-09 00:55:14,379 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 304 flow. Second operand 3 states and 374 transitions. [2025-03-09 00:55:14,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 116 transitions, 504 flow [2025-03-09 00:55:14,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:14,383 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 310 flow [2025-03-09 00:55:14,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2025-03-09 00:55:14,383 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-03-09 00:55:14,384 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 310 flow [2025-03-09 00:55:14,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:14,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:14,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:14,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 00:55:14,384 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:14,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1268949368, now seen corresponding path program 1 times [2025-03-09 00:55:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:14,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092490877] [2025-03-09 00:55:14,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:14,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:55:14,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:55:14,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:14,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 00:55:14,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:14,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092490877] [2025-03-09 00:55:14,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092490877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:14,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:14,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:14,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386264559] [2025-03-09 00:55:14,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:14,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:55:14,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:14,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:55:14,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:55:15,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-03-09 00:55:15,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:15,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:15,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-03-09 00:55:15,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:15,460 INFO L124 PetriNetUnfolderBase]: 1512/3353 cut-off events. [2025-03-09 00:55:15,460 INFO L125 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2025-03-09 00:55:15,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7875 conditions, 3353 events. 1512/3353 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18801 event pairs, 1021 based on Foata normal form. 126/3391 useless extension candidates. Maximal degree in co-relation 7862. Up to 2206 conditions per place. [2025-03-09 00:55:15,500 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 67 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2025-03-09 00:55:15,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 101 transitions, 455 flow [2025-03-09 00:55:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2025-03-09 00:55:15,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6209302325581395 [2025-03-09 00:55:15,502 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 310 flow. Second operand 5 states and 534 transitions. [2025-03-09 00:55:15,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 101 transitions, 455 flow [2025-03-09 00:55:15,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:15,505 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 298 flow [2025-03-09 00:55:15,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2025-03-09 00:55:15,505 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-03-09 00:55:15,506 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 96 transitions, 298 flow [2025-03-09 00:55:15,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:15,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:15,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:15,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 00:55:15,507 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:15,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash -387939339, now seen corresponding path program 1 times [2025-03-09 00:55:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:15,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025710102] [2025-03-09 00:55:15,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:15,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:55:15,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:55:15,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:15,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 00:55:15,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:15,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025710102] [2025-03-09 00:55:15,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025710102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:55:15,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357333518] [2025-03-09 00:55:15,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:15,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:15,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:15,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:55:15,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:55:15,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:55:15,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:55:15,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:15,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:15,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 1951 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:55:15,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:55:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 00:55:15,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:55:15,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357333518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:15,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 00:55:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-09 00:55:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971539163] [2025-03-09 00:55:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:15,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:15,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:15,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:15,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-09 00:55:15,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:15,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:15,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-09 00:55:15,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:16,184 INFO L124 PetriNetUnfolderBase]: 1512/3356 cut-off events. [2025-03-09 00:55:16,184 INFO L125 PetriNetUnfolderBase]: For 1154/1154 co-relation queries the response was YES. [2025-03-09 00:55:16,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7762 conditions, 3356 events. 1512/3356 cut-off events. For 1154/1154 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 18831 event pairs, 1201 based on Foata normal form. 5/3259 useless extension candidates. Maximal degree in co-relation 7748. Up to 2625 conditions per place. [2025-03-09 00:55:16,196 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 63 selfloop transitions, 1 changer transitions 2/95 dead transitions. [2025-03-09 00:55:16,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 95 transitions, 426 flow [2025-03-09 00:55:16,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2025-03-09 00:55:16,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2025-03-09 00:55:16,200 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 298 flow. Second operand 3 states and 358 transitions. [2025-03-09 00:55:16,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 95 transitions, 426 flow [2025-03-09 00:55:16,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 95 transitions, 418 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:55:16,204 INFO L231 Difference]: Finished difference. Result has 104 places, 93 transitions, 285 flow [2025-03-09 00:55:16,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=104, PETRI_TRANSITIONS=93} [2025-03-09 00:55:16,205 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -58 predicate places. [2025-03-09 00:55:16,205 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 93 transitions, 285 flow [2025-03-09 00:55:16,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:16,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:16,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:16,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:55:16,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 00:55:16,405 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-09 00:55:16,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1520032443, now seen corresponding path program 1 times [2025-03-09 00:55:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091733784] [2025-03-09 00:55:16,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:16,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:55:16,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:55:16,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:16,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 00:55:17,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091733784] [2025-03-09 00:55:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091733784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:55:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100559239] [2025-03-09 00:55:17,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:17,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:17,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:17,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:55:17,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:55:17,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:55:18,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:55:18,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:18,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:18,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 2005 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-09 00:55:18,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:55:18,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:55:18,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-09 00:55:18,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:55:18,267 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:55:18,287 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-03-09 00:55:18,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-09 00:55:18,311 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:55:18,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2025-03-09 00:55:18,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-09 00:55:18,505 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-09 00:55:18,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2025-03-09 00:55:18,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 00:55:18,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-09 00:55:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:55:18,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:55:39,491 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2025-03-09 00:55:39,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 183 [2025-03-09 00:55:39,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:55:39,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 155 [2025-03-09 00:55:39,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-09 00:55:39,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:55:39,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 238 [2025-03-09 00:55:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:55:39,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100559239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:55:39,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:55:39,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 39 [2025-03-09 00:55:39,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020716000] [2025-03-09 00:55:39,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:55:39,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 00:55:39,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:39,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 00:55:39,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1309, Unknown=5, NotChecked=0, Total=1560 [2025-03-09 00:55:43,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 00:55:47,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 00:55:51,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 00:55:56,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 00:56:00,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 00:56:04,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 00:56:08,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]