./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue.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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:41:50,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:41:50,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:41:50,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:41:50,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:41:50,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:41:50,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:41:50,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:41:50,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:41:50,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:41:50,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:41:50,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:41:50,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:41:50,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:41:50,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:41:50,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:41:50,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:41:50,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:41:50,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:41:50,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:41:50,098 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:41:50,098 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:41:50,098 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:41:50,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:41:50,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:41:50,099 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:41:50,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:41:50,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:41:50,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:41:50,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:41:50,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:41:50,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:41:50,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:41:50,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:41:50,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:41:50,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:41:50,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:41:50,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:41:50,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:41:50,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:41:50,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:41:50,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:41:50,101 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2025-03-04 09:41:50,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:41:50,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:41:50,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:41:50,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:41:50,328 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:41:50,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-03-04 09:41:51,492 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe49cdbf/deb4df98691c4d0dae2c4aff24a84106/FLAG56506631b [2025-03-04 09:41:51,774 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:41:51,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-03-04 09:41:51,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe49cdbf/deb4df98691c4d0dae2c4aff24a84106/FLAG56506631b [2025-03-04 09:41:52,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe49cdbf/deb4df98691c4d0dae2c4aff24a84106 [2025-03-04 09:41:52,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:41:52,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:41:52,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:41:52,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:41:52,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:41:52,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1b5edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52, skipping insertion in model container [2025-03-04 09:41:52,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:41:52,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:41:52,439 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:41:52,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:41:52,519 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:41:52,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52 WrapperNode [2025-03-04 09:41:52,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:41:52,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:41:52,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:41:52,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:41:52,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,572 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 289 [2025-03-04 09:41:52,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:41:52,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:41:52,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:41:52,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:41:52,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,592 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14]. [2025-03-04 09:41:52,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:41:52,608 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:41:52,608 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:41:52,609 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:41:52,609 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (1/1) ... [2025-03-04 09:41:52,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:41:52,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:41:52,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:41:52,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:41:52,657 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:41:52,658 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:41:52,658 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:41:52,658 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:41:52,658 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:41:52,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:41:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:41:52,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:41:52,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:41:52,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:41:52,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 09:41:52,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 09:41:52,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:41:52,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:41:52,662 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:41:52,771 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:41:52,773 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:41:53,209 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:41:53,209 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:41:53,396 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:41:53,396 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:41:53,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:41:53 BoogieIcfgContainer [2025-03-04 09:41:53,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:41:53,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:41:53,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:41:53,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:41:53,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:41:52" (1/3) ... [2025-03-04 09:41:53,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c1f1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:41:53, skipping insertion in model container [2025-03-04 09:41:53,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:52" (2/3) ... [2025-03-04 09:41:53,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c1f1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:41:53, skipping insertion in model container [2025-03-04 09:41:53,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:41:53" (3/3) ... [2025-03-04 09:41:53,403 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-04 09:41:53,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:41:53,414 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 159 locations, 1 initial locations, 2 loop locations, and 72 error locations. [2025-03-04 09:41:53,414 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:41:53,496 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 09:41:53,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 358 flow [2025-03-04 09:41:53,576 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events. [2025-03-04 09:41:53,578 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:41:53,583 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 521 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-04 09:41:53,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 358 flow [2025-03-04 09:41:53,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 169 transitions, 350 flow [2025-03-04 09:41:53,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:41:53,606 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;@644eecc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:41:53,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 134 error locations. [2025-03-04 09:41:53,609 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:41:53,609 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-04 09:41:53,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:41:53,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:53,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:41:53,610 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-04 09:41:53,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash 26578, now seen corresponding path program 1 times [2025-03-04 09:41:53,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:53,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079190884] [2025-03-04 09:41:53,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:53,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:53,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:41:53,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:41:53,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:53,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:53,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:53,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079190884] [2025-03-04 09:41:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079190884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:53,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:53,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:41:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914341471] [2025-03-04 09:41:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:53,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:41:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:53,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:41:53,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:41:54,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-04 09:41:54,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:54,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:54,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-04 09:41:54,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:54,520 INFO L124 PetriNetUnfolderBase]: 1744/4652 cut-off events. [2025-03-04 09:41:54,520 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-04 09:41:54,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7477 conditions, 4652 events. 1744/4652 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36989 event pairs, 1393 based on Foata normal form. 182/3586 useless extension candidates. Maximal degree in co-relation 7362. Up to 2744 conditions per place. [2025-03-04 09:41:54,549 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 57 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-03-04 09:41:54,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 436 flow [2025-03-04 09:41:54,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:41:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:41:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-03-04 09:41:54,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473 [2025-03-04 09:41:54,563 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 350 flow. Second operand 3 states and 364 transitions. [2025-03-04 09:41:54,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 436 flow [2025-03-04 09:41:54,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 153 transitions, 428 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:41:54,571 INFO L231 Difference]: Finished difference. Result has 150 places, 153 transitions, 314 flow [2025-03-04 09:41:54,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=150, PETRI_TRANSITIONS=153} [2025-03-04 09:41:54,575 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -12 predicate places. [2025-03-04 09:41:54,575 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 153 transitions, 314 flow [2025-03-04 09:41:54,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:54,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:54,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:41:54,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:41:54,576 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-04 09:41:54,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash 26579, now seen corresponding path program 1 times [2025-03-04 09:41:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:54,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363702554] [2025-03-04 09:41:54,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:54,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:41:54,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:41:54,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:54,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:54,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363702554] [2025-03-04 09:41:54,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363702554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:54,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:54,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:41:54,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296168805] [2025-03-04 09:41:54,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:54,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:41:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:54,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:41:54,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:41:54,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-04 09:41:54,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 153 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:54,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:54,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-04 09:41:54,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:55,256 INFO L124 PetriNetUnfolderBase]: 1744/4649 cut-off events. [2025-03-04 09:41:55,256 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 09:41:55,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7428 conditions, 4649 events. 1744/4649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37003 event pairs, 1393 based on Foata normal form. 3/3406 useless extension candidates. Maximal degree in co-relation 7417. Up to 2744 conditions per place. [2025-03-04 09:41:55,283 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 57 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-03-04 09:41:55,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 150 transitions, 426 flow [2025-03-04 09:41:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:41:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:41:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-03-04 09:41:55,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957364341085271 [2025-03-04 09:41:55,287 INFO L175 Difference]: Start difference. First operand has 150 places, 153 transitions, 314 flow. Second operand 3 states and 359 transitions. [2025-03-04 09:41:55,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 150 transitions, 426 flow [2025-03-04 09:41:55,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 150 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:41:55,290 INFO L231 Difference]: Finished difference. Result has 147 places, 150 transitions, 308 flow [2025-03-04 09:41:55,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=150} [2025-03-04 09:41:55,290 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -15 predicate places. [2025-03-04 09:41:55,290 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 150 transitions, 308 flow [2025-03-04 09:41:55,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:55,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:55,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:41:55,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:41:55,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:41:55,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 792471235, now seen corresponding path program 1 times [2025-03-04 09:41:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864716066] [2025-03-04 09:41:55,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:55,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:41:55,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:41:55,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:55,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:55,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-04 09:41:55,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:55,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864716066] [2025-03-04 09:41:55,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864716066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:55,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:55,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:41:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046526134] [2025-03-04 09:41:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:55,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:41:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:55,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:41:55,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:41:55,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 172 [2025-03-04 09:41:55,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 150 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:55,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:55,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 172 [2025-03-04 09:41:55,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:55,890 INFO L124 PetriNetUnfolderBase]: 1744/4647 cut-off events. [2025-03-04 09:41:55,890 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:41:55,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 4647 events. 1744/4647 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36962 event pairs, 1393 based on Foata normal form. 0/3404 useless extension candidates. Maximal degree in co-relation 7416. Up to 2743 conditions per place. [2025-03-04 09:41:55,912 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 59 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2025-03-04 09:41:55,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 148 transitions, 428 flow [2025-03-04 09:41:55,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:41:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:41:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2025-03-04 09:41:55,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2025-03-04 09:41:55,914 INFO L175 Difference]: Start difference. First operand has 147 places, 150 transitions, 308 flow. Second operand 4 states and 440 transitions. [2025-03-04 09:41:55,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 148 transitions, 428 flow [2025-03-04 09:41:55,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 148 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:41:55,917 INFO L231 Difference]: Finished difference. Result has 146 places, 148 transitions, 306 flow [2025-03-04 09:41:55,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=146, PETRI_TRANSITIONS=148} [2025-03-04 09:41:55,918 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -16 predicate places. [2025-03-04 09:41:55,918 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 148 transitions, 306 flow [2025-03-04 09:41:55,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:55,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:55,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:41:55,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:41:55,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:41:55,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash 792471236, now seen corresponding path program 1 times [2025-03-04 09:41:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:55,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411616076] [2025-03-04 09:41:55,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:55,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:41:55,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:41:55,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:55,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:56,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:56,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411616076] [2025-03-04 09:41:56,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411616076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:56,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:56,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:41:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401345394] [2025-03-04 09:41:56,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:56,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:41:56,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:56,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:41:56,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:41:56,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-04 09:41:56,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 148 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:56,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:56,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-04 09:41:56,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:56,519 INFO L124 PetriNetUnfolderBase]: 1744/4645 cut-off events. [2025-03-04 09:41:56,519 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 09:41:56,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7425 conditions, 4645 events. 1744/4645 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37010 event pairs, 1393 based on Foata normal form. 2/3404 useless extension candidates. Maximal degree in co-relation 7410. Up to 2743 conditions per place. [2025-03-04 09:41:56,538 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 56 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2025-03-04 09:41:56,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 420 flow [2025-03-04 09:41:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:41:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:41:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2025-03-04 09:41:56,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6700581395348837 [2025-03-04 09:41:56,541 INFO L175 Difference]: Start difference. First operand has 146 places, 148 transitions, 306 flow. Second operand 4 states and 461 transitions. [2025-03-04 09:41:56,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 420 flow [2025-03-04 09:41:56,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 146 transitions, 414 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:41:56,546 INFO L231 Difference]: Finished difference. Result has 144 places, 146 transitions, 302 flow [2025-03-04 09:41:56,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=144, PETRI_TRANSITIONS=146} [2025-03-04 09:41:56,547 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -18 predicate places. [2025-03-04 09:41:56,547 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 146 transitions, 302 flow [2025-03-04 09:41:56,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:56,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:56,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:56,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:41:56,548 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-04 09:41:56,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1141137535, now seen corresponding path program 1 times [2025-03-04 09:41:56,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:56,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535750081] [2025-03-04 09:41:56,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:56,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:41:56,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:41:56,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:56,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535750081] [2025-03-04 09:41:56,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535750081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:56,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:41:56,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738185251] [2025-03-04 09:41:56,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:56,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:41:56,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:56,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:41:56,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:41:56,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 172 [2025-03-04 09:41:56,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 146 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:56,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:56,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 172 [2025-03-04 09:41:56,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:57,217 INFO L124 PetriNetUnfolderBase]: 2019/4462 cut-off events. [2025-03-04 09:41:57,217 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 09:41:57,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7725 conditions, 4462 events. 2019/4462 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 31654 event pairs, 705 based on Foata normal form. 0/3898 useless extension candidates. Maximal degree in co-relation 7708. Up to 1807 conditions per place. [2025-03-04 09:41:57,233 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 80 selfloop transitions, 6 changer transitions 0/149 dead transitions. [2025-03-04 09:41:57,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 149 transitions, 481 flow [2025-03-04 09:41:57,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:41:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:41:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2025-03-04 09:41:57,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5546511627906977 [2025-03-04 09:41:57,235 INFO L175 Difference]: Start difference. First operand has 144 places, 146 transitions, 302 flow. Second operand 5 states and 477 transitions. [2025-03-04 09:41:57,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 149 transitions, 481 flow [2025-03-04 09:41:57,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 149 transitions, 475 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:41:57,236 INFO L231 Difference]: Finished difference. Result has 129 places, 130 transitions, 276 flow [2025-03-04 09:41:57,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=129, PETRI_TRANSITIONS=130} [2025-03-04 09:41:57,237 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -33 predicate places. [2025-03-04 09:41:57,237 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 130 transitions, 276 flow [2025-03-04 09:41:57,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:57,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:57,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:57,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:41:57,242 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-04 09:41:57,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:57,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1141137534, now seen corresponding path program 1 times [2025-03-04 09:41:57,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:57,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858092221] [2025-03-04 09:41:57,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:57,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:41:57,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:41:57,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:57,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:57,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858092221] [2025-03-04 09:41:57,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858092221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:57,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:57,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:41:57,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821398325] [2025-03-04 09:41:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:57,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:41:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:57,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:41:57,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:41:57,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 172 [2025-03-04 09:41:57,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 130 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:57,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:57,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 172 [2025-03-04 09:41:57,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:57,991 INFO L124 PetriNetUnfolderBase]: 1703/3675 cut-off events. [2025-03-04 09:41:57,991 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-03-04 09:41:57,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 3675 events. 1703/3675 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 24460 event pairs, 702 based on Foata normal form. 204/3340 useless extension candidates. Maximal degree in co-relation 2518. Up to 1412 conditions per place. [2025-03-04 09:41:58,003 INFO L140 encePairwiseOnDemand]: 152/172 looper letters, 72 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2025-03-04 09:41:58,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 443 flow [2025-03-04 09:41:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:41:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:41:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2025-03-04 09:41:58,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6186046511627907 [2025-03-04 09:41:58,005 INFO L175 Difference]: Start difference. First operand has 129 places, 130 transitions, 276 flow. Second operand 5 states and 532 transitions. [2025-03-04 09:41:58,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 443 flow [2025-03-04 09:41:58,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 135 transitions, 431 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:41:58,007 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 248 flow [2025-03-04 09:41:58,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2025-03-04 09:41:58,007 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -47 predicate places. [2025-03-04 09:41:58,008 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 248 flow [2025-03-04 09:41:58,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:58,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:58,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:58,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:41:58,008 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-04 09:41:58,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1015524418, now seen corresponding path program 1 times [2025-03-04 09:41:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:58,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904920199] [2025-03-04 09:41:58,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:58,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:41:58,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:41:58,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:58,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:58,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:58,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904920199] [2025-03-04 09:41:58,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904920199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:58,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:58,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:41:58,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899896499] [2025-03-04 09:41:58,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:58,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:41:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:58,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:41:58,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:41:58,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 172 [2025-03-04 09:41:58,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:58,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:58,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 172 [2025-03-04 09:41:58,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:59,202 INFO L124 PetriNetUnfolderBase]: 2502/5391 cut-off events. [2025-03-04 09:41:59,202 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-04 09:41:59,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9548 conditions, 5391 events. 2502/5391 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 38743 event pairs, 536 based on Foata normal form. 0/4393 useless extension candidates. Maximal degree in co-relation 3717. Up to 3436 conditions per place. [2025-03-04 09:41:59,216 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 124 selfloop transitions, 11 changer transitions 0/183 dead transitions. [2025-03-04 09:41:59,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 183 transitions, 657 flow [2025-03-04 09:41:59,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:41:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:41:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 669 transitions. [2025-03-04 09:41:59,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5556478405315615 [2025-03-04 09:41:59,219 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 248 flow. Second operand 7 states and 669 transitions. [2025-03-04 09:41:59,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 183 transitions, 657 flow [2025-03-04 09:41:59,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 643 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:41:59,225 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 310 flow [2025-03-04 09:41:59,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2025-03-04 09:41:59,227 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -41 predicate places. [2025-03-04 09:41:59,227 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 310 flow [2025-03-04 09:41:59,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:59,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:59,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:59,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:41:59,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:41:59,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:59,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1492806931, now seen corresponding path program 1 times [2025-03-04 09:41:59,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:59,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19022724] [2025-03-04 09:41:59,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:59,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:59,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:41:59,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:41:59,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:59,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:59,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:59,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19022724] [2025-03-04 09:41:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19022724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:41:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177751305] [2025-03-04 09:41:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:59,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:41:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:59,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:41:59,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:41:59,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-03-04 09:41:59,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 310 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-04 09:41:59,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:59,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-03-04 09:41:59,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:59,496 INFO L124 PetriNetUnfolderBase]: 1382/3218 cut-off events. [2025-03-04 09:41:59,496 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 09:41:59,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 3218 events. 1382/3218 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19610 event pairs, 703 based on Foata normal form. 55/2726 useless extension candidates. Maximal degree in co-relation 5605. Up to 1211 conditions per place. [2025-03-04 09:41:59,507 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 80 selfloop transitions, 3 changer transitions 0/139 dead transitions. [2025-03-04 09:41:59,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 139 transitions, 476 flow [2025-03-04 09:41:59,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:41:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:41:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2025-03-04 09:41:59,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-03-04 09:41:59,509 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 310 flow. Second operand 3 states and 390 transitions. [2025-03-04 09:41:59,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 139 transitions, 476 flow [2025-03-04 09:41:59,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 139 transitions, 451 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-04 09:41:59,512 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 249 flow [2025-03-04 09:41:59,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=114, PETRI_TRANSITIONS=116} [2025-03-04 09:41:59,512 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -48 predicate places. [2025-03-04 09:41:59,512 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 249 flow [2025-03-04 09:41:59,512 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-04 09:41:59,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:59,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:59,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:41:59,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:41:59,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:59,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1062440787, now seen corresponding path program 1 times [2025-03-04 09:41:59,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:59,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386521161] [2025-03-04 09:41:59,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:59,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:59,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 09:41:59,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 09:41:59,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:59,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:59,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:59,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386521161] [2025-03-04 09:41:59,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386521161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:59,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:59,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:41:59,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401250695] [2025-03-04 09:41:59,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:59,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:41:59,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:59,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:41:59,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:41:59,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-04 09:41:59,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:59,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:59,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-04 09:41:59,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:59,820 INFO L124 PetriNetUnfolderBase]: 1392/3289 cut-off events. [2025-03-04 09:41:59,820 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-04 09:41:59,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5671 conditions, 3289 events. 1392/3289 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20477 event pairs, 1089 based on Foata normal form. 77/2806 useless extension candidates. Maximal degree in co-relation 5666. Up to 2215 conditions per place. [2025-03-04 09:41:59,829 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 59 selfloop transitions, 1 changer transitions 0/113 dead transitions. [2025-03-04 09:41:59,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 363 flow [2025-03-04 09:41:59,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:41:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:41:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-03-04 09:41:59,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957364341085271 [2025-03-04 09:41:59,831 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 249 flow. Second operand 3 states and 359 transitions. [2025-03-04 09:41:59,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 363 flow [2025-03-04 09:41:59,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:41:59,832 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 242 flow [2025-03-04 09:41:59,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-03-04 09:41:59,833 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places. [2025-03-04 09:41:59,833 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 242 flow [2025-03-04 09:41:59,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:41:59,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:59,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:59,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:41:59,833 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-04 09:41:59,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1062440786, now seen corresponding path program 1 times [2025-03-04 09:41:59,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:59,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475774622] [2025-03-04 09:41:59,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:59,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 09:41:59,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 09:41:59,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:59,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:59,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:59,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475774622] [2025-03-04 09:41:59,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475774622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:59,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:59,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:41:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435602865] [2025-03-04 09:41:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:59,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:41:59,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:59,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:41:59,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:00,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-04 09:42:00,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 242 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-04 09:42:00,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:00,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-04 09:42:00,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:00,191 INFO L124 PetriNetUnfolderBase]: 1392/3277 cut-off events. [2025-03-04 09:42:00,191 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 09:42:00,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5646 conditions, 3277 events. 1392/3277 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20349 event pairs, 1089 based on Foata normal form. 0/2717 useless extension candidates. Maximal degree in co-relation 5641. Up to 2215 conditions per place. [2025-03-04 09:42:00,200 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 59 selfloop transitions, 1 changer transitions 0/112 dead transitions. [2025-03-04 09:42:00,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 360 flow [2025-03-04 09:42:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-03-04 09:42:00,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7034883720930233 [2025-03-04 09:42:00,201 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 242 flow. Second operand 3 states and 363 transitions. [2025-03-04 09:42:00,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 360 flow [2025-03-04 09:42:00,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:00,202 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 241 flow [2025-03-04 09:42:00,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2025-03-04 09:42:00,204 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places. [2025-03-04 09:42:00,204 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 241 flow [2025-03-04 09:42:00,205 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-04 09:42:00,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:00,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] [2025-03-04 09:42:00,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:42:00,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:00,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1424074895, now seen corresponding path program 1 times [2025-03-04 09:42:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:00,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725123760] [2025-03-04 09:42:00,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:00,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:00,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:42:00,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:42:00,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:00,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:00,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:00,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725123760] [2025-03-04 09:42:00,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725123760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:00,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:00,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:42:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072514065] [2025-03-04 09:42:00,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:00,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:42:00,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:00,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:42:00,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:42:00,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 172 [2025-03-04 09:42:00,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:00,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:00,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 172 [2025-03-04 09:42:00,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:00,734 INFO L124 PetriNetUnfolderBase]: 1409/3270 cut-off events. [2025-03-04 09:42:00,734 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 09:42:00,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5672 conditions, 3270 events. 1409/3270 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20092 event pairs, 1074 based on Foata normal form. 0/2746 useless extension candidates. Maximal degree in co-relation 5667. Up to 2185 conditions per place. [2025-03-04 09:42:00,744 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 67 selfloop transitions, 4 changer transitions 0/118 dead transitions. [2025-03-04 09:42:00,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 118 transitions, 396 flow [2025-03-04 09:42:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2025-03-04 09:42:00,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6302325581395349 [2025-03-04 09:42:00,746 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 241 flow. Second operand 5 states and 542 transitions. [2025-03-04 09:42:00,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 118 transitions, 396 flow [2025-03-04 09:42:00,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 118 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:00,748 INFO L231 Difference]: Finished difference. Result has 113 places, 110 transitions, 244 flow [2025-03-04 09:42:00,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2025-03-04 09:42:00,748 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -49 predicate places. [2025-03-04 09:42:00,749 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 244 flow [2025-03-04 09:42:00,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:00,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:00,749 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-04 09:42:00,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:42:00,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:00,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1424074896, now seen corresponding path program 1 times [2025-03-04 09:42:00,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:00,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137023446] [2025-03-04 09:42:00,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:00,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:00,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:42:00,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:42:00,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:00,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:00,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137023446] [2025-03-04 09:42:00,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137023446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:00,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:00,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:42:00,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655534201] [2025-03-04 09:42:00,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:00,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:42:00,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:00,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:42:00,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:42:01,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-04 09:42:01,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:01,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:01,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-04 09:42:01,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:01,502 INFO L124 PetriNetUnfolderBase]: 1392/3229 cut-off events. [2025-03-04 09:42:01,502 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-04 09:42:01,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5626 conditions, 3229 events. 1392/3229 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 19830 event pairs, 1074 based on Foata normal form. 24/2729 useless extension candidates. Maximal degree in co-relation 5621. Up to 2185 conditions per place. [2025-03-04 09:42:01,509 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 65 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2025-03-04 09:42:01,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 116 transitions, 395 flow [2025-03-04 09:42:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2025-03-04 09:42:01,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6569767441860465 [2025-03-04 09:42:01,511 INFO L175 Difference]: Start difference. First operand has 113 places, 110 transitions, 244 flow. Second operand 5 states and 565 transitions. [2025-03-04 09:42:01,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 116 transitions, 395 flow [2025-03-04 09:42:01,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:01,513 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 240 flow [2025-03-04 09:42:01,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2025-03-04 09:42:01,515 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-03-04 09:42:01,515 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 240 flow [2025-03-04 09:42:01,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:01,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:01,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:01,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:42:01,516 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:01,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1196616915, now seen corresponding path program 1 times [2025-03-04 09:42:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:01,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276460608] [2025-03-04 09:42:01,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:01,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:42:01,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:42:01,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:01,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276460608] [2025-03-04 09:42:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276460608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:01,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:01,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:01,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444342514] [2025-03-04 09:42:01,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:01,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:01,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:01,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:01,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:01,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-03-04 09:42:01,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:01,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:01,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-03-04 09:42:01,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:01,745 INFO L124 PetriNetUnfolderBase]: 1380/3217 cut-off events. [2025-03-04 09:42:01,745 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-04 09:42:01,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 3217 events. 1380/3217 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 19780 event pairs, 1074 based on Foata normal form. 0/2705 useless extension candidates. Maximal degree in co-relation 5596. Up to 2175 conditions per place. [2025-03-04 09:42:01,756 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 65 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-03-04 09:42:01,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 115 transitions, 389 flow [2025-03-04 09:42:01,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-03-04 09:42:01,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7228682170542635 [2025-03-04 09:42:01,758 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 240 flow. Second operand 3 states and 373 transitions. [2025-03-04 09:42:01,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 115 transitions, 389 flow [2025-03-04 09:42:01,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 381 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:01,760 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 234 flow [2025-03-04 09:42:01,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-03-04 09:42:01,760 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -53 predicate places. [2025-03-04 09:42:01,760 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 234 flow [2025-03-04 09:42:01,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:01,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:01,761 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] [2025-03-04 09:42:01,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:42:01,761 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-04 09:42:01,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:01,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1638280557, now seen corresponding path program 1 times [2025-03-04 09:42:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:01,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240126494] [2025-03-04 09:42:01,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:01,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 09:42:01,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 09:42:01,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:01,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:02,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:02,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240126494] [2025-03-04 09:42:02,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240126494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:02,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:02,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 09:42:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853224270] [2025-03-04 09:42:02,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:02,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:42:02,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:02,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:42:02,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:42:02,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-03-04 09:42:02,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 234 flow. Second operand has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:02,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:02,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-03-04 09:42:02,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:02,800 INFO L124 PetriNetUnfolderBase]: 1717/3744 cut-off events. [2025-03-04 09:42:02,800 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-04 09:42:02,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6748 conditions, 3744 events. 1717/3744 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 22669 event pairs, 388 based on Foata normal form. 0/3242 useless extension candidates. Maximal degree in co-relation 6743. Up to 2364 conditions per place. [2025-03-04 09:42:02,808 INFO L140 encePairwiseOnDemand]: 159/172 looper letters, 116 selfloop transitions, 12 changer transitions 0/167 dead transitions. [2025-03-04 09:42:02,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 167 transitions, 620 flow [2025-03-04 09:42:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:42:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:42:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 965 transitions. [2025-03-04 09:42:02,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233850129198967 [2025-03-04 09:42:02,811 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 234 flow. Second operand 9 states and 965 transitions. [2025-03-04 09:42:02,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 167 transitions, 620 flow [2025-03-04 09:42:02,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 167 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:42:02,813 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 266 flow [2025-03-04 09:42:02,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=266, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2025-03-04 09:42:02,813 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -47 predicate places. [2025-03-04 09:42:02,813 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 266 flow [2025-03-04 09:42:02,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:02,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:02,814 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-04 09:42:02,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:42:02,814 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-04 09:42:02,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1859889225, now seen corresponding path program 1 times [2025-03-04 09:42:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:02,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315018090] [2025-03-04 09:42:02,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:02,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:02,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 09:42:02,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 09:42:02,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:02,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:03,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:03,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315018090] [2025-03-04 09:42:03,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315018090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:03,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:03,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 09:42:03,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763308719] [2025-03-04 09:42:03,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:42:03,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:03,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:42:03,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:42:04,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 172 [2025-03-04 09:42:04,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 266 flow. Second operand has 15 states, 15 states have (on average 93.6) internal successors, (1404), 15 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:04,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:04,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 172 [2025-03-04 09:42:04,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:05,000 INFO L124 PetriNetUnfolderBase]: 1711/3617 cut-off events. [2025-03-04 09:42:05,000 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-04 09:42:05,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6915 conditions, 3617 events. 1711/3617 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 21390 event pairs, 438 based on Foata normal form. 0/3215 useless extension candidates. Maximal degree in co-relation 6909. Up to 2065 conditions per place. [2025-03-04 09:42:05,011 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 128 selfloop transitions, 14 changer transitions 0/177 dead transitions. [2025-03-04 09:42:05,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 177 transitions, 698 flow [2025-03-04 09:42:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:42:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 09:42:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1335 transitions. [2025-03-04 09:42:05,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5970483005366727 [2025-03-04 09:42:05,014 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 266 flow. Second operand 13 states and 1335 transitions. [2025-03-04 09:42:05,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 177 transitions, 698 flow [2025-03-04 09:42:05,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 177 transitions, 678 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 09:42:05,017 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 274 flow [2025-03-04 09:42:05,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=274, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2025-03-04 09:42:05,017 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -45 predicate places. [2025-03-04 09:42:05,017 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 274 flow [2025-03-04 09:42:05,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 93.6) internal successors, (1404), 15 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:05,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:05,018 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] [2025-03-04 09:42:05,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:42:05,018 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:05,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash -726759521, now seen corresponding path program 1 times [2025-03-04 09:42:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:05,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003717094] [2025-03-04 09:42:05,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:05,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 09:42:05,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 09:42:05,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:05,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:05,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:05,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003717094] [2025-03-04 09:42:05,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003717094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:05,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:05,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 09:42:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716078025] [2025-03-04 09:42:05,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:05,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:42:05,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:05,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:42:05,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:42:06,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 172 [2025-03-04 09:42:06,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 274 flow. Second operand has 14 states, 14 states have (on average 74.07142857142857) internal successors, (1037), 14 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:06,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:06,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 172 [2025-03-04 09:42:06,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:07,635 INFO L124 PetriNetUnfolderBase]: 2375/4903 cut-off events. [2025-03-04 09:42:07,636 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-03-04 09:42:07,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9525 conditions, 4903 events. 2375/4903 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 31163 event pairs, 226 based on Foata normal form. 56/4466 useless extension candidates. Maximal degree in co-relation 9518. Up to 2173 conditions per place. [2025-03-04 09:42:07,648 INFO L140 encePairwiseOnDemand]: 155/172 looper letters, 152 selfloop transitions, 21 changer transitions 0/208 dead transitions. [2025-03-04 09:42:07,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 208 transitions, 865 flow [2025-03-04 09:42:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:42:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 09:42:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1104 transitions. [2025-03-04 09:42:07,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4937388193202147 [2025-03-04 09:42:07,652 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 274 flow. Second operand 13 states and 1104 transitions. [2025-03-04 09:42:07,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 208 transitions, 865 flow [2025-03-04 09:42:07,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 208 transitions, 841 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-04 09:42:07,656 INFO L231 Difference]: Finished difference. Result has 122 places, 115 transitions, 364 flow [2025-03-04 09:42:07,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=364, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2025-03-04 09:42:07,657 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -40 predicate places. [2025-03-04 09:42:07,658 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 364 flow [2025-03-04 09:42:07,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 74.07142857142857) internal successors, (1037), 14 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:07,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:07,658 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] [2025-03-04 09:42:07,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:42:07,658 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:07,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -908741947, now seen corresponding path program 1 times [2025-03-04 09:42:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:07,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794874486] [2025-03-04 09:42:07,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:07,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 09:42:07,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 09:42:07,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:07,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 09:42:07,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:07,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794874486] [2025-03-04 09:42:07,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794874486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:07,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:07,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:07,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572559149] [2025-03-04 09:42:07,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:07,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:07,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:07,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:07,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:07,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-03-04 09:42:07,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:07,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:07,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-03-04 09:42:07,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:08,134 INFO L124 PetriNetUnfolderBase]: 3330/8018 cut-off events. [2025-03-04 09:42:08,134 INFO L125 PetriNetUnfolderBase]: For 1674/1740 co-relation queries the response was YES. [2025-03-04 09:42:08,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15486 conditions, 8018 events. 3330/8018 cut-off events. For 1674/1740 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 65484 event pairs, 1490 based on Foata normal form. 183/6956 useless extension candidates. Maximal degree in co-relation 15475. Up to 3219 conditions per place. [2025-03-04 09:42:08,156 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 126 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2025-03-04 09:42:08,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 174 transitions, 839 flow [2025-03-04 09:42:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2025-03-04 09:42:08,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7926356589147286 [2025-03-04 09:42:08,158 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 364 flow. Second operand 3 states and 409 transitions. [2025-03-04 09:42:08,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 174 transitions, 839 flow [2025-03-04 09:42:08,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 174 transitions, 800 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-04 09:42:08,162 INFO L231 Difference]: Finished difference. Result has 118 places, 116 transitions, 352 flow [2025-03-04 09:42:08,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=118, PETRI_TRANSITIONS=116} [2025-03-04 09:42:08,162 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -44 predicate places. [2025-03-04 09:42:08,162 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 116 transitions, 352 flow [2025-03-04 09:42:08,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:08,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:08,163 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] [2025-03-04 09:42:08,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:42:08,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:08,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 482238435, now seen corresponding path program 1 times [2025-03-04 09:42:08,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:08,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705040491] [2025-03-04 09:42:08,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:08,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:08,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 09:42:08,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 09:42:08,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:08,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 09:42:08,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:08,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705040491] [2025-03-04 09:42:08,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705040491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:42:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519241390] [2025-03-04 09:42:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:08,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:42:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:08,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:42:08,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:42:08,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-04 09:42:08,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 116 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:08,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:08,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-04 09:42:08,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:08,876 INFO L124 PetriNetUnfolderBase]: 4187/8630 cut-off events. [2025-03-04 09:42:08,876 INFO L125 PetriNetUnfolderBase]: For 2335/2373 co-relation queries the response was YES. [2025-03-04 09:42:08,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18684 conditions, 8630 events. 4187/8630 cut-off events. For 2335/2373 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 63227 event pairs, 2277 based on Foata normal form. 92/7971 useless extension candidates. Maximal degree in co-relation 18671. Up to 5628 conditions per place. [2025-03-04 09:42:08,909 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 103 selfloop transitions, 3 changer transitions 0/151 dead transitions. [2025-03-04 09:42:08,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 151 transitions, 679 flow [2025-03-04 09:42:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:42:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:42:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2025-03-04 09:42:08,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7136627906976745 [2025-03-04 09:42:08,911 INFO L175 Difference]: Start difference. First operand has 118 places, 116 transitions, 352 flow. Second operand 4 states and 491 transitions. [2025-03-04 09:42:08,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 151 transitions, 679 flow [2025-03-04 09:42:08,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 151 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:08,916 INFO L231 Difference]: Finished difference. Result has 121 places, 117 transitions, 366 flow [2025-03-04 09:42:08,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=121, PETRI_TRANSITIONS=117} [2025-03-04 09:42:08,917 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -41 predicate places. [2025-03-04 09:42:08,917 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 117 transitions, 366 flow [2025-03-04 09:42:08,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:08,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:08,918 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] [2025-03-04 09:42:08,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:42:08,918 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-04 09:42:08,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1574549436, now seen corresponding path program 1 times [2025-03-04 09:42:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:08,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073186696] [2025-03-04 09:42:08,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:08,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 09:42:08,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 09:42:08,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:08,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 09:42:08,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:08,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073186696] [2025-03-04 09:42:08,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073186696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:08,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:08,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:08,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141386705] [2025-03-04 09:42:08,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:08,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:08,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:08,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:08,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-04 09:42:08,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:08,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:08,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-04 09:42:08,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:09,336 INFO L124 PetriNetUnfolderBase]: 2481/5600 cut-off events. [2025-03-04 09:42:09,336 INFO L125 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2025-03-04 09:42:09,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11615 conditions, 5600 events. 2481/5600 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 39175 event pairs, 1218 based on Foata normal form. 124/5111 useless extension candidates. Maximal degree in co-relation 11601. Up to 2282 conditions per place. [2025-03-04 09:42:09,355 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 79 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2025-03-04 09:42:09,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 126 transitions, 535 flow [2025-03-04 09:42:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2025-03-04 09:42:09,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2025-03-04 09:42:09,357 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 366 flow. Second operand 3 states and 376 transitions. [2025-03-04 09:42:09,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 126 transitions, 535 flow [2025-03-04 09:42:09,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 126 transitions, 513 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 09:42:09,361 INFO L231 Difference]: Finished difference. Result has 118 places, 110 transitions, 318 flow [2025-03-04 09:42:09,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=114, 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=3, PETRI_FLOW=318, PETRI_PLACES=118, PETRI_TRANSITIONS=110} [2025-03-04 09:42:09,362 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -44 predicate places. [2025-03-04 09:42:09,362 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 318 flow [2025-03-04 09:42:09,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:09,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:09,362 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] [2025-03-04 09:42:09,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:42:09,362 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:09,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:09,363 INFO L85 PathProgramCache]: Analyzing trace with hash 865527802, now seen corresponding path program 1 times [2025-03-04 09:42:09,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:09,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669924306] [2025-03-04 09:42:09,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:09,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 09:42:09,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 09:42:09,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:09,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 09:42:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669924306] [2025-03-04 09:42:09,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669924306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:09,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:09,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:09,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158987085] [2025-03-04 09:42:09,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:09,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:09,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:09,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:09,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:09,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-03-04 09:42:09,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:09,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:09,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-03-04 09:42:09,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:09,634 INFO L124 PetriNetUnfolderBase]: 1512/3814 cut-off events. [2025-03-04 09:42:09,634 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES. [2025-03-04 09:42:09,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8037 conditions, 3814 events. 1512/3814 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 24568 event pairs, 368 based on Foata normal form. 218/3647 useless extension candidates. Maximal degree in co-relation 8024. Up to 1849 conditions per place. [2025-03-04 09:42:09,645 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 71 selfloop transitions, 6 changer transitions 0/123 dead transitions. [2025-03-04 09:42:09,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 123 transitions, 516 flow [2025-03-04 09:42:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2025-03-04 09:42:09,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2025-03-04 09:42:09,646 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 318 flow. Second operand 3 states and 376 transitions. [2025-03-04 09:42:09,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 123 transitions, 516 flow [2025-03-04 09:42:09,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 123 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:42:09,649 INFO L231 Difference]: Finished difference. Result has 118 places, 110 transitions, 324 flow [2025-03-04 09:42:09,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=118, PETRI_TRANSITIONS=110} [2025-03-04 09:42:09,649 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -44 predicate places. [2025-03-04 09:42:09,650 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 324 flow [2025-03-04 09:42:09,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:09,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:09,650 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-04 09:42:09,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:42:09,650 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:09,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:09,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1876403391, now seen corresponding path program 1 times [2025-03-04 09:42:09,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:09,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069621854] [2025-03-04 09:42:09,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:09,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:09,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 09:42:09,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 09:42:09,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:09,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 09:42:09,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:09,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069621854] [2025-03-04 09:42:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069621854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:09,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:09,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:42:09,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932840521] [2025-03-04 09:42:09,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:09,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:42:09,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:09,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:42:09,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:42:09,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 172 [2025-03-04 09:42:09,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:09,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:09,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 172 [2025-03-04 09:42:09,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:10,162 INFO L124 PetriNetUnfolderBase]: 1600/3613 cut-off events. [2025-03-04 09:42:10,163 INFO L125 PetriNetUnfolderBase]: For 1287/1287 co-relation queries the response was YES. [2025-03-04 09:42:10,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8361 conditions, 3613 events. 1600/3613 cut-off events. For 1287/1287 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 21246 event pairs, 1021 based on Foata normal form. 36/3557 useless extension candidates. Maximal degree in co-relation 8348. Up to 2205 conditions per place. [2025-03-04 09:42:10,172 INFO L140 encePairwiseOnDemand]: 160/172 looper letters, 71 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2025-03-04 09:42:10,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 107 transitions, 475 flow [2025-03-04 09:42:10,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2025-03-04 09:42:10,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5802325581395349 [2025-03-04 09:42:10,175 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 324 flow. Second operand 5 states and 499 transitions. [2025-03-04 09:42:10,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 107 transitions, 475 flow [2025-03-04 09:42:10,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 107 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:10,178 INFO L231 Difference]: Finished difference. Result has 113 places, 102 transitions, 310 flow [2025-03-04 09:42:10,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=113, PETRI_TRANSITIONS=102} [2025-03-04 09:42:10,178 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -49 predicate places. [2025-03-04 09:42:10,178 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 102 transitions, 310 flow [2025-03-04 09:42:10,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:10,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:10,178 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-04 09:42:10,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:42:10,179 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-04 09:42:10,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1742384512, now seen corresponding path program 1 times [2025-03-04 09:42:10,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:10,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922591540] [2025-03-04 09:42:10,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:10,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:10,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 09:42:10,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 09:42:10,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:10,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 09:42:10,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:10,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922591540] [2025-03-04 09:42:10,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922591540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:10,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:10,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400731451] [2025-03-04 09:42:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:10,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:42:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:10,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:42:10,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:42:10,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 172 [2025-03-04 09:42:10,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 102 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:10,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:10,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 172 [2025-03-04 09:42:10,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:10,879 INFO L124 PetriNetUnfolderBase]: 1512/3345 cut-off events. [2025-03-04 09:42:10,880 INFO L125 PetriNetUnfolderBase]: For 1181/1181 co-relation queries the response was YES. [2025-03-04 09:42:10,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7750 conditions, 3345 events. 1512/3345 cut-off events. For 1181/1181 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18744 event pairs, 1021 based on Foata normal form. 126/3379 useless extension candidates. Maximal degree in co-relation 7736. Up to 2205 conditions per place. [2025-03-04 09:42:10,887 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 65 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-03-04 09:42:10,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 100 transitions, 451 flow [2025-03-04 09:42:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2025-03-04 09:42:10,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6302325581395349 [2025-03-04 09:42:10,888 INFO L175 Difference]: Start difference. First operand has 113 places, 102 transitions, 310 flow. Second operand 5 states and 542 transitions. [2025-03-04 09:42:10,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 100 transitions, 451 flow [2025-03-04 09:42:10,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 443 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:10,891 INFO L231 Difference]: Finished difference. Result has 106 places, 95 transitions, 296 flow [2025-03-04 09:42:10,891 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=106, PETRI_TRANSITIONS=95} [2025-03-04 09:42:10,891 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -56 predicate places. [2025-03-04 09:42:10,891 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 95 transitions, 296 flow [2025-03-04 09:42:10,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:10,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:10,891 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-04 09:42:10,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 09:42:10,892 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-04 09:42:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2023642803, now seen corresponding path program 1 times [2025-03-04 09:42:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:10,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297565400] [2025-03-04 09:42:10,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:10,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:42:10,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:42:10,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:10,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 09:42:10,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:10,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297565400] [2025-03-04 09:42:10,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297565400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:10,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:10,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:42:10,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835519804] [2025-03-04 09:42:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:10,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:42:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:10,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:42:10,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:42:10,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-03-04 09:42:10,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 95 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:10,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:10,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-03-04 09:42:10,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:11,235 INFO L124 PetriNetUnfolderBase]: 2059/4751 cut-off events. [2025-03-04 09:42:11,235 INFO L125 PetriNetUnfolderBase]: For 1721/1722 co-relation queries the response was YES. [2025-03-04 09:42:11,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10721 conditions, 4751 events. 2059/4751 cut-off events. For 1721/1722 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 30290 event pairs, 703 based on Foata normal form. 133/4753 useless extension candidates. Maximal degree in co-relation 10707. Up to 1780 conditions per place. [2025-03-04 09:42:11,250 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 166 selfloop transitions, 3 changer transitions 0/200 dead transitions. [2025-03-04 09:42:11,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 200 transitions, 988 flow [2025-03-04 09:42:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:42:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:42:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2025-03-04 09:42:11,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.809593023255814 [2025-03-04 09:42:11,251 INFO L175 Difference]: Start difference. First operand has 106 places, 95 transitions, 296 flow. Second operand 4 states and 557 transitions. [2025-03-04 09:42:11,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 200 transitions, 988 flow [2025-03-04 09:42:11,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 200 transitions, 972 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:11,255 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 304 flow [2025-03-04 09:42:11,256 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2025-03-04 09:42:11,256 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -56 predicate places. [2025-03-04 09:42:11,256 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 304 flow [2025-03-04 09:42:11,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:11,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:11,256 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-04 09:42:11,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 09:42:11,256 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-04 09:42:11,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:11,257 INFO L85 PathProgramCache]: Analyzing trace with hash -248644162, now seen corresponding path program 1 times [2025-03-04 09:42:11,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:11,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667539332] [2025-03-04 09:42:11,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:11,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:42:11,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:42:11,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:11,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:42:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667539332] [2025-03-04 09:42:11,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667539332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:42:11,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409350572] [2025-03-04 09:42:11,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:11,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:42:11,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:42:11,772 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:42:11,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:42:11,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:42:11,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:42:11,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:11,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:11,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 09:42:11,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:42:11,952 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 13 treesize of output 9 [2025-03-04 09:42:11,977 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-04 09:42:12,094 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:42:12,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:42:12,113 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-03-04 09:42:12,114 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-04 09:42:12,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:42:12,137 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:42:12,138 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 16 [2025-03-04 09:42:12,206 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 13 [2025-03-04 09:42:12,293 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-04 09:42:12,301 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-04 09:42:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:42:12,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:42:17,275 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2025-03-04 09:42:17,275 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 190 treesize of output 169 [2025-03-04 09:42:17,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:42:17,286 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 132 treesize of output 128 [2025-03-04 09:42:17,316 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 17 treesize of output 9 [2025-03-04 09:42:17,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:42:17,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 130 [2025-03-04 09:42:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:42:17,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409350572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:42:17,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:42:17,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 36 [2025-03-04 09:42:17,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271964484] [2025-03-04 09:42:17,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:42:17,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 09:42:17,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:17,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 09:42:17,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 09:42:19,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:42:24,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:42:28,122 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-04 09:42:33,332 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-04 09:42:37,643 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-04 09:42:45,183 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-04 09:42:50,844 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-04 09:42:54,955 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-04 09:43:01,118 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-04 09:43:03,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:43:03,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 172 [2025-03-04 09:43:03,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 304 flow. Second operand has 37 states, 37 states have (on average 87.02702702702703) internal successors, (3220), 37 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:03,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:03,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 172 [2025-03-04 09:43:03,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:05,621 INFO L124 PetriNetUnfolderBase]: 2058/4439 cut-off events. [2025-03-04 09:43:05,621 INFO L125 PetriNetUnfolderBase]: For 3018/3018 co-relation queries the response was YES. [2025-03-04 09:43:05,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10947 conditions, 4439 events. 2058/4439 cut-off events. For 3018/3018 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 24586 event pairs, 324 based on Foata normal form. 0/4334 useless extension candidates. Maximal degree in co-relation 10932. Up to 1570 conditions per place. [2025-03-04 09:43:05,634 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 189 selfloop transitions, 22 changer transitions 0/231 dead transitions. [2025-03-04 09:43:05,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 231 transitions, 1334 flow [2025-03-04 09:43:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:43:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 09:43:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1607 transitions. [2025-03-04 09:43:05,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5495896032831737 [2025-03-04 09:43:05,636 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 304 flow. Second operand 17 states and 1607 transitions. [2025-03-04 09:43:05,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 231 transitions, 1334 flow [2025-03-04 09:43:05,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 231 transitions, 1242 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:05,640 INFO L231 Difference]: Finished difference. Result has 124 places, 99 transitions, 363 flow [2025-03-04 09:43:05,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=363, PETRI_PLACES=124, PETRI_TRANSITIONS=99} [2025-03-04 09:43:05,641 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -38 predicate places. [2025-03-04 09:43:05,641 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 99 transitions, 363 flow [2025-03-04 09:43:05,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 87.02702702702703) internal successors, (3220), 37 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:05,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:05,642 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-04 09:43:05,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:43:05,842 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,SelfDestructingSolverStorable23 [2025-03-04 09:43:05,842 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:43:05,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash -164951541, now seen corresponding path program 1 times [2025-03-04 09:43:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908481648] [2025-03-04 09:43:05,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:05,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 09:43:05,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 09:43:05,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:05,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:43:07,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:07,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908481648] [2025-03-04 09:43:07,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908481648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:07,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113150091] [2025-03-04 09:43:07,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:07,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:07,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:07,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:07,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:43:07,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 09:43:07,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 09:43:07,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:07,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:07,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-04 09:43:07,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:07,215 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 11 treesize of output 7 [2025-03-04 09:43:07,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 09:43:07,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 09:43:07,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:43:07,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:43:07,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:43:07,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2025-03-04 09:43:07,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2025-03-04 09:43:07,582 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 30 treesize of output 14 [2025-03-04 09:43:07,751 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-04 09:43:07,752 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 2 case distinctions, treesize of input 41 treesize of output 24 [2025-03-04 09:43:07,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 09:43:07,825 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 30 treesize of output 14 [2025-03-04 09:43:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:43:07,914 INFO L312 TraceCheckSpWp]: Computing backward predicates...