./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/goblint-regression/09-regions_04-list2_nr.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 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:16:48,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:16:48,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:16:48,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:16:48,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:16:48,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:16:48,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:16:48,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:16:48,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:16:48,658 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:16:48,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:16:48,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:16:48,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:16:48,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:16:48,659 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:16:48,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:16:48,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:16:48,660 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:16:48,660 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:16:48,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:16:48,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:16:48,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:16:48,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:48,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:16:48,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:16:48,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:16:48,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:16:48,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:16:48,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:16:48,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:16:48,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:16:48,662 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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2025-03-17 14:16:48,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:16:48,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:16:48,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:16:48,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:16:48,903 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:16:48,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-03-17 14:16:49,994 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df94f8307/64a0319cd1514ad2a63ccf23b2b04ca7/FLAGcc371e14b [2025-03-17 14:16:50,289 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:16:50,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-03-17 14:16:50,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df94f8307/64a0319cd1514ad2a63ccf23b2b04ca7/FLAGcc371e14b [2025-03-17 14:16:50,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df94f8307/64a0319cd1514ad2a63ccf23b2b04ca7 [2025-03-17 14:16:50,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:16:50,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:16:50,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:50,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:16:50,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:16:50,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543f9edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50, skipping insertion in model container [2025-03-17 14:16:50,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:16:50,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:16:50,661 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:16:50,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:16:50,769 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:16:50,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50 WrapperNode [2025-03-17 14:16:50,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:50,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:16:50,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:16:50,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:16:50,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,805 INFO L138 Inliner]: procedures = 368, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 89 [2025-03-17 14:16:50,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:16:50,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:16:50,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:16:50,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:16:50,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,825 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [5, 5, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [5, 5, 0]. The 12 writes are split as follows [0, 0, 12]. [2025-03-17 14:16:50,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:16:50,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:16:50,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:16:50,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:16:50,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:50,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:50,863 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-17 14:16:50,864 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-17 14:16:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:16:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:16:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 14:16:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:16:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:16:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:16:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:16:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:16:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 14:16:50,881 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:16:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:16:50,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:16:50,882 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:16:50,974 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:16:50,976 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:16:51,290 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:16:51,291 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:16:51,406 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:16:51,408 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:16:51,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:51 BoogieIcfgContainer [2025-03-17 14:16:51,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:16:51,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:16:51,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:16:51,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:16:51,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:16:50" (1/3) ... [2025-03-17 14:16:51,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6987e2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:16:51, skipping insertion in model container [2025-03-17 14:16:51,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (2/3) ... [2025-03-17 14:16:51,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6987e2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:16:51, skipping insertion in model container [2025-03-17 14:16:51,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:51" (3/3) ... [2025-03-17 14:16:51,416 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2025-03-17 14:16:51,426 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:16:51,427 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_04-list2_nr.i that has 2 procedures, 84 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-03-17 14:16:51,427 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:16:51,468 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:16:51,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 170 flow [2025-03-17 14:16:51,521 INFO L124 PetriNetUnfolderBase]: 0/82 cut-off events. [2025-03-17 14:16:51,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:51,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 180 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-17 14:16:51,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 170 flow [2025-03-17 14:16:51,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 167 flow [2025-03-17 14:16:51,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:16:51,543 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;@608bdd89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:16:51,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-03-17 14:16:51,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:16:51,546 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-17 14:16:51,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:51,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:51,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:16:51,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:51,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash 12072, now seen corresponding path program 1 times [2025-03-17 14:16:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:51,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089855802] [2025-03-17 14:16:51,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:51,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:16:51,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:16:51,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:51,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:16:51,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:51,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089855802] [2025-03-17 14:16:51,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089855802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:51,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:51,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:16:51,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425983564] [2025-03-17 14:16:51,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:51,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:51,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:51,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:51,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:51,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-03-17 14:16:51,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-17 14:16:51,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:51,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-03-17 14:16:51,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:51,965 INFO L124 PetriNetUnfolderBase]: 99/370 cut-off events. [2025-03-17 14:16:51,966 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:51,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 370 events. 99/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1825 event pairs, 99 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 564. Up to 223 conditions per place. [2025-03-17 14:16:51,971 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 28 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-03-17 14:16:51,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 215 flow [2025-03-17 14:16:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-17 14:16:51,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2025-03-17 14:16:51,983 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 167 flow. Second operand 3 states and 169 transitions. [2025-03-17 14:16:51,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 215 flow [2025-03-17 14:16:51,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:51,988 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 158 flow [2025-03-17 14:16:51,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-03-17 14:16:51,994 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-03-17 14:16:51,995 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 158 flow [2025-03-17 14:16:51,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-17 14:16:51,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:51,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:16:51,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:16:51,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:51,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:51,997 INFO L85 PathProgramCache]: Analyzing trace with hash 12073, now seen corresponding path program 1 times [2025-03-17 14:16:51,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:51,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638280389] [2025-03-17 14:16:51,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:51,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:52,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:16:52,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:16:52,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:52,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:52,126 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-17 14:16:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:52,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638280389] [2025-03-17 14:16:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638280389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:52,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:52,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:16:52,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194193526] [2025-03-17 14:16:52,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:52,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:52,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:52,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:52,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:52,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-03-17 14:16:52,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-17 14:16:52,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:52,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-03-17 14:16:52,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:52,298 INFO L124 PetriNetUnfolderBase]: 99/362 cut-off events. [2025-03-17 14:16:52,298 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:16:52,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 362 events. 99/362 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1836 event pairs, 99 based on Foata normal form. 6/311 useless extension candidates. Maximal degree in co-relation 572. Up to 223 conditions per place. [2025-03-17 14:16:52,302 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-03-17 14:16:52,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 198 flow [2025-03-17 14:16:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-03-17 14:16:52,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-03-17 14:16:52,303 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 158 flow. Second operand 3 states and 177 transitions. [2025-03-17 14:16:52,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 198 flow [2025-03-17 14:16:52,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:52,304 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 142 flow [2025-03-17 14:16:52,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-03-17 14:16:52,305 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2025-03-17 14:16:52,305 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 142 flow [2025-03-17 14:16:52,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-17 14:16:52,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:52,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:16:52,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:16:52,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:52,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1728137866, now seen corresponding path program 1 times [2025-03-17 14:16:52,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:52,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187478964] [2025-03-17 14:16:52,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:52,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:52,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:16:52,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:16:52,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:52,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:52,429 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-17 14:16:52,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:52,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187478964] [2025-03-17 14:16:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187478964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:52,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:52,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:16:52,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160369195] [2025-03-17 14:16:52,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:52,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:16:52,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:52,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:16:52,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:16:52,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 83 [2025-03-17 14:16:52,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-17 14:16:52,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:52,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 83 [2025-03-17 14:16:52,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:52,689 INFO L124 PetriNetUnfolderBase]: 110/392 cut-off events. [2025-03-17 14:16:52,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:52,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 392 events. 110/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1998 event pairs, 110 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 626. Up to 249 conditions per place. [2025-03-17 14:16:52,692 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-03-17 14:16:52,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 202 flow [2025-03-17 14:16:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:16:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:16:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-03-17 14:16:52,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5783132530120482 [2025-03-17 14:16:52,694 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 142 flow. Second operand 4 states and 192 transitions. [2025-03-17 14:16:52,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 202 flow [2025-03-17 14:16:52,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:52,695 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 132 flow [2025-03-17 14:16:52,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-03-17 14:16:52,696 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -17 predicate places. [2025-03-17 14:16:52,696 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 132 flow [2025-03-17 14:16:52,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-17 14:16:52,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:52,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:16:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:16:52,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1728137865, now seen corresponding path program 1 times [2025-03-17 14:16:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:52,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970400288] [2025-03-17 14:16:52,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:52,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:52,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:16:52,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:16:52,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:52,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:52,761 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-17 14:16:52,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:52,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970400288] [2025-03-17 14:16:52,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970400288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:52,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:52,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228248671] [2025-03-17 14:16:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:52,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:52,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:52,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:52,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:52,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2025-03-17 14:16:52,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-17 14:16:52,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:52,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2025-03-17 14:16:52,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:52,862 INFO L124 PetriNetUnfolderBase]: 99/352 cut-off events. [2025-03-17 14:16:52,863 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:16:52,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 352 events. 99/352 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1770 event pairs, 99 based on Foata normal form. 11/312 useless extension candidates. Maximal degree in co-relation 572. Up to 225 conditions per place. [2025-03-17 14:16:52,864 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 27 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-03-17 14:16:52,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 182 flow [2025-03-17 14:16:52,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-03-17 14:16:52,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751004016064257 [2025-03-17 14:16:52,866 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 132 flow. Second operand 3 states and 187 transitions. [2025-03-17 14:16:52,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 182 flow [2025-03-17 14:16:52,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 179 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:52,867 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 125 flow [2025-03-17 14:16:52,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-03-17 14:16:52,868 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2025-03-17 14:16:52,868 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 125 flow [2025-03-17 14:16:52,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-17 14:16:52,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:52,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:52,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:16:52,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:52,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash 331851192, now seen corresponding path program 1 times [2025-03-17 14:16:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113699573] [2025-03-17 14:16:52,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:52,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:16:52,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:16:52,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:52,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:53,026 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-17 14:16:53,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:53,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113699573] [2025-03-17 14:16:53,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113699573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:53,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:53,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:16:53,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771372481] [2025-03-17 14:16:53,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:53,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:16:53,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:53,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:16:53,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:16:53,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-03-17 14:16:53,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-17 14:16:53,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:53,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-03-17 14:16:53,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:53,168 INFO L124 PetriNetUnfolderBase]: 110/357 cut-off events. [2025-03-17 14:16:53,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:53,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 357 events. 110/357 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1704 event pairs, 110 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 607. Up to 248 conditions per place. [2025-03-17 14:16:53,171 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 32 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2025-03-17 14:16:53,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 185 flow [2025-03-17 14:16:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-03-17 14:16:53,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-03-17 14:16:53,173 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 125 flow. Second operand 3 states and 177 transitions. [2025-03-17 14:16:53,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 185 flow [2025-03-17 14:16:53,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:53,174 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 120 flow [2025-03-17 14:16:53,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-03-17 14:16:53,175 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2025-03-17 14:16:53,176 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 120 flow [2025-03-17 14:16:53,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-17 14:16:53,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:53,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:53,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:16:53,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash 331851193, now seen corresponding path program 1 times [2025-03-17 14:16:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973622869] [2025-03-17 14:16:53,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:53,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:16:53,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:16:53,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:53,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:53,393 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-17 14:16:53,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:53,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973622869] [2025-03-17 14:16:53,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973622869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:53,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:53,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:16:53,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489684964] [2025-03-17 14:16:53,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:53,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:16:53,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:53,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:16:53,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:16:53,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-17 14:16:53,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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-17 14:16:53,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:53,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-17 14:16:53,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:53,602 INFO L124 PetriNetUnfolderBase]: 110/344 cut-off events. [2025-03-17 14:16:53,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:53,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 344 events. 110/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1596 event pairs, 110 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 595. Up to 246 conditions per place. [2025-03-17 14:16:53,603 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-03-17 14:16:53,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 54 transitions, 180 flow [2025-03-17 14:16:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:16:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:16:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2025-03-17 14:16:53,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5421686746987951 [2025-03-17 14:16:53,605 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 120 flow. Second operand 4 states and 180 transitions. [2025-03-17 14:16:53,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 54 transitions, 180 flow [2025-03-17 14:16:53,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:53,608 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 117 flow [2025-03-17 14:16:53,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-03-17 14:16:53,608 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -23 predicate places. [2025-03-17 14:16:53,608 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 117 flow [2025-03-17 14:16:53,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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-17 14:16:53,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:53,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:53,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:16:53,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:53,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1856842210, now seen corresponding path program 1 times [2025-03-17 14:16:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:53,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046569657] [2025-03-17 14:16:53,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:53,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:53,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:16:53,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:16:53,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:53,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:54,222 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-17 14:16:54,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:54,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046569657] [2025-03-17 14:16:54,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046569657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:54,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:54,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:16:54,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232833623] [2025-03-17 14:16:54,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:54,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:16:54,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:54,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:16:54,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:16:54,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-17 14:16:54,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 117 flow. Second operand has 12 states, 12 states have (on average 35.25) internal successors, (423), 12 states have internal predecessors, (423), 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-17 14:16:54,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:54,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-17 14:16:54,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:55,173 INFO L124 PetriNetUnfolderBase]: 194/569 cut-off events. [2025-03-17 14:16:55,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:55,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 569 events. 194/569 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3047 event pairs, 6 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 1000. Up to 137 conditions per place. [2025-03-17 14:16:55,176 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 67 selfloop transitions, 25 changer transitions 0/108 dead transitions. [2025-03-17 14:16:55,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 108 transitions, 409 flow [2025-03-17 14:16:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:16:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:16:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 509 transitions. [2025-03-17 14:16:55,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5110441767068273 [2025-03-17 14:16:55,177 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 117 flow. Second operand 12 states and 509 transitions. [2025-03-17 14:16:55,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 108 transitions, 409 flow [2025-03-17 14:16:55,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:55,181 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 223 flow [2025-03-17 14:16:55,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=223, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2025-03-17 14:16:55,182 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -12 predicate places. [2025-03-17 14:16:55,182 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 223 flow [2025-03-17 14:16:55,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.25) internal successors, (423), 12 states have internal predecessors, (423), 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-17 14:16:55,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:55,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:55,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:16:55,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:55,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:55,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1856842211, now seen corresponding path program 1 times [2025-03-17 14:16:55,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:55,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763261200] [2025-03-17 14:16:55,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:55,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:16:55,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:16:55,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:55,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:55,966 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-17 14:16:55,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:55,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763261200] [2025-03-17 14:16:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763261200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:55,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:55,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:16:55,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955204088] [2025-03-17 14:16:55,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:55,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:16:55,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:55,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:16:55,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:16:56,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-03-17 14:16:56,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 223 flow. Second operand has 12 states, 12 states have (on average 30.25) internal successors, (363), 12 states have internal predecessors, (363), 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-17 14:16:56,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:56,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-03-17 14:16:56,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:56,817 INFO L124 PetriNetUnfolderBase]: 212/569 cut-off events. [2025-03-17 14:16:56,818 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-03-17 14:16:56,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 569 events. 212/569 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2945 event pairs, 2 based on Foata normal form. 29/565 useless extension candidates. Maximal degree in co-relation 1245. Up to 259 conditions per place. [2025-03-17 14:16:56,821 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 67 selfloop transitions, 21 changer transitions 0/100 dead transitions. [2025-03-17 14:16:56,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 483 flow [2025-03-17 14:16:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:16:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 14:16:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 469 transitions. [2025-03-17 14:16:56,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43466172381835033 [2025-03-17 14:16:56,823 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 223 flow. Second operand 13 states and 469 transitions. [2025-03-17 14:16:56,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 483 flow [2025-03-17 14:16:56,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 100 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:56,825 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 298 flow [2025-03-17 14:16:56,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=298, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2025-03-17 14:16:56,828 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -1 predicate places. [2025-03-17 14:16:56,828 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 298 flow [2025-03-17 14:16:56,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.25) internal successors, (363), 12 states have internal predecessors, (363), 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-17 14:16:56,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:56,829 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-17 14:16:56,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:16:56,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:56,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2044221014, now seen corresponding path program 1 times [2025-03-17 14:16:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:56,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253105302] [2025-03-17 14:16:56,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:56,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:16:56,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:16:56,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:56,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:56,899 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-17 14:16:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253105302] [2025-03-17 14:16:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253105302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:16:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842587456] [2025-03-17 14:16:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:56,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:56,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:56,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:56,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 83 [2025-03-17 14:16:56,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:16:56,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:56,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 83 [2025-03-17 14:16:56,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:56,977 INFO L124 PetriNetUnfolderBase]: 131/413 cut-off events. [2025-03-17 14:16:56,977 INFO L125 PetriNetUnfolderBase]: For 261/261 co-relation queries the response was YES. [2025-03-17 14:16:56,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 413 events. 131/413 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2153 event pairs, 61 based on Foata normal form. 6/401 useless extension candidates. Maximal degree in co-relation 982. Up to 221 conditions per place. [2025-03-17 14:16:56,979 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 61 selfloop transitions, 6 changer transitions 0/92 dead transitions. [2025-03-17 14:16:56,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 92 transitions, 525 flow [2025-03-17 14:16:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-03-17 14:16:56,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2025-03-17 14:16:56,980 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 298 flow. Second operand 3 states and 213 transitions. [2025-03-17 14:16:56,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 92 transitions, 525 flow [2025-03-17 14:16:56,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 454 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-03-17 14:16:56,984 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 269 flow [2025-03-17 14:16:56,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2025-03-17 14:16:56,984 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2025-03-17 14:16:56,984 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 269 flow [2025-03-17 14:16:56,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:16:56,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:56,985 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-17 14:16:56,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:16:56,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:56,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash -239961001, now seen corresponding path program 1 times [2025-03-17 14:16:56,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:56,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813920248] [2025-03-17 14:16:56,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:56,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:56,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:16:57,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:16:57,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:57,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:57,157 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-17 14:16:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813920248] [2025-03-17 14:16:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813920248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:57,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:57,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:16:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469489071] [2025-03-17 14:16:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:57,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:16:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:57,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:16:57,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:16:57,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2025-03-17 14:16:57,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-17 14:16:57,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:57,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2025-03-17 14:16:57,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:57,344 INFO L124 PetriNetUnfolderBase]: 167/518 cut-off events. [2025-03-17 14:16:57,344 INFO L125 PetriNetUnfolderBase]: For 250/251 co-relation queries the response was YES. [2025-03-17 14:16:57,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 518 events. 167/518 cut-off events. For 250/251 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2897 event pairs, 26 based on Foata normal form. 10/505 useless extension candidates. Maximal degree in co-relation 1199. Up to 190 conditions per place. [2025-03-17 14:16:57,347 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 59 selfloop transitions, 17 changer transitions 0/95 dead transitions. [2025-03-17 14:16:57,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 95 transitions, 506 flow [2025-03-17 14:16:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:16:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:16:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2025-03-17 14:16:57,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2025-03-17 14:16:57,348 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 269 flow. Second operand 5 states and 305 transitions. [2025-03-17 14:16:57,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 95 transitions, 506 flow [2025-03-17 14:16:57,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 95 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:57,351 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 334 flow [2025-03-17 14:16:57,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2025-03-17 14:16:57,351 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2025-03-17 14:16:57,351 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 334 flow [2025-03-17 14:16:57,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-17 14:16:57,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:57,352 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-17 14:16:57,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:16:57,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:57,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash -239961002, now seen corresponding path program 1 times [2025-03-17 14:16:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:57,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791435511] [2025-03-17 14:16:57,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:57,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:16:57,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:16:57,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:57,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:57,478 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-17 14:16:57,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:57,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791435511] [2025-03-17 14:16:57,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791435511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:57,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:57,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:16:57,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925346102] [2025-03-17 14:16:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:57,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:16:57,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:57,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:16:57,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:16:57,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 83 [2025-03-17 14:16:57,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 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-17 14:16:57,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:57,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 83 [2025-03-17 14:16:57,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:57,754 INFO L124 PetriNetUnfolderBase]: 167/511 cut-off events. [2025-03-17 14:16:57,754 INFO L125 PetriNetUnfolderBase]: For 411/412 co-relation queries the response was YES. [2025-03-17 14:16:57,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 511 events. 167/511 cut-off events. For 411/412 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2818 event pairs, 60 based on Foata normal form. 11/499 useless extension candidates. Maximal degree in co-relation 1280. Up to 226 conditions per place. [2025-03-17 14:16:57,758 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 49 selfloop transitions, 24 changer transitions 0/92 dead transitions. [2025-03-17 14:16:57,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 92 transitions, 537 flow [2025-03-17 14:16:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:16:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:16:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-03-17 14:16:57,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608433734939759 [2025-03-17 14:16:57,760 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 334 flow. Second operand 6 states and 303 transitions. [2025-03-17 14:16:57,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 92 transitions, 537 flow [2025-03-17 14:16:57,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 92 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:57,764 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 425 flow [2025-03-17 14:16:57,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2025-03-17 14:16:57,765 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 3 predicate places. [2025-03-17 14:16:57,765 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 425 flow [2025-03-17 14:16:57,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 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-17 14:16:57,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:57,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:57,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:16:57,766 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:57,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash 623389785, now seen corresponding path program 1 times [2025-03-17 14:16:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706003565] [2025-03-17 14:16:57,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:57,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:16:57,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:16:57,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:57,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:58,332 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-17 14:16:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706003565] [2025-03-17 14:16:58,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706003565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:58,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:58,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 14:16:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565695639] [2025-03-17 14:16:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:58,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 14:16:58,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:58,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 14:16:58,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:16:58,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-03-17 14:16:58,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 425 flow. Second operand has 15 states, 15 states have (on average 36.4) internal successors, (546), 15 states have internal predecessors, (546), 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-17 14:16:58,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:58,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-03-17 14:16:58,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:59,310 INFO L124 PetriNetUnfolderBase]: 191/539 cut-off events. [2025-03-17 14:16:59,311 INFO L125 PetriNetUnfolderBase]: For 1000/1000 co-relation queries the response was YES. [2025-03-17 14:16:59,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 539 events. 191/539 cut-off events. For 1000/1000 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2921 event pairs, 36 based on Foata normal form. 6/526 useless extension candidates. Maximal degree in co-relation 1577. Up to 135 conditions per place. [2025-03-17 14:16:59,313 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 71 selfloop transitions, 25 changer transitions 3/112 dead transitions. [2025-03-17 14:16:59,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 112 transitions, 814 flow [2025-03-17 14:16:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:16:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:16:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 460 transitions. [2025-03-17 14:16:59,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5038335158817087 [2025-03-17 14:16:59,315 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 425 flow. Second operand 11 states and 460 transitions. [2025-03-17 14:16:59,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 112 transitions, 814 flow [2025-03-17 14:16:59,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 112 transitions, 766 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 14:16:59,318 INFO L231 Difference]: Finished difference. Result has 97 places, 80 transitions, 499 flow [2025-03-17 14:16:59,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=499, PETRI_PLACES=97, PETRI_TRANSITIONS=80} [2025-03-17 14:16:59,319 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 11 predicate places. [2025-03-17 14:16:59,319 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 80 transitions, 499 flow [2025-03-17 14:16:59,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 36.4) internal successors, (546), 15 states have internal predecessors, (546), 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-17 14:16:59,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:59,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:59,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:16:59,320 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:16:59,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:59,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1476912500, now seen corresponding path program 1 times [2025-03-17 14:16:59,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:59,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907216436] [2025-03-17 14:16:59,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:59,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:59,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:16:59,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:16:59,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:59,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:59,669 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-17 14:16:59,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:59,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907216436] [2025-03-17 14:16:59,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907216436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:59,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:59,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 14:16:59,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540013705] [2025-03-17 14:16:59,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:59,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:16:59,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:59,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:16:59,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:17:00,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-03-17 14:17:00,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 80 transitions, 499 flow. Second operand has 14 states, 14 states have (on average 36.5) internal successors, (511), 14 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-17 14:17:00,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:00,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-03-17 14:17:00,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:00,449 INFO L124 PetriNetUnfolderBase]: 177/520 cut-off events. [2025-03-17 14:17:00,449 INFO L125 PetriNetUnfolderBase]: For 913/913 co-relation queries the response was YES. [2025-03-17 14:17:00,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 520 events. 177/520 cut-off events. For 913/913 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2825 event pairs, 33 based on Foata normal form. 6/507 useless extension candidates. Maximal degree in co-relation 1602. Up to 87 conditions per place. [2025-03-17 14:17:00,453 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 61 selfloop transitions, 40 changer transitions 3/119 dead transitions. [2025-03-17 14:17:00,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 119 transitions, 867 flow [2025-03-17 14:17:00,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:17:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:17:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 570 transitions. [2025-03-17 14:17:00,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4905335628227194 [2025-03-17 14:17:00,455 INFO L175 Difference]: Start difference. First operand has 97 places, 80 transitions, 499 flow. Second operand 14 states and 570 transitions. [2025-03-17 14:17:00,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 119 transitions, 867 flow [2025-03-17 14:17:00,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 119 transitions, 842 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-17 14:17:00,463 INFO L231 Difference]: Finished difference. Result has 106 places, 84 transitions, 610 flow [2025-03-17 14:17:00,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=610, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2025-03-17 14:17:00,464 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 20 predicate places. [2025-03-17 14:17:00,464 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 610 flow [2025-03-17 14:17:00,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 36.5) internal successors, (511), 14 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-17 14:17:00,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:00,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:00,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:17:00,465 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:00,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1469685412, now seen corresponding path program 1 times [2025-03-17 14:17:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877895447] [2025-03-17 14:17:00,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:00,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:17:00,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:17:00,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:00,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:00,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877895447] [2025-03-17 14:17:00,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877895447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:00,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:00,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 14:17:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749384779] [2025-03-17 14:17:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:00,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 14:17:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:00,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 14:17:00,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:17:01,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-17 14:17:01,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 610 flow. Second operand has 15 states, 15 states have (on average 35.333333333333336) internal successors, (530), 15 states have internal predecessors, (530), 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-17 14:17:01,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:01,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-17 14:17:01,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:01,873 INFO L124 PetriNetUnfolderBase]: 189/553 cut-off events. [2025-03-17 14:17:01,874 INFO L125 PetriNetUnfolderBase]: For 1402/1402 co-relation queries the response was YES. [2025-03-17 14:17:01,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1866 conditions, 553 events. 189/553 cut-off events. For 1402/1402 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3012 event pairs, 15 based on Foata normal form. 22/573 useless extension candidates. Maximal degree in co-relation 1836. Up to 142 conditions per place. [2025-03-17 14:17:01,876 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 88 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2025-03-17 14:17:01,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 127 transitions, 1068 flow [2025-03-17 14:17:01,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:17:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 14:17:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 636 transitions. [2025-03-17 14:17:01,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4789156626506024 [2025-03-17 14:17:01,879 INFO L175 Difference]: Start difference. First operand has 106 places, 84 transitions, 610 flow. Second operand 16 states and 636 transitions. [2025-03-17 14:17:01,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 127 transitions, 1068 flow [2025-03-17 14:17:01,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 127 transitions, 995 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-03-17 14:17:01,885 INFO L231 Difference]: Finished difference. Result has 107 places, 85 transitions, 616 flow [2025-03-17 14:17:01,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=616, PETRI_PLACES=107, PETRI_TRANSITIONS=85} [2025-03-17 14:17:01,886 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 21 predicate places. [2025-03-17 14:17:01,886 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 616 flow [2025-03-17 14:17:01,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 35.333333333333336) internal successors, (530), 15 states have internal predecessors, (530), 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-17 14:17:01,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:01,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:01,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:17:01,887 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1469685411, now seen corresponding path program 1 times [2025-03-17 14:17:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:01,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289984186] [2025-03-17 14:17:01,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:01,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:01,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:17:01,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:17:01,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:01,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:02,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-17 14:17:02,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:02,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289984186] [2025-03-17 14:17:02,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289984186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:02,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:02,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 14:17:02,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834234629] [2025-03-17 14:17:02,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:02,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:17:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:02,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:17:02,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:17:03,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-17 14:17:03,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 616 flow. Second operand has 14 states, 14 states have (on average 33.42857142857143) internal successors, (468), 14 states have internal predecessors, (468), 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-17 14:17:03,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:03,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-17 14:17:03,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:03,412 INFO L124 PetriNetUnfolderBase]: 199/524 cut-off events. [2025-03-17 14:17:03,412 INFO L125 PetriNetUnfolderBase]: For 1358/1358 co-relation queries the response was YES. [2025-03-17 14:17:03,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 524 events. 199/524 cut-off events. For 1358/1358 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2653 event pairs, 15 based on Foata normal form. 23/545 useless extension candidates. Maximal degree in co-relation 1830. Up to 156 conditions per place. [2025-03-17 14:17:03,416 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 83 selfloop transitions, 26 changer transitions 10/127 dead transitions. [2025-03-17 14:17:03,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 127 transitions, 1065 flow [2025-03-17 14:17:03,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:17:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 14:17:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 608 transitions. [2025-03-17 14:17:03,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4578313253012048 [2025-03-17 14:17:03,418 INFO L175 Difference]: Start difference. First operand has 107 places, 85 transitions, 616 flow. Second operand 16 states and 608 transitions. [2025-03-17 14:17:03,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 127 transitions, 1065 flow [2025-03-17 14:17:03,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 127 transitions, 1029 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-03-17 14:17:03,423 INFO L231 Difference]: Finished difference. Result has 110 places, 76 transitions, 555 flow [2025-03-17 14:17:03,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=555, PETRI_PLACES=110, PETRI_TRANSITIONS=76} [2025-03-17 14:17:03,424 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 24 predicate places. [2025-03-17 14:17:03,424 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 76 transitions, 555 flow [2025-03-17 14:17:03,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 33.42857142857143) internal successors, (468), 14 states have internal predecessors, (468), 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-17 14:17:03,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,425 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] [2025-03-17 14:17:03,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:17:03,425 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:03,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1852275081, now seen corresponding path program 1 times [2025-03-17 14:17:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:03,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466681167] [2025-03-17 14:17:03,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:03,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:03,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:17:03,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:17:03,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:03,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:17:03,465 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:17:03,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:17:03,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:17:03,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:03,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:17:03,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:17:03,505 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:17:03,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2025-03-17 14:17:03,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2025-03-17 14:17:03,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2025-03-17 14:17:03,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2025-03-17 14:17:03,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2025-03-17 14:17:03,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2025-03-17 14:17:03,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2025-03-17 14:17:03,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2025-03-17 14:17:03,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2025-03-17 14:17:03,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2025-03-17 14:17:03,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2025-03-17 14:17:03,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2025-03-17 14:17:03,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2025-03-17 14:17:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2025-03-17 14:17:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2025-03-17 14:17:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2025-03-17 14:17:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2025-03-17 14:17:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 54 remaining) [2025-03-17 14:17:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 54 remaining) [2025-03-17 14:17:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 54 remaining) [2025-03-17 14:17:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2025-03-17 14:17:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2025-03-17 14:17:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2025-03-17 14:17:03,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2025-03-17 14:17:03,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2025-03-17 14:17:03,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2025-03-17 14:17:03,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2025-03-17 14:17:03,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2025-03-17 14:17:03,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2025-03-17 14:17:03,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2025-03-17 14:17:03,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2025-03-17 14:17:03,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:17:03,512 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:03,546 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:17:03,546 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:17:03,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:17:03 BasicIcfg [2025-03-17 14:17:03,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:17:03,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:17:03,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:17:03,553 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:17:03,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:51" (3/4) ... [2025-03-17 14:17:03,554 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:17:03,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:17:03,556 INFO L158 Benchmark]: Toolchain (without parser) took 13237.29ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 112.2MB in the beginning and 129.0MB in the end (delta: -16.8MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB. [2025-03-17 14:17:03,556 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:17:03,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.96ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 74.7MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 14:17:03,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.35ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 72.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:17:03,556 INFO L158 Benchmark]: Boogie Preprocessor took 32.62ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 69.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:17:03,556 INFO L158 Benchmark]: IcfgBuilder took 569.97ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 95.1MB in the end (delta: -25.5MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2025-03-17 14:17:03,556 INFO L158 Benchmark]: TraceAbstraction took 12142.02ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 94.4MB in the beginning and 129.0MB in the end (delta: -34.7MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. [2025-03-17 14:17:03,556 INFO L158 Benchmark]: Witness Printer took 2.19ms. Allocated memory is still 352.3MB. Free memory was 129.0MB in the beginning and 129.0MB in the end (delta: 46.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:17:03,557 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.96ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 74.7MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.35ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 72.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.62ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 69.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 569.97ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 95.1MB in the end (delta: -25.5MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12142.02ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 94.4MB in the beginning and 129.0MB in the end (delta: -34.7MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. * Witness Printer took 2.19ms. Allocated memory is still 352.3MB. Free memory was 129.0MB in the beginning and 129.0MB in the end (delta: 46.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1242]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1242. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] 0 p = malloc(sizeof(struct s)) [L1252] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1252] RET 0 init(p,9) [L1253] 0 B->next = p [L1254] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, p={-5:0}, t1=-1] [L1256] EXPR 0 A->next [L1256] 0 p = A->next [L1257] 0 p->datum [L1260] EXPR 0 B->next [L1260] 0 p = B->next [L1261] 0 p->datum [L1263] 0 return 0; VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, \result=0, p={-5:0}, t1=-1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 113 locations, 111 edges, 54 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4362 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3544 mSDsluCounter, 2152 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2059 mSDsCounter, 322 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12926 IncrementalHoareTripleChecker+Invalid, 13248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 322 mSolverCounterUnsat, 93 mSDtfsCounter, 12926 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=616occurred in iteration=14, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 2958 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 14:17:03,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/goblint-regression/09-regions_04-list2_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:17:05,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:17:05,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 14:17:05,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:17:05,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:17:05,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:17:05,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:17:05,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:17:05,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:17:05,564 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:17:05,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:17:05,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:17:05,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:17:05,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:17:05,565 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:17:05,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:17:05,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:17:05,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:17:05,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:17:05,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:17:05,566 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:17:05,566 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:17:05,566 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:17:05,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:17:05,566 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:17:05,566 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:17:05,567 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:17:05,567 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:17:05,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:17:05,567 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:17:05,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:17:05,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:17:05,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:17:05,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:17:05,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:17:05,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:17:05,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:17:05,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:17:05,569 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:17:05,569 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:17:05,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:17:05,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:17:05,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:17:05,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:17:05,569 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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2025-03-17 14:17:05,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:17:05,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:17:05,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:17:05,830 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:17:05,830 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:17:05,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-03-17 14:17:06,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26fab34e9/fee0f32f179d4b468d66258402717f09/FLAG9204a26b2 [2025-03-17 14:17:07,262 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:17:07,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-03-17 14:17:07,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26fab34e9/fee0f32f179d4b468d66258402717f09/FLAG9204a26b2 [2025-03-17 14:17:07,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26fab34e9/fee0f32f179d4b468d66258402717f09 [2025-03-17 14:17:07,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:17:07,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:17:07,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:17:07,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:17:07,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:17:07,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:17:07" (1/1) ... [2025-03-17 14:17:07,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8edbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:07, skipping insertion in model container [2025-03-17 14:17:07,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:17:07" (1/1) ... [2025-03-17 14:17:07,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:17:07,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:17:07,941 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:17:07,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:17:08,053 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:17:08,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08 WrapperNode [2025-03-17 14:17:08,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:17:08,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:17:08,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:17:08,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:17:08,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,091 INFO L138 Inliner]: procedures = 369, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 90 [2025-03-17 14:17:08,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:17:08,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:17:08,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:17:08,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:17:08,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,122 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [5, 5, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [5, 5, 0]. The 12 writes are split as follows [0, 0, 12]. [2025-03-17 14:17:08,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:17:08,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:17:08,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:17:08,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:17:08,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (1/1) ... [2025-03-17 14:17:08,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:17:08,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:08,174 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-17 14:17:08,176 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-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 14:17:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 14:17:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 14:17:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:17:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:17:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:17:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:17:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:17:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:17:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 14:17:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 14:17:08,193 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 14:17:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:17:08,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:17:08,194 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:17:08,330 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:17:08,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:17:08,708 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:17:08,708 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:17:08,819 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:17:08,821 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:17:08,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:08 BoogieIcfgContainer [2025-03-17 14:17:08,821 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:17:08,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:17:08,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:17:08,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:17:08,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:17:07" (1/3) ... [2025-03-17 14:17:08,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f026d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:17:08, skipping insertion in model container [2025-03-17 14:17:08,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:08" (2/3) ... [2025-03-17 14:17:08,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f026d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:17:08, skipping insertion in model container [2025-03-17 14:17:08,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:08" (3/3) ... [2025-03-17 14:17:08,829 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2025-03-17 14:17:08,839 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:17:08,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_04-list2_nr.i that has 2 procedures, 84 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-03-17 14:17:08,841 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:17:08,893 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:17:08,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 170 flow [2025-03-17 14:17:08,951 INFO L124 PetriNetUnfolderBase]: 0/82 cut-off events. [2025-03-17 14:17:08,953 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:08,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 180 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-17 14:17:08,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 170 flow [2025-03-17 14:17:08,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 167 flow [2025-03-17 14:17:08,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:17:08,973 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;@6f06943c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:17:08,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-03-17 14:17:08,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:17:08,975 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-17 14:17:08,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:08,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:08,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:17:08,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:08,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:08,980 INFO L85 PathProgramCache]: Analyzing trace with hash 12136, now seen corresponding path program 1 times [2025-03-17 14:17:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:08,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470376158] [2025-03-17 14:17:08,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:08,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:08,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:08,990 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-17 14:17:08,992 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-17 14:17:09,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:17:09,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:17:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:09,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:17:09,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:09,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-17 14:17:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:09,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:09,124 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:09,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470376158] [2025-03-17 14:17:09,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470376158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:09,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:09,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:17:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105744152] [2025-03-17 14:17:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:09,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:09,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:09,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:09,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-03-17 14:17:09,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-17 14:17:09,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:09,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-03-17 14:17:09,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:09,434 INFO L124 PetriNetUnfolderBase]: 99/370 cut-off events. [2025-03-17 14:17:09,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:09,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 370 events. 99/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1825 event pairs, 99 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 564. Up to 223 conditions per place. [2025-03-17 14:17:09,440 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 28 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-03-17 14:17:09,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 215 flow [2025-03-17 14:17:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-17 14:17:09,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2025-03-17 14:17:09,454 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 167 flow. Second operand 3 states and 169 transitions. [2025-03-17 14:17:09,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 215 flow [2025-03-17 14:17:09,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:09,461 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 158 flow [2025-03-17 14:17:09,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-03-17 14:17:09,465 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-03-17 14:17:09,465 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 158 flow [2025-03-17 14:17:09,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-17 14:17:09,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:09,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:17:09,472 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-17 14:17:09,670 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 [2025-03-17 14:17:09,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:09,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash 12137, now seen corresponding path program 1 times [2025-03-17 14:17:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:09,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1816358868] [2025-03-17 14:17:09,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:09,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:09,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:09,677 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-17 14:17:09,678 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-17 14:17:09,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:17:09,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:17:09,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:09,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:09,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:17:09,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:09,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:17:09,781 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-17 14:17:09,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:09,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816358868] [2025-03-17 14:17:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816358868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:09,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:09,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:17:09,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392583477] [2025-03-17 14:17:09,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:09,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:09,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:09,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:09,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:09,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-03-17 14:17:09,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-17 14:17:09,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:09,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-03-17 14:17:09,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:10,057 INFO L124 PetriNetUnfolderBase]: 99/362 cut-off events. [2025-03-17 14:17:10,058 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:17:10,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 362 events. 99/362 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1836 event pairs, 99 based on Foata normal form. 6/311 useless extension candidates. Maximal degree in co-relation 572. Up to 223 conditions per place. [2025-03-17 14:17:10,061 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-03-17 14:17:10,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 198 flow [2025-03-17 14:17:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-03-17 14:17:10,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-03-17 14:17:10,064 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 158 flow. Second operand 3 states and 177 transitions. [2025-03-17 14:17:10,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 198 flow [2025-03-17 14:17:10,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:10,067 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 142 flow [2025-03-17 14:17:10,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-03-17 14:17:10,068 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2025-03-17 14:17:10,068 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 142 flow [2025-03-17 14:17:10,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-17 14:17:10,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:10,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:17:10,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:17:10,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:10,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:10,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1668970954, now seen corresponding path program 1 times [2025-03-17 14:17:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:10,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394630498] [2025-03-17 14:17:10,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:10,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:10,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:10,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:10,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:17:10,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:17:10,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:17:10,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:10,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:10,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:17:10,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:10,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-17 14:17:10,376 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-17 14:17:10,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:10,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394630498] [2025-03-17 14:17:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394630498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:10,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:10,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944986126] [2025-03-17 14:17:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:10,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:10,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:10,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:10,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2025-03-17 14:17:10,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-17 14:17:10,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:10,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2025-03-17 14:17:10,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:10,566 INFO L124 PetriNetUnfolderBase]: 110/392 cut-off events. [2025-03-17 14:17:10,566 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:17:10,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 392 events. 110/392 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1991 event pairs, 110 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 626. Up to 248 conditions per place. [2025-03-17 14:17:10,568 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 28 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2025-03-17 14:17:10,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 194 flow [2025-03-17 14:17:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-03-17 14:17:10,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7429718875502008 [2025-03-17 14:17:10,570 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 142 flow. Second operand 3 states and 185 transitions. [2025-03-17 14:17:10,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 194 flow [2025-03-17 14:17:10,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:10,571 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 130 flow [2025-03-17 14:17:10,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-03-17 14:17:10,571 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -18 predicate places. [2025-03-17 14:17:10,572 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 130 flow [2025-03-17 14:17:10,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-17 14:17:10,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:10,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:17:10,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:17:10,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:10,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:10,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1668970953, now seen corresponding path program 1 times [2025-03-17 14:17:10,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:10,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408122651] [2025-03-17 14:17:10,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:10,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:10,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:10,775 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:10,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:17:10,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:17:10,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:17:10,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:10,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:10,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:17:10,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:10,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:17:10,896 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-17 14:17:10,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:10,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408122651] [2025-03-17 14:17:10,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408122651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:10,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:10,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:10,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645360413] [2025-03-17 14:17:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:10,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:10,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:10,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:10,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2025-03-17 14:17:10,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-17 14:17:10,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:10,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2025-03-17 14:17:10,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:11,098 INFO L124 PetriNetUnfolderBase]: 99/352 cut-off events. [2025-03-17 14:17:11,099 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:17:11,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 352 events. 99/352 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1770 event pairs, 99 based on Foata normal form. 11/312 useless extension candidates. Maximal degree in co-relation 575. Up to 225 conditions per place. [2025-03-17 14:17:11,100 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 27 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-03-17 14:17:11,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 180 flow [2025-03-17 14:17:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-03-17 14:17:11,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751004016064257 [2025-03-17 14:17:11,102 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 130 flow. Second operand 3 states and 187 transitions. [2025-03-17 14:17:11,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 180 flow [2025-03-17 14:17:11,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:11,103 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 125 flow [2025-03-17 14:17:11,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-03-17 14:17:11,104 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2025-03-17 14:17:11,104 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 125 flow [2025-03-17 14:17:11,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-17 14:17:11,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:11,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:11,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:17:11,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:11,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1950192518, now seen corresponding path program 1 times [2025-03-17 14:17:11,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:11,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71746805] [2025-03-17 14:17:11,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:11,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:11,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:11,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:11,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:17:11,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:17:11,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:17:11,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:11,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:11,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:17:11,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:11,479 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-17 14:17:11,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 14:17:11,494 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-17 14:17:11,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:11,495 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:11,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71746805] [2025-03-17 14:17:11,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71746805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:11,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:11,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:17:11,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379502331] [2025-03-17 14:17:11,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:11,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:17:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:11,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:17:11,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:17:11,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-03-17 14:17:11,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-17 14:17:11,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:11,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-03-17 14:17:11,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:11,790 INFO L124 PetriNetUnfolderBase]: 110/357 cut-off events. [2025-03-17 14:17:11,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:11,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 357 events. 110/357 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1704 event pairs, 110 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 606. Up to 246 conditions per place. [2025-03-17 14:17:11,791 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-17 14:17:11,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 185 flow [2025-03-17 14:17:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:17:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:17:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2025-03-17 14:17:11,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746987951807228 [2025-03-17 14:17:11,792 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 125 flow. Second operand 4 states and 224 transitions. [2025-03-17 14:17:11,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 185 flow [2025-03-17 14:17:11,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:11,793 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 122 flow [2025-03-17 14:17:11,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-03-17 14:17:11,794 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -21 predicate places. [2025-03-17 14:17:11,794 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 122 flow [2025-03-17 14:17:11,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-17 14:17:11,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:11,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:11,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:11,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:11,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:11,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:11,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1950192517, now seen corresponding path program 1 times [2025-03-17 14:17:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789307376] [2025-03-17 14:17:11,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:11,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:11,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:11,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:11,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:17:12,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:17:12,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:17:12,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:12,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:12,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:17:12,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:12,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:17:12,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:12,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:12,144 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-17 14:17:12,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2025-03-17 14:17:12,167 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-17 14:17:12,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:12,167 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:12,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789307376] [2025-03-17 14:17:12,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789307376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:12,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:12,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:12,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578439274] [2025-03-17 14:17:12,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:12,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:12,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:12,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:12,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:12,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 83 [2025-03-17 14:17:12,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:12,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:12,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 83 [2025-03-17 14:17:12,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:12,507 INFO L124 PetriNetUnfolderBase]: 110/344 cut-off events. [2025-03-17 14:17:12,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:12,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 344 events. 110/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1596 event pairs, 110 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 595. Up to 246 conditions per place. [2025-03-17 14:17:12,510 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-03-17 14:17:12,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 182 flow [2025-03-17 14:17:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:17:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:17:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2025-03-17 14:17:12,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6385542168674698 [2025-03-17 14:17:12,511 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 122 flow. Second operand 4 states and 212 transitions. [2025-03-17 14:17:12,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 54 transitions, 182 flow [2025-03-17 14:17:12,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 179 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:12,512 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 117 flow [2025-03-17 14:17:12,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-03-17 14:17:12,513 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -23 predicate places. [2025-03-17 14:17:12,513 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 117 flow [2025-03-17 14:17:12,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:12,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:12,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:12,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:17:12,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:12,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:12,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1359271964, now seen corresponding path program 1 times [2025-03-17 14:17:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:12,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987658592] [2025-03-17 14:17:12,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:12,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:12,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:12,717 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:12,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:17:12,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:17:12,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:17:12,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:12,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:12,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 14:17:12,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:12,889 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-17 14:17:12,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 14:17:13,007 INFO L349 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-03-17 14:17:13,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2025-03-17 14:17:13,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 14:17:13,077 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 42 treesize of output 33 [2025-03-17 14:17:13,146 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 42 treesize of output 33 [2025-03-17 14:17:13,195 INFO L349 Elim1Store]: treesize reduction 84, result has 35.4 percent of original size [2025-03-17 14:17:13,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 71 [2025-03-17 14:17:13,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2025-03-17 14:17:13,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2025-03-17 14:17:13,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2025-03-17 14:17:13,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2025-03-17 14:17:13,920 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-17 14:17:13,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:13,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:13,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987658592] [2025-03-17 14:17:13,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987658592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:13,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:13,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:17:13,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460116961] [2025-03-17 14:17:13,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:13,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:17:13,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:13,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:17:13,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:17:16,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-03-17 14:17:16,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 117 flow. Second operand has 12 states, 12 states have (on average 32.25) internal successors, (387), 12 states have internal predecessors, (387), 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-17 14:17:16,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:16,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-03-17 14:17:16,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:18,202 INFO L124 PetriNetUnfolderBase]: 167/488 cut-off events. [2025-03-17 14:17:18,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:18,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 488 events. 167/488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2511 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 861. Up to 97 conditions per place. [2025-03-17 14:17:18,204 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 62 selfloop transitions, 24 changer transitions 0/102 dead transitions. [2025-03-17 14:17:18,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 385 flow [2025-03-17 14:17:18,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:17:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:17:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 529 transitions. [2025-03-17 14:17:18,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45524956970740105 [2025-03-17 14:17:18,207 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 117 flow. Second operand 14 states and 529 transitions. [2025-03-17 14:17:18,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 102 transitions, 385 flow [2025-03-17 14:17:18,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 102 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:18,212 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 213 flow [2025-03-17 14:17:18,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=213, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-03-17 14:17:18,212 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2025-03-17 14:17:18,212 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 213 flow [2025-03-17 14:17:18,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 32.25) internal successors, (387), 12 states have internal predecessors, (387), 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-17 14:17:18,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:18,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:18,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:17:18,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:18,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:18,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1359271963, now seen corresponding path program 1 times [2025-03-17 14:17:18,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:18,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299124003] [2025-03-17 14:17:18,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:18,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:18,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:18,417 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:18,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:17:18,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:17:18,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:17:18,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:18,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:18,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 14:17:18,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:18,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-17 14:17:18,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:17:18,593 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:17:18,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 14:17:18,615 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-17 14:17:18,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 14:17:18,708 INFO L349 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-03-17 14:17:18,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2025-03-17 14:17:18,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 14:17:18,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 14:17:18,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-17 14:17:18,785 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 18 treesize of output 13 [2025-03-17 14:17:18,799 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 53 treesize of output 42 [2025-03-17 14:17:18,855 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 18 treesize of output 13 [2025-03-17 14:17:18,860 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 53 treesize of output 42 [2025-03-17 14:17:18,887 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-03-17 14:17:18,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-03-17 14:17:18,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2025-03-17 14:17:18,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-03-17 14:17:18,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:17:19,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-03-17 14:17:19,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:17:19,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-03-17 14:17:19,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:17:19,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 17 [2025-03-17 14:17:19,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 14:17:19,303 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-17 14:17:19,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:19,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:19,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299124003] [2025-03-17 14:17:19,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299124003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:19,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:19,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:17:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012475702] [2025-03-17 14:17:19,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:19,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:17:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:19,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:17:19,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:17:20,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-03-17 14:17:20,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 213 flow. Second operand has 11 states, 11 states have (on average 30.363636363636363) internal successors, (334), 11 states have internal predecessors, (334), 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-17 14:17:20,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:20,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-03-17 14:17:20,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:21,904 INFO L124 PetriNetUnfolderBase]: 196/523 cut-off events. [2025-03-17 14:17:21,904 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-03-17 14:17:21,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 523 events. 196/523 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2669 event pairs, 2 based on Foata normal form. 15/509 useless extension candidates. Maximal degree in co-relation 1143. Up to 283 conditions per place. [2025-03-17 14:17:21,906 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 66 selfloop transitions, 17 changer transitions 0/95 dead transitions. [2025-03-17 14:17:21,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 95 transitions, 453 flow [2025-03-17 14:17:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:17:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:17:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 400 transitions. [2025-03-17 14:17:21,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43811610076670315 [2025-03-17 14:17:21,907 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 213 flow. Second operand 11 states and 400 transitions. [2025-03-17 14:17:21,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 95 transitions, 453 flow [2025-03-17 14:17:21,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 95 transitions, 445 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:21,909 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 251 flow [2025-03-17 14:17:21,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=251, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-03-17 14:17:21,910 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -6 predicate places. [2025-03-17 14:17:21,910 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 251 flow [2025-03-17 14:17:21,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 30.363636363636363) internal successors, (334), 11 states have internal predecessors, (334), 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-17 14:17:21,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:21,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:21,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:17:22,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:22,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:22,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:22,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1393070772, now seen corresponding path program 1 times [2025-03-17 14:17:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143744175] [2025-03-17 14:17:22,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:22,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:22,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:22,114 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:22,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:17:22,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:17:22,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:17:22,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:22,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:22,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 14:17:22,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:22,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:17:22,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:17:22,289 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-03-17 14:17:22,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 14:17:22,302 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 14:17:22,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 14:17:22,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 14:17:22,373 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-17 14:17:22,397 INFO L349 Elim1Store]: treesize reduction 60, result has 22.1 percent of original size [2025-03-17 14:17:22,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2025-03-17 14:17:22,435 INFO L349 Elim1Store]: treesize reduction 82, result has 29.9 percent of original size [2025-03-17 14:17:22,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 48 [2025-03-17 14:17:22,500 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 18 treesize of output 13 [2025-03-17 14:17:22,510 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 43 treesize of output 34 [2025-03-17 14:17:22,578 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 18 treesize of output 13 [2025-03-17 14:17:22,586 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 43 treesize of output 34 [2025-03-17 14:17:22,628 INFO L349 Elim1Store]: treesize reduction 62, result has 39.2 percent of original size [2025-03-17 14:17:22,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 49 [2025-03-17 14:17:22,677 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2025-03-17 14:17:22,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 37 [2025-03-17 14:17:22,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:17:22,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2025-03-17 14:17:22,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2025-03-17 14:17:22,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:17:22,832 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 30 treesize of output 23 [2025-03-17 14:17:22,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:17:22,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 13 [2025-03-17 14:17:22,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2025-03-17 14:17:22,991 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-17 14:17:22,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:22,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:22,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143744175] [2025-03-17 14:17:22,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143744175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:22,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:22,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:17:22,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330123236] [2025-03-17 14:17:22,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:22,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:17:22,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:22,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:17:22,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:17:24,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-03-17 14:17:24,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 251 flow. Second operand has 12 states, 12 states have (on average 32.333333333333336) internal successors, (388), 12 states have internal predecessors, (388), 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-17 14:17:24,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:24,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-03-17 14:17:24,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:25,341 INFO L124 PetriNetUnfolderBase]: 212/575 cut-off events. [2025-03-17 14:17:25,341 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2025-03-17 14:17:25,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 575 events. 212/575 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3125 event pairs, 48 based on Foata normal form. 12/552 useless extension candidates. Maximal degree in co-relation 1296. Up to 219 conditions per place. [2025-03-17 14:17:25,344 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 78 selfloop transitions, 23 changer transitions 0/113 dead transitions. [2025-03-17 14:17:25,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 113 transitions, 574 flow [2025-03-17 14:17:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:17:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 14:17:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 499 transitions. [2025-03-17 14:17:25,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46246524559777574 [2025-03-17 14:17:25,352 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 251 flow. Second operand 13 states and 499 transitions. [2025-03-17 14:17:25,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 113 transitions, 574 flow [2025-03-17 14:17:25,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 113 transitions, 555 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-17 14:17:25,356 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 334 flow [2025-03-17 14:17:25,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=334, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2025-03-17 14:17:25,357 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 4 predicate places. [2025-03-17 14:17:25,358 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 334 flow [2025-03-17 14:17:25,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 32.333333333333336) internal successors, (388), 12 states have internal predecessors, (388), 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-17 14:17:25,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:25,358 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-17 14:17:25,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:17:25,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:25,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:25,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:25,559 INFO L85 PathProgramCache]: Analyzing trace with hash 936252876, now seen corresponding path program 1 times [2025-03-17 14:17:25,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:25,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668611450] [2025-03-17 14:17:25,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:25,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:25,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:25,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:25,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:17:25,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:17:25,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:17:25,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:25,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:25,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:17:25,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:25,662 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 9 [2025-03-17 14:17:25,669 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-17 14:17:25,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:25,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668611450] [2025-03-17 14:17:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668611450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:25,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:25,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:17:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496398447] [2025-03-17 14:17:25,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:25,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:25,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:25,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:25,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 83 [2025-03-17 14:17:25,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 72 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:25,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:25,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 83 [2025-03-17 14:17:25,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:25,803 INFO L124 PetriNetUnfolderBase]: 107/351 cut-off events. [2025-03-17 14:17:25,803 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-17 14:17:25,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 351 events. 107/351 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1777 event pairs, 43 based on Foata normal form. 6/339 useless extension candidates. Maximal degree in co-relation 810. Up to 174 conditions per place. [2025-03-17 14:17:25,805 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 57 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2025-03-17 14:17:25,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 88 transitions, 490 flow [2025-03-17 14:17:25,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-03-17 14:17:25,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2025-03-17 14:17:25,806 INFO L175 Difference]: Start difference. First operand has 90 places, 72 transitions, 334 flow. Second operand 3 states and 213 transitions. [2025-03-17 14:17:25,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 88 transitions, 490 flow [2025-03-17 14:17:25,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 88 transitions, 404 flow, removed 4 selfloop flow, removed 15 redundant places. [2025-03-17 14:17:25,809 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 240 flow [2025-03-17 14:17:25,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2025-03-17 14:17:25,809 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2025-03-17 14:17:25,809 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 240 flow [2025-03-17 14:17:25,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:25,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:25,810 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-17 14:17:25,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:17:26,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:26,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash -530759271, now seen corresponding path program 1 times [2025-03-17 14:17:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:26,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797344720] [2025-03-17 14:17:26,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:26,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:26,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:26,013 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:26,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:17:26,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:17:26,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:17:26,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:26,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:26,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:17:26,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:26,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:17:26,138 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-17 14:17:26,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 14:17:26,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 14:17:26,196 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-17 14:17:26,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:26,196 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:26,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797344720] [2025-03-17 14:17:26,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797344720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:26,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:26,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:17:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904610348] [2025-03-17 14:17:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:26,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:17:26,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:26,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:17:26,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:17:26,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2025-03-17 14:17:26,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-17 14:17:26,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:26,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2025-03-17 14:17:26,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:26,561 INFO L124 PetriNetUnfolderBase]: 143/452 cut-off events. [2025-03-17 14:17:26,561 INFO L125 PetriNetUnfolderBase]: For 134/135 co-relation queries the response was YES. [2025-03-17 14:17:26,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 452 events. 143/452 cut-off events. For 134/135 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2423 event pairs, 13 based on Foata normal form. 10/442 useless extension candidates. Maximal degree in co-relation 1021. Up to 183 conditions per place. [2025-03-17 14:17:26,563 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 59 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2025-03-17 14:17:26,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 468 flow [2025-03-17 14:17:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2025-03-17 14:17:26,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2025-03-17 14:17:26,564 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 240 flow. Second operand 5 states and 305 transitions. [2025-03-17 14:17:26,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 468 flow [2025-03-17 14:17:26,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 92 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:26,566 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 293 flow [2025-03-17 14:17:26,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2025-03-17 14:17:26,567 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -5 predicate places. [2025-03-17 14:17:26,567 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 293 flow [2025-03-17 14:17:26,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-17 14:17:26,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:26,567 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-17 14:17:26,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:26,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:26,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:26,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash -530759272, now seen corresponding path program 1 times [2025-03-17 14:17:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:26,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557101617] [2025-03-17 14:17:26,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:26,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:26,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:26,770 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:26,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:17:26,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:17:26,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:17:26,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:26,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:26,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:17:26,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:26,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-17 14:17:26,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 14:17:26,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 14:17:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:26,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:26,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:26,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557101617] [2025-03-17 14:17:26,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557101617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:26,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:26,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:17:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912838978] [2025-03-17 14:17:26,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:26,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:17:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:26,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:17:26,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:17:26,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2025-03-17 14:17:26,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-17 14:17:26,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:26,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2025-03-17 14:17:26,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:27,153 INFO L124 PetriNetUnfolderBase]: 143/440 cut-off events. [2025-03-17 14:17:27,153 INFO L125 PetriNetUnfolderBase]: For 230/231 co-relation queries the response was YES. [2025-03-17 14:17:27,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 440 events. 143/440 cut-off events. For 230/231 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2310 event pairs, 58 based on Foata normal form. 11/435 useless extension candidates. Maximal degree in co-relation 1080. Up to 195 conditions per place. [2025-03-17 14:17:27,156 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 52 selfloop transitions, 18 changer transitions 0/89 dead transitions. [2025-03-17 14:17:27,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 489 flow [2025-03-17 14:17:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 302 transitions. [2025-03-17 14:17:27,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.727710843373494 [2025-03-17 14:17:27,158 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 293 flow. Second operand 5 states and 302 transitions. [2025-03-17 14:17:27,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 489 flow [2025-03-17 14:17:27,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 89 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:27,161 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 365 flow [2025-03-17 14:17:27,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2025-03-17 14:17:27,161 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 1 predicate places. [2025-03-17 14:17:27,162 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 365 flow [2025-03-17 14:17:27,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-17 14:17:27,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:27,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] [2025-03-17 14:17:27,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 14:17:27,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:27,363 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:27,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash 198578009, now seen corresponding path program 1 times [2025-03-17 14:17:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858070594] [2025-03-17 14:17:27,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:27,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:27,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:27,366 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:27,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:17:27,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:17:27,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:17:27,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:27,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:27,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 14:17:27,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:27,505 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-17 14:17:27,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2025-03-17 14:17:27,546 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-17 14:17:27,565 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-17 14:17:27,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 14:17:27,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:17:27,602 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 17 treesize of output 12 [2025-03-17 14:17:27,614 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 16 treesize of output 11 [2025-03-17 14:17:27,635 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 16 treesize of output 11 [2025-03-17 14:17:27,641 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 17 treesize of output 12 [2025-03-17 14:17:27,651 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-17 14:17:27,651 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 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-17 14:17:27,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-03-17 14:17:27,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:17:27,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-17 14:17:27,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2025-03-17 14:17:27,772 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:17:27,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2025-03-17 14:17:27,790 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:17:27,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-03-17 14:17:27,940 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 14:17:27,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 14:17:27,945 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 24 treesize of output 11 [2025-03-17 14:17:28,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 14:17:28,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-17 14:17:28,025 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-17 14:17:28,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:28,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:28,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858070594] [2025-03-17 14:17:28,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858070594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:28,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:28,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 14:17:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574219937] [2025-03-17 14:17:28,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:28,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:17:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:28,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:17:28,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:17:32,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:17:37,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:17:38,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-03-17 14:17:38,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 365 flow. Second operand has 14 states, 14 states have (on average 44.5) internal successors, (623), 14 states have internal predecessors, (623), 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-17 14:17:38,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:38,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-03-17 14:17:38,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:42,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:17:43,610 INFO L124 PetriNetUnfolderBase]: 167/478 cut-off events. [2025-03-17 14:17:43,610 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES. [2025-03-17 14:17:43,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 478 events. 167/478 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2507 event pairs, 26 based on Foata normal form. 6/468 useless extension candidates. Maximal degree in co-relation 1361. Up to 117 conditions per place. [2025-03-17 14:17:43,612 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 66 selfloop transitions, 32 changer transitions 2/113 dead transitions. [2025-03-17 14:17:43,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 113 transitions, 746 flow [2025-03-17 14:17:43,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 14:17:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 14:17:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 725 transitions. [2025-03-17 14:17:43,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5823293172690763 [2025-03-17 14:17:43,614 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 365 flow. Second operand 15 states and 725 transitions. [2025-03-17 14:17:43,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 113 transitions, 746 flow [2025-03-17 14:17:43,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 113 transitions, 715 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:43,617 INFO L231 Difference]: Finished difference. Result has 101 places, 80 transitions, 471 flow [2025-03-17 14:17:43,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=471, PETRI_PLACES=101, PETRI_TRANSITIONS=80} [2025-03-17 14:17:43,619 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 15 predicate places. [2025-03-17 14:17:43,619 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 80 transitions, 471 flow [2025-03-17 14:17:43,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 44.5) internal successors, (623), 14 states have internal predecessors, (623), 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-17 14:17:43,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:43,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:43,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 14:17:43,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:43,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:43,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1052100724, now seen corresponding path program 1 times [2025-03-17 14:17:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:43,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876246797] [2025-03-17 14:17:43,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:43,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:43,822 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:43,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:17:43,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:17:43,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:17:43,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:43,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:43,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 14:17:43,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:43,979 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-17 14:17:43,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2025-03-17 14:17:44,023 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-17 14:17:44,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 14:17:44,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 14:17:44,056 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 14 [2025-03-17 14:17:44,089 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 14 [2025-03-17 14:17:44,108 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2025-03-17 14:17:44,108 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 20 treesize of output 22 [2025-03-17 14:17:44,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-17 14:17:44,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-17 14:17:44,172 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 14 [2025-03-17 14:17:44,248 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 14:17:44,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2025-03-17 14:17:44,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-17 14:17:44,290 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-17 14:17:44,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:44,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:44,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876246797] [2025-03-17 14:17:44,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876246797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:44,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:44,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 14:17:44,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120076338] [2025-03-17 14:17:44,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:44,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:17:44,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:44,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:17:44,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:17:45,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-03-17 14:17:45,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 80 transitions, 471 flow. Second operand has 14 states, 14 states have (on average 32.5) internal successors, (455), 14 states have internal predecessors, (455), 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-17 14:17:45,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:45,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-03-17 14:17:45,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:46,686 INFO L124 PetriNetUnfolderBase]: 171/506 cut-off events. [2025-03-17 14:17:46,687 INFO L125 PetriNetUnfolderBase]: For 703/703 co-relation queries the response was YES. [2025-03-17 14:17:46,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 506 events. 171/506 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2700 event pairs, 36 based on Foata normal form. 7/491 useless extension candidates. Maximal degree in co-relation 1499. Up to 80 conditions per place. [2025-03-17 14:17:46,689 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 64 selfloop transitions, 38 changer transitions 2/118 dead transitions. [2025-03-17 14:17:46,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 118 transitions, 814 flow [2025-03-17 14:17:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:17:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:17:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 517 transitions. [2025-03-17 14:17:46,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4449225473321859 [2025-03-17 14:17:46,690 INFO L175 Difference]: Start difference. First operand has 101 places, 80 transitions, 471 flow. Second operand 14 states and 517 transitions. [2025-03-17 14:17:46,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 118 transitions, 814 flow [2025-03-17 14:17:46,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 787 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-17 14:17:46,693 INFO L231 Difference]: Finished difference. Result has 107 places, 83 transitions, 558 flow [2025-03-17 14:17:46,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=558, PETRI_PLACES=107, PETRI_TRANSITIONS=83} [2025-03-17 14:17:46,694 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 21 predicate places. [2025-03-17 14:17:46,694 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 83 transitions, 558 flow [2025-03-17 14:17:46,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 32.5) internal successors, (455), 14 states have internal predecessors, (455), 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-17 14:17:46,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:46,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:46,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 14:17:46,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:46,895 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:46,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:46,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1894497187, now seen corresponding path program 1 times [2025-03-17 14:17:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:46,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790816805] [2025-03-17 14:17:46,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:46,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:46,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:46,897 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:46,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 14:17:46,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:17:47,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:17:47,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:47,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:47,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 14:17:47,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:47,059 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-17 14:17:47,076 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-17 14:17:47,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 14:17:47,108 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 18 treesize of output 13 [2025-03-17 14:17:47,145 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 18 treesize of output 13 [2025-03-17 14:17:47,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:17:47,182 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2025-03-17 14:17:47,182 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 20 treesize of output 22 [2025-03-17 14:17:47,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:17:47,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:17:47,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:17:47,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 14:17:47,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2025-03-17 14:17:47,582 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-17 14:17:47,582 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 1 case distinctions, treesize of input 32 treesize of output 33 [2025-03-17 14:17:47,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 14:17:47,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-17 14:17:47,671 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-17 14:17:47,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:47,672 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:47,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790816805] [2025-03-17 14:17:47,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790816805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:47,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:47,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:17:47,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615759576] [2025-03-17 14:17:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:47,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:17:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:47,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:17:47,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:17:49,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-03-17 14:17:49,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 83 transitions, 558 flow. Second operand has 13 states, 13 states have (on average 32.53846153846154) internal successors, (423), 13 states have internal predecessors, (423), 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-17 14:17:49,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:49,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-03-17 14:17:49,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:50,990 INFO L124 PetriNetUnfolderBase]: 192/568 cut-off events. [2025-03-17 14:17:50,990 INFO L125 PetriNetUnfolderBase]: For 997/999 co-relation queries the response was YES. [2025-03-17 14:17:50,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 568 events. 192/568 cut-off events. For 997/999 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3154 event pairs, 29 based on Foata normal form. 24/590 useless extension candidates. Maximal degree in co-relation 1819. Up to 148 conditions per place. [2025-03-17 14:17:50,993 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 84 selfloop transitions, 45 changer transitions 1/142 dead transitions. [2025-03-17 14:17:50,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 142 transitions, 1115 flow [2025-03-17 14:17:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 14:17:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-17 14:17:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 727 transitions. [2025-03-17 14:17:50,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43795180722891563 [2025-03-17 14:17:50,995 INFO L175 Difference]: Start difference. First operand has 107 places, 83 transitions, 558 flow. Second operand 20 states and 727 transitions. [2025-03-17 14:17:50,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 142 transitions, 1115 flow [2025-03-17 14:17:50,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 142 transitions, 1035 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-03-17 14:17:50,999 INFO L231 Difference]: Finished difference. Result has 112 places, 93 transitions, 669 flow [2025-03-17 14:17:50,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=669, PETRI_PLACES=112, PETRI_TRANSITIONS=93} [2025-03-17 14:17:51,000 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 26 predicate places. [2025-03-17 14:17:51,000 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 93 transitions, 669 flow [2025-03-17 14:17:51,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 32.53846153846154) internal successors, (423), 13 states have internal predecessors, (423), 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-17 14:17:51,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:51,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:51,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 14:17:51,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:51,201 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-03-17 14:17:51,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:51,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1894497188, now seen corresponding path program 1 times [2025-03-17 14:17:51,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:51,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117855982] [2025-03-17 14:17:51,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:51,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:51,203 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:51,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 14:17:51,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:17:51,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:17:51,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:51,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:51,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 14:17:51,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:51,363 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-03-17 14:17:51,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 14:17:51,430 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2025-03-17 14:17:51,430 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 3 case distinctions, treesize of input 24 treesize of output 26 [2025-03-17 14:17:51,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:17:51,462 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 17 treesize of output 12 [2025-03-17 14:17:51,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-17 14:17:51,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-03-17 14:17:51,527 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:17:51,528 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 1 case distinctions, treesize of input 17 treesize of output 16 [2025-03-17 14:17:51,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 14:17:51,590 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-17 14:17:51,590 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 1 case distinctions, treesize of input 24 treesize of output 27 [2025-03-17 14:17:51,684 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-03-17 14:17:51,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 35 [2025-03-17 14:17:52,102 INFO L349 Elim1Store]: treesize reduction 76, result has 42.9 percent of original size [2025-03-17 14:17:52,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 107 [2025-03-17 14:17:52,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 14:17:52,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 14:17:52,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 11 [2025-03-17 14:17:52,975 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-17 14:17:52,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:52,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117855982] [2025-03-17 14:17:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117855982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:52,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:52,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 14:17:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777420416] [2025-03-17 14:17:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:52,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:17:52,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:52,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:17:52,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:17:57,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:01,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:06,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:07,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 83 [2025-03-17 14:18:07,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 93 transitions, 669 flow. Second operand has 14 states, 14 states have (on average 43.42857142857143) internal successors, (608), 14 states have internal predecessors, (608), 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-17 14:18:07,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:07,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 83 [2025-03-17 14:18:07,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:12,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:16,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:19,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]