./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c -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 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:26:14,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:26:14,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:26:14,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:26:14,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:26:14,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:26:14,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:26:14,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:26:14,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:26:14,954 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:26:14,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:26:14,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:26:14,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:26:14,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:26:14,954 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:26:14,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:26:14,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:26:14,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:26:14,955 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:26:14,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:26:14,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:26:14,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:26:14,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:26:14,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:26:14,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:26:14,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:26:14,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:26:14,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:26:14,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:26:14,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:26:14,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:26:14,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:26:14,957 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 -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2025-03-09 01:26:15,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:26:15,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:26:15,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:26:15,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:26:15,209 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:26:15,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-03-09 01:26:16,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d02b2fa/baf28c0ed5ea41b8b250c45dee6ee2f3/FLAGae18bf992 [2025-03-09 01:26:16,631 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:26:16,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-03-09 01:26:16,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d02b2fa/baf28c0ed5ea41b8b250c45dee6ee2f3/FLAGae18bf992 [2025-03-09 01:26:16,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d02b2fa/baf28c0ed5ea41b8b250c45dee6ee2f3 [2025-03-09 01:26:16,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:26:16,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:26:16,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:26:16,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:26:16,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:26:16,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:26:16" (1/1) ... [2025-03-09 01:26:16,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257b469b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:16, skipping insertion in model container [2025-03-09 01:26:16,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:26:16" (1/1) ... [2025-03-09 01:26:16,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:26:17,088 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:26:17,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:26:17,098 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:26:17,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:26:17,134 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:26:17,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17 WrapperNode [2025-03-09 01:26:17,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:26:17,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:26:17,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:26:17,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:26:17,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,169 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 12, calls inlined = 14, statements flattened = 177 [2025-03-09 01:26:17,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:26:17,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:26:17,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:26:17,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:26:17,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,195 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 01:26:17,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:26:17,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:26:17,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:26:17,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:26:17,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (1/1) ... [2025-03-09 01:26:17,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:26:17,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:17,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:26:17,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:26:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:26:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:26:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:26:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:26:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:26:17,256 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:26:17,335 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:26:17,337 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:26:17,696 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:26:17,696 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:26:17,888 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:26:17,888 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:26:17,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:26:17 BoogieIcfgContainer [2025-03-09 01:26:17,889 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:26:17,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:26:17,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:26:17,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:26:17,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:26:16" (1/3) ... [2025-03-09 01:26:17,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c8c0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:26:17, skipping insertion in model container [2025-03-09 01:26:17,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:17" (2/3) ... [2025-03-09 01:26:17,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c8c0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:26:17, skipping insertion in model container [2025-03-09 01:26:17,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:26:17" (3/3) ... [2025-03-09 01:26:17,899 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2025-03-09 01:26:17,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:26:17,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-dec-subseq.wvr.c that has 3 procedures, 49 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-03-09 01:26:17,914 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:26:17,970 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:26:18,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 53 transitions, 120 flow [2025-03-09 01:26:18,035 INFO L124 PetriNetUnfolderBase]: 5/51 cut-off events. [2025-03-09 01:26:18,038 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:26:18,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 51 events. 5/51 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 134 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-09 01:26:18,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 53 transitions, 120 flow [2025-03-09 01:26:18,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 50 transitions, 112 flow [2025-03-09 01:26:18,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:26:18,060 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;@1c78e820, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:26:18,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-09 01:26:18,064 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:26:18,064 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:26:18,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:26:18,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:18,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:26:18,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:18,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:18,070 INFO L85 PathProgramCache]: Analyzing trace with hash 517800, now seen corresponding path program 1 times [2025-03-09 01:26:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:18,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216902354] [2025-03-09 01:26:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:18,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:18,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:26:18,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:26:18,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:18,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:18,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:18,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216902354] [2025-03-09 01:26:18,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216902354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:18,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:26:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513043310] [2025-03-09 01:26:18,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:18,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:18,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:18,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:18,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:18,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-09 01:26:18,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:18,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:18,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-09 01:26:18,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:18,523 INFO L124 PetriNetUnfolderBase]: 285/545 cut-off events. [2025-03-09 01:26:18,524 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-09 01:26:18,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 545 events. 285/545 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2938 event pairs, 200 based on Foata normal form. 1/350 useless extension candidates. Maximal degree in co-relation 969. Up to 454 conditions per place. [2025-03-09 01:26:18,531 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 30 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-03-09 01:26:18,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 168 flow [2025-03-09 01:26:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-09 01:26:18,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5408805031446541 [2025-03-09 01:26:18,548 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 112 flow. Second operand 3 states and 86 transitions. [2025-03-09 01:26:18,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 168 flow [2025-03-09 01:26:18,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:18,556 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 100 flow [2025-03-09 01:26:18,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-03-09 01:26:18,564 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-03-09 01:26:18,564 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 100 flow [2025-03-09 01:26:18,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:18,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:18,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:26:18,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:26:18,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:18,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash 517801, now seen corresponding path program 1 times [2025-03-09 01:26:18,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:18,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884543214] [2025-03-09 01:26:18,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:18,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:26:18,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:26:18,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:18,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884543214] [2025-03-09 01:26:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884543214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:18,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:18,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603791945] [2025-03-09 01:26:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:18,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:18,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:18,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:18,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:18,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-09 01:26:18,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:18,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:18,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-09 01:26:18,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:19,002 INFO L124 PetriNetUnfolderBase]: 286/548 cut-off events. [2025-03-09 01:26:19,003 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:26:19,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 548 events. 286/548 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2942 event pairs, 200 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 999. Up to 463 conditions per place. [2025-03-09 01:26:19,007 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 33 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2025-03-09 01:26:19,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 180 flow [2025-03-09 01:26:19,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-09 01:26:19,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-09 01:26:19,010 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 100 flow. Second operand 4 states and 106 transitions. [2025-03-09 01:26:19,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 180 flow [2025-03-09 01:26:19,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:19,012 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 123 flow [2025-03-09 01:26:19,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-03-09 01:26:19,012 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-03-09 01:26:19,012 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 123 flow [2025-03-09 01:26:19,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:19,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:19,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:26:19,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:26:19,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:19,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash 16052759, now seen corresponding path program 1 times [2025-03-09 01:26:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:19,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038328108] [2025-03-09 01:26:19,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:19,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:19,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:26:19,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:26:19,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:19,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:19,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:19,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038328108] [2025-03-09 01:26:19,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038328108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:19,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:19,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:26:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380382450] [2025-03-09 01:26:19,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:19,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:26:19,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:19,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:26:19,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:26:19,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-09 01:26:19,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:19,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:19,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-09 01:26:19,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:19,413 INFO L124 PetriNetUnfolderBase]: 287/551 cut-off events. [2025-03-09 01:26:19,413 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:26:19,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 551 events. 287/551 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2970 event pairs, 200 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 1020. Up to 462 conditions per place. [2025-03-09 01:26:19,419 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 33 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2025-03-09 01:26:19,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 209 flow [2025-03-09 01:26:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-09 01:26:19,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47547169811320755 [2025-03-09 01:26:19,421 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 123 flow. Second operand 5 states and 126 transitions. [2025-03-09 01:26:19,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 209 flow [2025-03-09 01:26:19,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:19,422 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 157 flow [2025-03-09 01:26:19,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2025-03-09 01:26:19,423 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-03-09 01:26:19,423 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 157 flow [2025-03-09 01:26:19,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:19,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:19,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:26:19,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:26:19,423 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:19,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash 16052792, now seen corresponding path program 1 times [2025-03-09 01:26:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:19,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502307318] [2025-03-09 01:26:19,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:19,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:26:19,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:26:19,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:19,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:19,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502307318] [2025-03-09 01:26:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502307318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:19,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:19,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:26:19,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591084577] [2025-03-09 01:26:19,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:19,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:19,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:19,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:19,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2025-03-09 01:26:19,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:19,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:19,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2025-03-09 01:26:19,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:19,621 INFO L124 PetriNetUnfolderBase]: 272/497 cut-off events. [2025-03-09 01:26:19,621 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:26:19,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 497 events. 272/497 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2418 event pairs, 200 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 960. Up to 439 conditions per place. [2025-03-09 01:26:19,632 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 35 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-03-09 01:26:19,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 225 flow [2025-03-09 01:26:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-03-09 01:26:19,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41509433962264153 [2025-03-09 01:26:19,637 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 157 flow. Second operand 4 states and 88 transitions. [2025-03-09 01:26:19,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 225 flow [2025-03-09 01:26:19,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:19,640 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 154 flow [2025-03-09 01:26:19,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-03-09 01:26:19,640 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-09 01:26:19,641 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 154 flow [2025-03-09 01:26:19,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:19,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:19,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:26:19,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:26:19,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:19,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:19,642 INFO L85 PathProgramCache]: Analyzing trace with hash 16052793, now seen corresponding path program 1 times [2025-03-09 01:26:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:19,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752017387] [2025-03-09 01:26:19,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:19,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:26:19,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:26:19,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:19,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:19,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:19,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752017387] [2025-03-09 01:26:19,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752017387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:19,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:19,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:26:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19107000] [2025-03-09 01:26:19,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:19,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:19,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:19,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:19,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-03-09 01:26:19,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:19,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:19,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-03-09 01:26:19,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:19,796 INFO L124 PetriNetUnfolderBase]: 263/486 cut-off events. [2025-03-09 01:26:19,796 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:26:19,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 486 events. 263/486 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2451 event pairs, 179 based on Foata normal form. 1/339 useless extension candidates. Maximal degree in co-relation 923. Up to 423 conditions per place. [2025-03-09 01:26:19,798 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 33 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-03-09 01:26:19,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 219 flow [2025-03-09 01:26:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-09 01:26:19,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5723270440251572 [2025-03-09 01:26:19,801 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 154 flow. Second operand 3 states and 91 transitions. [2025-03-09 01:26:19,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 219 flow [2025-03-09 01:26:19,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:19,804 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 150 flow [2025-03-09 01:26:19,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2025-03-09 01:26:19,804 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-09 01:26:19,804 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 150 flow [2025-03-09 01:26:19,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:19,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:19,805 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:26:19,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:26:19,805 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:19,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash 497622920, now seen corresponding path program 1 times [2025-03-09 01:26:19,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:19,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828345256] [2025-03-09 01:26:19,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:19,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:19,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:26:19,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:26:19,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:19,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:20,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828345256] [2025-03-09 01:26:20,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828345256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163332951] [2025-03-09 01:26:20,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:20,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:20,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:20,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:26:20,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:26:20,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:26:20,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:26:20,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:20,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:20,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:26:20,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:20,116 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-09 01:26:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:20,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:20,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163332951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:20,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:20,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:26:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293597414] [2025-03-09 01:26:20,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:20,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:26:20,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:20,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:26:20,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:26:20,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-09 01:26:20,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 150 flow. Second operand has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:20,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:20,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-09 01:26:20,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:20,612 INFO L124 PetriNetUnfolderBase]: 264/488 cut-off events. [2025-03-09 01:26:20,612 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-09 01:26:20,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 488 events. 264/488 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2437 event pairs, 179 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 925. Up to 423 conditions per place. [2025-03-09 01:26:20,615 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 30 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2025-03-09 01:26:20,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 243 flow [2025-03-09 01:26:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:26:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:26:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2025-03-09 01:26:20,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41509433962264153 [2025-03-09 01:26:20,618 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 150 flow. Second operand 8 states and 176 transitions. [2025-03-09 01:26:20,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 243 flow [2025-03-09 01:26:20,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 239 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:20,619 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 179 flow [2025-03-09 01:26:20,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2025-03-09 01:26:20,621 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-03-09 01:26:20,621 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 179 flow [2025-03-09 01:26:20,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:20,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:20,621 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 01:26:20,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:20,826 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,SelfDestructingSolverStorable5 [2025-03-09 01:26:20,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:20,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:20,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1753152194, now seen corresponding path program 1 times [2025-03-09 01:26:20,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:20,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361044722] [2025-03-09 01:26:20,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:20,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:26:20,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:26:20,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:20,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:21,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:21,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361044722] [2025-03-09 01:26:21,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361044722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:21,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827910494] [2025-03-09 01:26:21,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:21,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:21,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:21,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:26:21,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:26:21,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:26:21,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:26:21,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:21,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:21,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:26:21,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:21,090 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-09 01:26:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:21,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:21,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827910494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:21,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:21,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:26:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687261480] [2025-03-09 01:26:21,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:21,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:26:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:21,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:26:21,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:26:21,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-09 01:26:21,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 179 flow. Second operand has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:21,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:21,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-09 01:26:21,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:21,767 INFO L124 PetriNetUnfolderBase]: 264/487 cut-off events. [2025-03-09 01:26:21,767 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 01:26:21,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 487 events. 264/487 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2423 event pairs, 179 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 923. Up to 414 conditions per place. [2025-03-09 01:26:21,770 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 25 selfloop transitions, 14 changer transitions 0/48 dead transitions. [2025-03-09 01:26:21,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 253 flow [2025-03-09 01:26:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:26:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:26:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2025-03-09 01:26:21,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42048517520215634 [2025-03-09 01:26:21,771 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 179 flow. Second operand 7 states and 156 transitions. [2025-03-09 01:26:21,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 253 flow [2025-03-09 01:26:21,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 207 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-09 01:26:21,775 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 157 flow [2025-03-09 01:26:21,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-03-09 01:26:21,775 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-03-09 01:26:21,775 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 157 flow [2025-03-09 01:26:21,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:21,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:21,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:26:21,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:21,976 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,SelfDestructingSolverStorable6 [2025-03-09 01:26:21,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:21,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1753152160, now seen corresponding path program 1 times [2025-03-09 01:26:21,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:21,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246696522] [2025-03-09 01:26:21,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:21,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:21,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:26:21,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:26:21,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:21,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246696522] [2025-03-09 01:26:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246696522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362034922] [2025-03-09 01:26:22,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:22,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:22,064 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-09 01:26:22,067 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-09 01:26:22,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:26:22,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:26:22,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:22,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:22,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:26:22,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:22,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:22,155 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 22 treesize of output 18 [2025-03-09 01:26:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362034922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:22,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 01:26:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606870243] [2025-03-09 01:26:22,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:22,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:26:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:22,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:26:22,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:26:22,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2025-03-09 01:26:22,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 157 flow. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:22,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:22,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2025-03-09 01:26:22,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:22,351 INFO L124 PetriNetUnfolderBase]: 264/486 cut-off events. [2025-03-09 01:26:22,352 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:26:22,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 486 events. 264/486 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2426 event pairs, 179 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 903. Up to 414 conditions per place. [2025-03-09 01:26:22,353 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 33 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2025-03-09 01:26:22,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 233 flow [2025-03-09 01:26:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-09 01:26:22,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47924528301886793 [2025-03-09 01:26:22,355 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 157 flow. Second operand 5 states and 127 transitions. [2025-03-09 01:26:22,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 233 flow [2025-03-09 01:26:22,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 208 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-09 01:26:22,356 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 142 flow [2025-03-09 01:26:22,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2025-03-09 01:26:22,357 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-09 01:26:22,357 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 142 flow [2025-03-09 01:26:22,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:22,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:22,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:22,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:22,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:22,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:22,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1002766472, now seen corresponding path program 1 times [2025-03-09 01:26:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:22,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941894929] [2025-03-09 01:26:22,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:22,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:26:22,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:26:22,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:22,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941894929] [2025-03-09 01:26:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941894929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107135713] [2025-03-09 01:26:22,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:22,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:22,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:22,670 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-09 01:26:22,672 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-09 01:26:22,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:26:22,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:26:22,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:22,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:22,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:26:22,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:22,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:26:22,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107135713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:22,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:26:22,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 01:26:22,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336402953] [2025-03-09 01:26:22,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:22,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:22,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:22,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:22,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:26:22,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2025-03-09 01:26:22,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:22,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:22,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2025-03-09 01:26:22,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:22,865 INFO L124 PetriNetUnfolderBase]: 488/848 cut-off events. [2025-03-09 01:26:22,866 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:26:22,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1717 conditions, 848 events. 488/848 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4333 event pairs, 159 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 1660. Up to 478 conditions per place. [2025-03-09 01:26:22,869 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 61 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2025-03-09 01:26:22,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 317 flow [2025-03-09 01:26:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-03-09 01:26:22,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5613207547169812 [2025-03-09 01:26:22,872 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 142 flow. Second operand 4 states and 119 transitions. [2025-03-09 01:26:22,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 317 flow [2025-03-09 01:26:22,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 306 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:22,874 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 149 flow [2025-03-09 01:26:22,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2025-03-09 01:26:22,875 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-03-09 01:26:22,875 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 149 flow [2025-03-09 01:26:22,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:22,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:22,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:22,883 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-09 01:26:23,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:23,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:23,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1585919529, now seen corresponding path program 1 times [2025-03-09 01:26:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841771135] [2025-03-09 01:26:23,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:23,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:26:23,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:26:23,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:23,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:23,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841771135] [2025-03-09 01:26:23,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841771135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:23,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:23,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:23,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371567466] [2025-03-09 01:26:23,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:23,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:23,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:23,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:23,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-03-09 01:26:23,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:23,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:23,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-03-09 01:26:23,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:23,257 INFO L124 PetriNetUnfolderBase]: 473/915 cut-off events. [2025-03-09 01:26:23,258 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-09 01:26:23,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 915 events. 473/915 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5364 event pairs, 381 based on Foata normal form. 37/754 useless extension candidates. Maximal degree in co-relation 1468. Up to 664 conditions per place. [2025-03-09 01:26:23,263 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 55 selfloop transitions, 4 changer transitions 1/68 dead transitions. [2025-03-09 01:26:23,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 334 flow [2025-03-09 01:26:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2025-03-09 01:26:23,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2025-03-09 01:26:23,264 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 149 flow. Second operand 5 states and 155 transitions. [2025-03-09 01:26:23,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 334 flow [2025-03-09 01:26:23,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:23,266 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 177 flow [2025-03-09 01:26:23,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2025-03-09 01:26:23,267 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-03-09 01:26:23,267 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 177 flow [2025-03-09 01:26:23,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:23,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:23,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:23,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:26:23,268 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:23,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:23,269 INFO L85 PathProgramCache]: Analyzing trace with hash -490829782, now seen corresponding path program 1 times [2025-03-09 01:26:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:23,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294118454] [2025-03-09 01:26:23,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:23,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:26:23,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:26:23,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:23,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:23,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294118454] [2025-03-09 01:26:23,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294118454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:23,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132881763] [2025-03-09 01:26:23,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:23,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:23,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:23,419 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-09 01:26:23,421 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-09 01:26:23,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:26:23,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:26:23,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:23,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:23,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:26:23,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:23,479 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-09 01:26:23,526 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:26:23,527 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 18 treesize of output 17 [2025-03-09 01:26:23,538 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:26:23,538 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 11 treesize of output 11 [2025-03-09 01:26:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:23,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:26:23,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132881763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:23,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:26:23,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2025-03-09 01:26:23,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654921896] [2025-03-09 01:26:23,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:23,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:26:23,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:23,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:26:23,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:26:23,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-09 01:26:23,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:23,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:23,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-09 01:26:23,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:23,735 INFO L124 PetriNetUnfolderBase]: 382/758 cut-off events. [2025-03-09 01:26:23,735 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-09 01:26:23,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 758 events. 382/758 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4262 event pairs, 300 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 1298. Up to 654 conditions per place. [2025-03-09 01:26:23,738 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 34 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2025-03-09 01:26:23,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 247 flow [2025-03-09 01:26:23,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-09 01:26:23,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4377358490566038 [2025-03-09 01:26:23,739 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 177 flow. Second operand 5 states and 116 transitions. [2025-03-09 01:26:23,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 247 flow [2025-03-09 01:26:23,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:23,740 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 174 flow [2025-03-09 01:26:23,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-03-09 01:26:23,741 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-03-09 01:26:23,741 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 174 flow [2025-03-09 01:26:23,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:23,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:23,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:23,748 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-09 01:26:23,946 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,SelfDestructingSolverStorable10 [2025-03-09 01:26:23,946 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:23,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash -490829783, now seen corresponding path program 1 times [2025-03-09 01:26:23,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:23,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024856570] [2025-03-09 01:26:23,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:23,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:23,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:26:23,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:26:23,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:23,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:26:24,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:24,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024856570] [2025-03-09 01:26:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024856570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:24,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:24,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:26:24,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562317907] [2025-03-09 01:26:24,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:26:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:24,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:26:24,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:26:24,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 53 [2025-03-09 01:26:24,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:24,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:24,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 53 [2025-03-09 01:26:24,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:24,148 INFO L124 PetriNetUnfolderBase]: 355/691 cut-off events. [2025-03-09 01:26:24,148 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-09 01:26:24,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 691 events. 355/691 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3500 event pairs, 279 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 1035. Up to 615 conditions per place. [2025-03-09 01:26:24,151 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 33 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2025-03-09 01:26:24,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 242 flow [2025-03-09 01:26:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-09 01:26:24,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41509433962264153 [2025-03-09 01:26:24,151 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 174 flow. Second operand 5 states and 110 transitions. [2025-03-09 01:26:24,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 242 flow [2025-03-09 01:26:24,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 233 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:24,152 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 167 flow [2025-03-09 01:26:24,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-03-09 01:26:24,153 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-03-09 01:26:24,153 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 167 flow [2025-03-09 01:26:24,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:24,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:24,153 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:24,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:26:24,153 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:24,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash -644673072, now seen corresponding path program 1 times [2025-03-09 01:26:24,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:24,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57662615] [2025-03-09 01:26:24,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:24,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:24,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:26:24,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:26:24,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:24,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:24,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:24,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57662615] [2025-03-09 01:26:24,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57662615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:24,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058623423] [2025-03-09 01:26:24,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:24,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:24,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:24,243 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-09 01:26:24,245 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-09 01:26:24,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:26:24,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:26:24,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:24,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:24,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:26:24,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:24,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:24,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058623423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:24,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:24,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 01:26:24,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257908075] [2025-03-09 01:26:24,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:24,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:26:24,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:24,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:26:24,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:26:24,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2025-03-09 01:26:24,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 167 flow. Second operand has 15 states, 15 states have (on average 20.066666666666666) internal successors, (301), 15 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:24,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:24,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2025-03-09 01:26:24,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:24,708 INFO L124 PetriNetUnfolderBase]: 549/1077 cut-off events. [2025-03-09 01:26:24,709 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-03-09 01:26:24,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1077 events. 549/1077 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5996 event pairs, 186 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1584. Up to 274 conditions per place. [2025-03-09 01:26:24,713 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 82 selfloop transitions, 21 changer transitions 0/110 dead transitions. [2025-03-09 01:26:24,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 542 flow [2025-03-09 01:26:24,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:26:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:26:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 295 transitions. [2025-03-09 01:26:24,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060034305317325 [2025-03-09 01:26:24,714 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 167 flow. Second operand 11 states and 295 transitions. [2025-03-09 01:26:24,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 542 flow [2025-03-09 01:26:24,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 110 transitions, 532 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:24,716 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 254 flow [2025-03-09 01:26:24,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=254, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-03-09 01:26:24,716 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-03-09 01:26:24,716 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 254 flow [2025-03-09 01:26:24,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 20.066666666666666) internal successors, (301), 15 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:24,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:24,717 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:24,722 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-09 01:26:24,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:24,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:24,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:24,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1497014327, now seen corresponding path program 2 times [2025-03-09 01:26:24,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:24,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980894478] [2025-03-09 01:26:24,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:24,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:24,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:26:24,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:26:24,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:24,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:25,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:25,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980894478] [2025-03-09 01:26:25,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980894478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:25,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023454133] [2025-03-09 01:26:25,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:25,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:25,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:25,083 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-09 01:26:25,085 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-09 01:26:25,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:26:25,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:26:25,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:25,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:25,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:26:25,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:25,144 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-09 01:26:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:25,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023454133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:25,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:25,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-09 01:26:25,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881810570] [2025-03-09 01:26:25,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:25,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:26:25,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:25,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:26:25,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:26:25,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2025-03-09 01:26:25,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 254 flow. Second operand has 19 states, 19 states have (on average 15.0) internal successors, (285), 19 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:25,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:25,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2025-03-09 01:26:25,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:26,000 INFO L124 PetriNetUnfolderBase]: 737/1413 cut-off events. [2025-03-09 01:26:26,000 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2025-03-09 01:26:26,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1413 events. 737/1413 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7888 event pairs, 246 based on Foata normal form. 68/1381 useless extension candidates. Maximal degree in co-relation 2178. Up to 290 conditions per place. [2025-03-09 01:26:26,005 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 89 selfloop transitions, 16 changer transitions 0/110 dead transitions. [2025-03-09 01:26:26,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 110 transitions, 605 flow [2025-03-09 01:26:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:26:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:26:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2025-03-09 01:26:26,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4490566037735849 [2025-03-09 01:26:26,006 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 254 flow. Second operand 10 states and 238 transitions. [2025-03-09 01:26:26,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 110 transitions, 605 flow [2025-03-09 01:26:26,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 599 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:26,008 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 295 flow [2025-03-09 01:26:26,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=295, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2025-03-09 01:26:26,008 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2025-03-09 01:26:26,008 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 295 flow [2025-03-09 01:26:26,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.0) internal successors, (285), 19 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:26,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:26,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:26,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:26,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:26,214 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:26,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:26,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2000305800, now seen corresponding path program 1 times [2025-03-09 01:26:26,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:26,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398947389] [2025-03-09 01:26:26,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:26,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:26,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:26:26,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:26:26,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:26,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:26,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:26,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398947389] [2025-03-09 01:26:26,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398947389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:26,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:26,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:26:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428461186] [2025-03-09 01:26:26,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:26,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:26,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:26,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:26,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:26,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2025-03-09 01:26:26,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:26,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:26,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2025-03-09 01:26:26,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:26,360 INFO L124 PetriNetUnfolderBase]: 645/1261 cut-off events. [2025-03-09 01:26:26,361 INFO L125 PetriNetUnfolderBase]: For 785/785 co-relation queries the response was YES. [2025-03-09 01:26:26,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 1261 events. 645/1261 cut-off events. For 785/785 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6963 event pairs, 186 based on Foata normal form. 40/1193 useless extension candidates. Maximal degree in co-relation 2061. Up to 712 conditions per place. [2025-03-09 01:26:26,366 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 52 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-03-09 01:26:26,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 433 flow [2025-03-09 01:26:26,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-09 01:26:26,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5377358490566038 [2025-03-09 01:26:26,367 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 295 flow. Second operand 4 states and 114 transitions. [2025-03-09 01:26:26,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 433 flow [2025-03-09 01:26:26,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 408 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:26,369 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 271 flow [2025-03-09 01:26:26,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2025-03-09 01:26:26,370 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2025-03-09 01:26:26,370 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 271 flow [2025-03-09 01:26:26,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:26,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:26,370 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:26,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:26:26,370 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:26,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash -20758017, now seen corresponding path program 3 times [2025-03-09 01:26:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858212210] [2025-03-09 01:26:26,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:26:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:26,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-03-09 01:26:26,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 20 statements. [2025-03-09 01:26:26,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:26:26,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:26:26,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:26,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858212210] [2025-03-09 01:26:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858212210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:26,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524774037] [2025-03-09 01:26:26,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:26:26,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:26,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:26,516 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-09 01:26:26,518 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-09 01:26:26,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-03-09 01:26:26,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 20 statements. [2025-03-09 01:26:26,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:26:26,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:26,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:26:26,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:26:26,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:26,758 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 13 treesize of output 11 [2025-03-09 01:26:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:26:26,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524774037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:26,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:26,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-09 01:26:26,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349567803] [2025-03-09 01:26:26,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:26,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:26:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:26,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:26:26,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:26:26,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2025-03-09 01:26:26,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 271 flow. Second operand has 15 states, 15 states have (on average 17.333333333333332) internal successors, (260), 15 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:26,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:26,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2025-03-09 01:26:26,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:27,212 INFO L124 PetriNetUnfolderBase]: 749/1365 cut-off events. [2025-03-09 01:26:27,212 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-03-09 01:26:27,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3454 conditions, 1365 events. 749/1365 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7096 event pairs, 60 based on Foata normal form. 20/1292 useless extension candidates. Maximal degree in co-relation 2255. Up to 450 conditions per place. [2025-03-09 01:26:27,217 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 59 selfloop transitions, 17 changer transitions 0/80 dead transitions. [2025-03-09 01:26:27,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 80 transitions, 492 flow [2025-03-09 01:26:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:26:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:26:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2025-03-09 01:26:27,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42452830188679247 [2025-03-09 01:26:27,219 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 271 flow. Second operand 8 states and 180 transitions. [2025-03-09 01:26:27,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 80 transitions, 492 flow [2025-03-09 01:26:27,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 80 transitions, 476 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:26:27,221 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 303 flow [2025-03-09 01:26:27,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=303, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2025-03-09 01:26:27,221 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2025-03-09 01:26:27,221 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 303 flow [2025-03-09 01:26:27,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.333333333333332) internal successors, (260), 15 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:27,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:27,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:27,228 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-09 01:26:27,426 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,SelfDestructingSolverStorable15 [2025-03-09 01:26:27,426 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:27,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash 828283760, now seen corresponding path program 1 times [2025-03-09 01:26:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:27,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289024804] [2025-03-09 01:26:27,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:27,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:27,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:26:27,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:26:27,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:27,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:27,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:27,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289024804] [2025-03-09 01:26:27,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289024804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:27,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:27,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098323809] [2025-03-09 01:26:27,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:27,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:27,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:27,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:27,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-03-09 01:26:27,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:27,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:27,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-03-09 01:26:27,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:27,568 INFO L124 PetriNetUnfolderBase]: 748/1461 cut-off events. [2025-03-09 01:26:27,568 INFO L125 PetriNetUnfolderBase]: For 1487/1487 co-relation queries the response was YES. [2025-03-09 01:26:27,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 1461 events. 748/1461 cut-off events. For 1487/1487 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8535 event pairs, 367 based on Foata normal form. 6/1335 useless extension candidates. Maximal degree in co-relation 2677. Up to 810 conditions per place. [2025-03-09 01:26:27,573 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 53 selfloop transitions, 2 changer transitions 4/68 dead transitions. [2025-03-09 01:26:27,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 493 flow [2025-03-09 01:26:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-09 01:26:27,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2025-03-09 01:26:27,574 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 303 flow. Second operand 3 states and 96 transitions. [2025-03-09 01:26:27,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 493 flow [2025-03-09 01:26:27,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 68 transitions, 463 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:27,577 INFO L231 Difference]: Finished difference. Result has 74 places, 51 transitions, 270 flow [2025-03-09 01:26:27,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=74, PETRI_TRANSITIONS=51} [2025-03-09 01:26:27,577 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2025-03-09 01:26:27,577 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 51 transitions, 270 flow [2025-03-09 01:26:27,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:27,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:27,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:27,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:26:27,578 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:27,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:27,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1414428960, now seen corresponding path program 1 times [2025-03-09 01:26:27,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:27,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655430174] [2025-03-09 01:26:27,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:27,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:27,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:26:27,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:26:27,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:27,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:26:27,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:27,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655430174] [2025-03-09 01:26:27,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655430174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:27,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:27,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:27,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663867206] [2025-03-09 01:26:27,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:27,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:27,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:27,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:27,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:27,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-03-09 01:26:27,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 51 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:27,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:27,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-03-09 01:26:27,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:27,726 INFO L124 PetriNetUnfolderBase]: 637/1242 cut-off events. [2025-03-09 01:26:27,726 INFO L125 PetriNetUnfolderBase]: For 1152/1158 co-relation queries the response was YES. [2025-03-09 01:26:27,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 1242 events. 637/1242 cut-off events. For 1152/1158 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6662 event pairs, 271 based on Foata normal form. 28/1187 useless extension candidates. Maximal degree in co-relation 3191. Up to 812 conditions per place. [2025-03-09 01:26:27,731 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 50 selfloop transitions, 2 changer transitions 6/67 dead transitions. [2025-03-09 01:26:27,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 455 flow [2025-03-09 01:26:27,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-09 01:26:27,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2025-03-09 01:26:27,732 INFO L175 Difference]: Start difference. First operand has 74 places, 51 transitions, 270 flow. Second operand 3 states and 96 transitions. [2025-03-09 01:26:27,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 455 flow [2025-03-09 01:26:27,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 451 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:27,735 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 280 flow [2025-03-09 01:26:27,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2025-03-09 01:26:27,735 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2025-03-09 01:26:27,735 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 280 flow [2025-03-09 01:26:27,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:27,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:27,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:27,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:26:27,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:27,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1605528499, now seen corresponding path program 1 times [2025-03-09 01:26:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826469976] [2025-03-09 01:26:27,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:27,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:26:27,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:26:27,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:27,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:28,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:28,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826469976] [2025-03-09 01:26:28,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826469976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:28,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897981864] [2025-03-09 01:26:28,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:28,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:28,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:28,253 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-09 01:26:28,254 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-09 01:26:28,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:26:28,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:26:28,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:28,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:28,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 01:26:28,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:28,330 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-09 01:26:28,363 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 23 treesize of output 1 [2025-03-09 01:26:28,392 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:26:28,392 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 11 treesize of output 11 [2025-03-09 01:26:28,428 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 8 treesize of output 1 [2025-03-09 01:26:28,801 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-09 01:26:28,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2025-03-09 01:26:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:28,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:29,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:26:29,740 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 66 [2025-03-09 01:26:29,775 INFO L349 Elim1Store]: treesize reduction 9, result has 80.9 percent of original size [2025-03-09 01:26:29,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 181 [2025-03-09 01:26:29,788 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 01:26:29,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:26:29,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 120 [2025-03-09 01:26:29,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:26:29,985 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-03-09 01:26:29,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:26:29,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 90 [2025-03-09 01:26:30,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:26:30,006 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 70 treesize of output 63 [2025-03-09 01:26:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:30,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897981864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:30,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:30,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 35 [2025-03-09 01:26:30,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985551772] [2025-03-09 01:26:30,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:30,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 01:26:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:30,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 01:26:30,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1000, Unknown=3, NotChecked=0, Total=1260 [2025-03-09 01:26:34,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:26:34,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 53 [2025-03-09 01:26:34,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 280 flow. Second operand has 36 states, 36 states have (on average 7.305555555555555) internal successors, (263), 36 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:34,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:34,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 53 [2025-03-09 01:26:34,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:38,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:26:45,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:26:48,499 INFO L124 PetriNetUnfolderBase]: 2907/5007 cut-off events. [2025-03-09 01:26:48,499 INFO L125 PetriNetUnfolderBase]: For 5018/5018 co-relation queries the response was YES. [2025-03-09 01:26:48,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13985 conditions, 5007 events. 2907/5007 cut-off events. For 5018/5018 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 28397 event pairs, 504 based on Foata normal form. 7/4445 useless extension candidates. Maximal degree in co-relation 8194. Up to 922 conditions per place. [2025-03-09 01:26:48,521 INFO L140 encePairwiseOnDemand]: 30/53 looper letters, 271 selfloop transitions, 190 changer transitions 98/562 dead transitions. [2025-03-09 01:26:48,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 562 transitions, 3586 flow [2025-03-09 01:26:48,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-09 01:26:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2025-03-09 01:26:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 836 transitions. [2025-03-09 01:26:48,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21607650555699148 [2025-03-09 01:26:48,525 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 280 flow. Second operand 73 states and 836 transitions. [2025-03-09 01:26:48,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 562 transitions, 3586 flow [2025-03-09 01:26:48,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 562 transitions, 3472 flow, removed 54 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:48,537 INFO L231 Difference]: Finished difference. Result has 188 places, 258 transitions, 2263 flow [2025-03-09 01:26:48,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=2263, PETRI_PLACES=188, PETRI_TRANSITIONS=258} [2025-03-09 01:26:48,537 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 136 predicate places. [2025-03-09 01:26:48,537 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 258 transitions, 2263 flow [2025-03-09 01:26:48,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.305555555555555) internal successors, (263), 36 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:48,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:48,537 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:48,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:48,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:48,738 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:48,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1329378642, now seen corresponding path program 2 times [2025-03-09 01:26:48,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:48,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487368365] [2025-03-09 01:26:48,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:48,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:48,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:26:48,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:26:48,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:48,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:26:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487368365] [2025-03-09 01:26:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487368365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:49,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:26:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750232889] [2025-03-09 01:26:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:49,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:26:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:49,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:26:49,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:26:49,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2025-03-09 01:26:49,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 258 transitions, 2263 flow. Second operand has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:49,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:49,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2025-03-09 01:26:49,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:49,952 INFO L124 PetriNetUnfolderBase]: 2715/4956 cut-off events. [2025-03-09 01:26:49,952 INFO L125 PetriNetUnfolderBase]: For 38097/38277 co-relation queries the response was YES. [2025-03-09 01:26:49,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26002 conditions, 4956 events. 2715/4956 cut-off events. For 38097/38277 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 29890 event pairs, 213 based on Foata normal form. 11/4758 useless extension candidates. Maximal degree in co-relation 25925. Up to 1246 conditions per place. [2025-03-09 01:26:49,988 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 392 selfloop transitions, 106 changer transitions 13/529 dead transitions. [2025-03-09 01:26:49,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 529 transitions, 5848 flow [2025-03-09 01:26:49,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:26:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:26:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 375 transitions. [2025-03-09 01:26:49,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5053908355795148 [2025-03-09 01:26:49,989 INFO L175 Difference]: Start difference. First operand has 188 places, 258 transitions, 2263 flow. Second operand 14 states and 375 transitions. [2025-03-09 01:26:49,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 529 transitions, 5848 flow [2025-03-09 01:26:50,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 529 transitions, 5369 flow, removed 199 selfloop flow, removed 10 redundant places. [2025-03-09 01:26:50,170 INFO L231 Difference]: Finished difference. Result has 190 places, 324 transitions, 2930 flow [2025-03-09 01:26:50,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2930, PETRI_PLACES=190, PETRI_TRANSITIONS=324} [2025-03-09 01:26:50,171 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 138 predicate places. [2025-03-09 01:26:50,171 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 324 transitions, 2930 flow [2025-03-09 01:26:50,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:50,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:50,171 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:50,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:26:50,171 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:50,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 226168954, now seen corresponding path program 3 times [2025-03-09 01:26:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53037045] [2025-03-09 01:26:50,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:26:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:50,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-03-09 01:26:50,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:26:50,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:26:50,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:26:50,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:50,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53037045] [2025-03-09 01:26:50,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53037045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:50,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:50,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:26:50,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888371722] [2025-03-09 01:26:50,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:50,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:50,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:50,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:50,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:50,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-03-09 01:26:50,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 324 transitions, 2930 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:50,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:50,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-03-09 01:26:50,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:51,026 INFO L124 PetriNetUnfolderBase]: 2833/5376 cut-off events. [2025-03-09 01:26:51,026 INFO L125 PetriNetUnfolderBase]: For 47188/47308 co-relation queries the response was YES. [2025-03-09 01:26:51,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30071 conditions, 5376 events. 2833/5376 cut-off events. For 47188/47308 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 33971 event pairs, 657 based on Foata normal form. 145/5247 useless extension candidates. Maximal degree in co-relation 24215. Up to 1970 conditions per place. [2025-03-09 01:26:51,072 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 354 selfloop transitions, 46 changer transitions 17/455 dead transitions. [2025-03-09 01:26:51,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 455 transitions, 4831 flow [2025-03-09 01:26:51,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-09 01:26:51,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2025-03-09 01:26:51,074 INFO L175 Difference]: Start difference. First operand has 190 places, 324 transitions, 2930 flow. Second operand 4 states and 136 transitions. [2025-03-09 01:26:51,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 455 transitions, 4831 flow [2025-03-09 01:26:51,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 455 transitions, 4696 flow, removed 38 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:51,276 INFO L231 Difference]: Finished difference. Result has 191 places, 332 transitions, 2981 flow [2025-03-09 01:26:51,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2745, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2981, PETRI_PLACES=191, PETRI_TRANSITIONS=332} [2025-03-09 01:26:51,277 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 139 predicate places. [2025-03-09 01:26:51,277 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 332 transitions, 2981 flow [2025-03-09 01:26:51,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:51,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:51,278 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:51,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:26:51,278 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:51,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1913792144, now seen corresponding path program 4 times [2025-03-09 01:26:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568086316] [2025-03-09 01:26:51,279 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:26:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:51,288 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-03-09 01:26:51,301 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:26:51,301 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:26:51,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:26:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568086316] [2025-03-09 01:26:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568086316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:51,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:51,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:26:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635975280] [2025-03-09 01:26:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:51,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:26:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:51,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:26:51,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:26:51,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-03-09 01:26:51,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 332 transitions, 2981 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 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-09 01:26:51,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:51,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-03-09 01:26:51,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:52,771 INFO L124 PetriNetUnfolderBase]: 4603/8427 cut-off events. [2025-03-09 01:26:52,771 INFO L125 PetriNetUnfolderBase]: For 69767/69975 co-relation queries the response was YES. [2025-03-09 01:26:52,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47148 conditions, 8427 events. 4603/8427 cut-off events. For 69767/69975 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 56725 event pairs, 572 based on Foata normal form. 72/8063 useless extension candidates. Maximal degree in co-relation 34283. Up to 1597 conditions per place. [2025-03-09 01:26:52,825 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 496 selfloop transitions, 188 changer transitions 4/726 dead transitions. [2025-03-09 01:26:52,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 726 transitions, 7819 flow [2025-03-09 01:26:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:26:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:26:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 246 transitions. [2025-03-09 01:26:52,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5801886792452831 [2025-03-09 01:26:52,826 INFO L175 Difference]: Start difference. First operand has 191 places, 332 transitions, 2981 flow. Second operand 8 states and 246 transitions. [2025-03-09 01:26:52,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 726 transitions, 7819 flow [2025-03-09 01:26:53,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 726 transitions, 7738 flow, removed 32 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:53,102 INFO L231 Difference]: Finished difference. Result has 197 places, 424 transitions, 4532 flow [2025-03-09 01:26:53,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2943, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4532, PETRI_PLACES=197, PETRI_TRANSITIONS=424} [2025-03-09 01:26:53,102 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 145 predicate places. [2025-03-09 01:26:53,102 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 424 transitions, 4532 flow [2025-03-09 01:26:53,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 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-09 01:26:53,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:53,102 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:53,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:26:53,102 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:53,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:53,103 INFO L85 PathProgramCache]: Analyzing trace with hash -896519320, now seen corresponding path program 5 times [2025-03-09 01:26:53,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584066710] [2025-03-09 01:26:53,103 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:26:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:53,109 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 3 equivalence classes. [2025-03-09 01:26:53,124 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:26:53,124 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:26:53,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:26:53,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:53,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584066710] [2025-03-09 01:26:53,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584066710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:53,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155709525] [2025-03-09 01:26:53,264 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:26:53,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:53,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:53,266 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-09 01:26:53,267 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-09 01:26:53,313 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 3 equivalence classes. [2025-03-09 01:26:53,341 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:26:53,342 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:26:53,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:53,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:26:53,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:26:53,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:26:53,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155709525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:53,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:53,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:26:53,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421396899] [2025-03-09 01:26:53,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:53,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:26:53,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:53,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:26:53,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:26:53,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-03-09 01:26:53,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 424 transitions, 4532 flow. Second operand has 12 states, 12 states have (on average 23.666666666666668) internal successors, (284), 12 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:53,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:53,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-03-09 01:26:53,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:54,348 INFO L124 PetriNetUnfolderBase]: 2661/4953 cut-off events. [2025-03-09 01:26:54,349 INFO L125 PetriNetUnfolderBase]: For 46964/47132 co-relation queries the response was YES. [2025-03-09 01:26:54,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30008 conditions, 4953 events. 2661/4953 cut-off events. For 46964/47132 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 30247 event pairs, 1260 based on Foata normal form. 75/4691 useless extension candidates. Maximal degree in co-relation 29578. Up to 3154 conditions per place. [2025-03-09 01:26:54,387 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 87 selfloop transitions, 11 changer transitions 120/229 dead transitions. [2025-03-09 01:26:54,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 229 transitions, 2895 flow [2025-03-09 01:26:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:26:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:26:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2025-03-09 01:26:54,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.480083857442348 [2025-03-09 01:26:54,389 INFO L175 Difference]: Start difference. First operand has 197 places, 424 transitions, 4532 flow. Second operand 9 states and 229 transitions. [2025-03-09 01:26:54,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 229 transitions, 2895 flow [2025-03-09 01:26:54,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 229 transitions, 2772 flow, removed 61 selfloop flow, removed 12 redundant places. [2025-03-09 01:26:54,560 INFO L231 Difference]: Finished difference. Result has 168 places, 109 transitions, 1132 flow [2025-03-09 01:26:54,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1132, PETRI_PLACES=168, PETRI_TRANSITIONS=109} [2025-03-09 01:26:54,560 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 116 predicate places. [2025-03-09 01:26:54,560 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 109 transitions, 1132 flow [2025-03-09 01:26:54,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.666666666666668) internal successors, (284), 12 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:54,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:54,561 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:54,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:54,761 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,SelfDestructingSolverStorable22 [2025-03-09 01:26:54,761 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:26:54,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash -41352843, now seen corresponding path program 6 times [2025-03-09 01:26:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634810061] [2025-03-09 01:26:54,762 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:26:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:54,772 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 4 equivalence classes. [2025-03-09 01:26:54,806 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 45 statements. [2025-03-09 01:26:54,806 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:26:54,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:26:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:56,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634810061] [2025-03-09 01:26:56,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634810061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:56,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968688469] [2025-03-09 01:26:56,666 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:26:56,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:56,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:56,668 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-09 01:26:56,668 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-09 01:26:56,710 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 4 equivalence classes. [2025-03-09 01:26:56,736 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 45 statements. [2025-03-09 01:26:56,737 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:26:56,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:56,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 01:26:56,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:57,589 INFO L349 Elim1Store]: treesize reduction 32, result has 50.8 percent of original size [2025-03-09 01:26:57,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 48 [2025-03-09 01:26:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:26:57,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:59,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:26:59,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 199 treesize of output 1015