./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-max-array-hom.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 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:29:48,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:29:48,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:29:48,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:29:48,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:29:48,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:29:48,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:29:48,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:29:48,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:29:48,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:29:48,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:29:48,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:29:48,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:29:48,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:29:48,214 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:29:48,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:29:48,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:29:48,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:29:48,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:29:48,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:29:48,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:29:48,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:29:48,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:29:48,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:29:48,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:29:48,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:29:48,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:29:48,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:29:48,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:29:48,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:29:48,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:29:48,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:29:48,219 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 -> 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 [2025-03-17 14:29:48,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:29:48,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:29:48,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:29:48,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:29:48,442 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:29:48,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2025-03-17 14:29:49,541 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02dcd8ff0/8361a67090944c2c832f3ad0349f086d/FLAG4c6619686 [2025-03-17 14:29:49,749 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:29:49,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2025-03-17 14:29:49,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02dcd8ff0/8361a67090944c2c832f3ad0349f086d/FLAG4c6619686 [2025-03-17 14:29:49,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02dcd8ff0/8361a67090944c2c832f3ad0349f086d [2025-03-17 14:29:49,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:29:49,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:29:49,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:29:49,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:29:49,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:29:49,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49, skipping insertion in model container [2025-03-17 14:29:49,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:29:49,896 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-17 14:29:49,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:29:49,903 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:29:49,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:29:49,927 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:29:49,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49 WrapperNode [2025-03-17 14:29:49,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:29:49,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:29:49,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:29:49,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:29:49,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,953 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-03-17 14:29:49,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:29:49,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:29:49,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:29:49,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:29:49,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,971 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 14:29:49,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:29:49,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:29:49,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:29:49,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:29:49,979 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (1/1) ... [2025-03-17 14:29:49,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:29:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:50,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:29:50,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:29:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:29:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:29:50,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:29:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:29:50,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:29:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:29:50,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:29:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:29:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:29:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:29:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:29:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:29:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:29:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:29:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:29:50,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:29:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:29:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:29:50,030 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:29:50,111 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:29:50,112 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:29:50,405 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:29:50,406 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:29:50,567 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:29:50,567 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:29:50,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:29:50 BoogieIcfgContainer [2025-03-17 14:29:50,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:29:50,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:29:50,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:29:50,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:29:50,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:29:49" (1/3) ... [2025-03-17 14:29:50,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72179c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:29:50, skipping insertion in model container [2025-03-17 14:29:50,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:49" (2/3) ... [2025-03-17 14:29:50,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72179c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:29:50, skipping insertion in model container [2025-03-17 14:29:50,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:29:50" (3/3) ... [2025-03-17 14:29:50,576 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2025-03-17 14:29:50,586 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:29:50,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-max-array-hom.wvr.c that has 4 procedures, 47 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-03-17 14:29:50,588 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:29:50,645 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 14:29:50,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 121 flow [2025-03-17 14:29:50,713 INFO L124 PetriNetUnfolderBase]: 4/47 cut-off events. [2025-03-17 14:29:50,715 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:29:50,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 4/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 104 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-03-17 14:29:50,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 121 flow [2025-03-17 14:29:50,724 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 46 transitions, 110 flow [2025-03-17 14:29:50,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:29:50,746 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;@66a3dee8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:29:50,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-17 14:29:50,749 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:29:50,751 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:29:50,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:29:50,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:50,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:29:50,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:50,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:50,759 INFO L85 PathProgramCache]: Analyzing trace with hash 402313, now seen corresponding path program 1 times [2025-03-17 14:29:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:50,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321953736] [2025-03-17 14:29:50,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:50,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:29:50,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:29:50,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:50,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:50,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:50,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321953736] [2025-03-17 14:29:50,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321953736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:29:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581900342] [2025-03-17 14:29:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:50,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:29:50,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:50,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:29:50,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:29:50,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:29:50,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:50,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:50,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:29:50,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:51,236 INFO L124 PetriNetUnfolderBase]: 1316/1966 cut-off events. [2025-03-17 14:29:51,236 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-03-17 14:29:51,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 1966 events. 1316/1966 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10102 event pairs, 1060 based on Foata normal form. 1/1449 useless extension candidates. Maximal degree in co-relation 3673. Up to 1877 conditions per place. [2025-03-17 14:29:51,246 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 30 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-17 14:29:51,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 156 flow [2025-03-17 14:29:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-03-17 14:29:51,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2025-03-17 14:29:51,260 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 110 flow. Second operand 3 states and 67 transitions. [2025-03-17 14:29:51,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 156 flow [2025-03-17 14:29:51,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 144 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:29:51,267 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 84 flow [2025-03-17 14:29:51,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-17 14:29:51,272 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2025-03-17 14:29:51,273 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 84 flow [2025-03-17 14:29:51,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:51,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:51,273 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:29:51,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:29:51,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:51,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash 402314, now seen corresponding path program 1 times [2025-03-17 14:29:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:51,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972155052] [2025-03-17 14:29:51,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:51,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:51,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:29:51,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:29:51,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:51,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:51,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:51,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972155052] [2025-03-17 14:29:51,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972155052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:51,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:51,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:51,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977517777] [2025-03-17 14:29:51,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:51,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:51,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:51,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:51,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:51,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:29:51,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:51,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:51,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:29:51,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:51,701 INFO L124 PetriNetUnfolderBase]: 1317/1969 cut-off events. [2025-03-17 14:29:51,702 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 14:29:51,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3901 conditions, 1969 events. 1317/1969 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10145 event pairs, 1060 based on Foata normal form. 0/1451 useless extension candidates. Maximal degree in co-relation 3879. Up to 1882 conditions per place. [2025-03-17 14:29:51,714 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 32 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-03-17 14:29:51,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 164 flow [2025-03-17 14:29:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-03-17 14:29:51,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.365 [2025-03-17 14:29:51,716 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 84 flow. Second operand 4 states and 73 transitions. [2025-03-17 14:29:51,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 164 flow [2025-03-17 14:29:51,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:51,718 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 107 flow [2025-03-17 14:29:51,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2025-03-17 14:29:51,718 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2025-03-17 14:29:51,718 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 107 flow [2025-03-17 14:29:51,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:51,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:51,720 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:29:51,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:29:51,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:51,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash 386635902, now seen corresponding path program 1 times [2025-03-17 14:29:51,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:51,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442773934] [2025-03-17 14:29:51,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:51,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:29:51,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:29:51,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:51,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:52,013 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-17 14:29:52,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442773934] [2025-03-17 14:29:52,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442773934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102390387] [2025-03-17 14:29:52,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:52,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:52,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:52,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:52,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:29:52,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:29:52,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:29:52,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:52,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:52,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:29:52,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:52,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:29:52,249 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-17 14:29:52,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:52,354 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-17 14:29:52,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102390387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:52,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:52,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:29:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349692059] [2025-03-17 14:29:52,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:52,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:29:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:52,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:29:52,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:29:52,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:29:52,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 107 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:52,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:52,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:29:52,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:52,714 INFO L124 PetriNetUnfolderBase]: 1317/1968 cut-off events. [2025-03-17 14:29:52,714 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 14:29:52,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3908 conditions, 1968 events. 1317/1968 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10157 event pairs, 1060 based on Foata normal form. 0/1450 useless extension candidates. Maximal degree in co-relation 3886. Up to 1878 conditions per place. [2025-03-17 14:29:52,724 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 28 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2025-03-17 14:29:52,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 173 flow [2025-03-17 14:29:52,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:29:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:29:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-03-17 14:29:52,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3 [2025-03-17 14:29:52,726 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 107 flow. Second operand 6 states and 90 transitions. [2025-03-17 14:29:52,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 173 flow [2025-03-17 14:29:52,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:52,727 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 114 flow [2025-03-17 14:29:52,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-03-17 14:29:52,728 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2025-03-17 14:29:52,728 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 114 flow [2025-03-17 14:29:52,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:52,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:52,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:29:52,735 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-17 14:29:52,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:52,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:52,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash -896461271, now seen corresponding path program 1 times [2025-03-17 14:29:52,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:52,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879521743] [2025-03-17 14:29:52,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:52,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:29:52,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:29:52,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:52,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:52,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:52,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879521743] [2025-03-17 14:29:52,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879521743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:52,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:52,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:52,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759027231] [2025-03-17 14:29:52,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:52,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:52,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:52,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:52,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:52,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:29:52,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:52,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:52,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:29:52,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:53,120 INFO L124 PetriNetUnfolderBase]: 793/1202 cut-off events. [2025-03-17 14:29:53,120 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 14:29:53,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 1202 events. 793/1202 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5518 event pairs, 608 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 2367. Up to 1135 conditions per place. [2025-03-17 14:29:53,124 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 29 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-03-17 14:29:53,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 172 flow [2025-03-17 14:29:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-03-17 14:29:53,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-03-17 14:29:53,125 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 114 flow. Second operand 4 states and 68 transitions. [2025-03-17 14:29:53,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 172 flow [2025-03-17 14:29:53,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 142 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-17 14:29:53,126 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 84 flow [2025-03-17 14:29:53,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-03-17 14:29:53,127 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -14 predicate places. [2025-03-17 14:29:53,127 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 84 flow [2025-03-17 14:29:53,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:53,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:53,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:29:53,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:29:53,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:53,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:53,128 INFO L85 PathProgramCache]: Analyzing trace with hash -896461270, now seen corresponding path program 1 times [2025-03-17 14:29:53,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:53,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929097988] [2025-03-17 14:29:53,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:53,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:53,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:29:53,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:29:53,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:53,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:53,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929097988] [2025-03-17 14:29:53,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929097988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:53,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:53,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:53,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397572251] [2025-03-17 14:29:53,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:53,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:29:53,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:53,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:29:53,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:29:53,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-17 14:29:53,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:53,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:53,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-17 14:29:53,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:53,276 INFO L124 PetriNetUnfolderBase]: 792/1201 cut-off events. [2025-03-17 14:29:53,276 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 14:29:53,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2376 conditions, 1201 events. 792/1201 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5514 event pairs, 608 based on Foata normal form. 1/1013 useless extension candidates. Maximal degree in co-relation 2359. Up to 1138 conditions per place. [2025-03-17 14:29:53,281 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 29 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-03-17 14:29:53,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 142 flow [2025-03-17 14:29:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-17 14:29:53,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2025-03-17 14:29:53,282 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 84 flow. Second operand 3 states and 62 transitions. [2025-03-17 14:29:53,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 142 flow [2025-03-17 14:29:53,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:53,284 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 81 flow [2025-03-17 14:29:53,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-03-17 14:29:53,285 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -14 predicate places. [2025-03-17 14:29:53,286 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 81 flow [2025-03-17 14:29:53,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:53,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:53,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:29:53,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:53,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash -829027146, now seen corresponding path program 1 times [2025-03-17 14:29:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:53,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037470415] [2025-03-17 14:29:53,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:53,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:53,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:29:53,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:29:53,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:53,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:53,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:53,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037470415] [2025-03-17 14:29:53,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037470415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:53,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815740592] [2025-03-17 14:29:53,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:53,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:53,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:53,445 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:53,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:29:53,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:29:53,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:29:53,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:53,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:53,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:29:53,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:53,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:29:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:53,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:53,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815740592] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:53,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:29:53,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 10 [2025-03-17 14:29:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564559248] [2025-03-17 14:29:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:53,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:53,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:53,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:29:53,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-17 14:29:53,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 81 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:53,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:53,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-17 14:29:53,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:53,790 INFO L124 PetriNetUnfolderBase]: 1001/1522 cut-off events. [2025-03-17 14:29:53,790 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 14:29:53,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2975 conditions, 1522 events. 1001/1522 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7302 event pairs, 483 based on Foata normal form. 0/1311 useless extension candidates. Maximal degree in co-relation 2964. Up to 925 conditions per place. [2025-03-17 14:29:53,796 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 41 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2025-03-17 14:29:53,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 213 flow [2025-03-17 14:29:53,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:29:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:29:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-03-17 14:29:53,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-03-17 14:29:53,798 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 81 flow. Second operand 6 states and 109 transitions. [2025-03-17 14:29:53,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 213 flow [2025-03-17 14:29:53,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:53,799 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 110 flow [2025-03-17 14:29:53,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-03-17 14:29:53,799 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2025-03-17 14:29:53,800 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 110 flow [2025-03-17 14:29:53,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:53,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:53,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:53,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:29:54,000 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,SelfDestructingSolverStorable5 [2025-03-17 14:29:54,001 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:54,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2134617691, now seen corresponding path program 1 times [2025-03-17 14:29:54,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:54,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105394576] [2025-03-17 14:29:54,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:54,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:54,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:54,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:54,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105394576] [2025-03-17 14:29:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105394576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142946974] [2025-03-17 14:29:54,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:54,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:54,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:54,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:54,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:29:54,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:54,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:54,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:54,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:54,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:29:54,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:54,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:54,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142946974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:54,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:54,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 14:29:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478821562] [2025-03-17 14:29:54,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:54,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:29:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:54,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:29:54,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:29:54,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:29:54,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 110 flow. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:54,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:54,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:29:54,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:54,528 INFO L124 PetriNetUnfolderBase]: 1728/2555 cut-off events. [2025-03-17 14:29:54,529 INFO L125 PetriNetUnfolderBase]: For 1692/1692 co-relation queries the response was YES. [2025-03-17 14:29:54,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6333 conditions, 2555 events. 1728/2555 cut-off events. For 1692/1692 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 12220 event pairs, 1148 based on Foata normal form. 0/2281 useless extension candidates. Maximal degree in co-relation 4267. Up to 1681 conditions per place. [2025-03-17 14:29:54,538 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 69 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2025-03-17 14:29:54,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 406 flow [2025-03-17 14:29:54,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:29:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:29:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-03-17 14:29:54,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2025-03-17 14:29:54,541 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 110 flow. Second operand 7 states and 135 transitions. [2025-03-17 14:29:54,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 406 flow [2025-03-17 14:29:54,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 80 transitions, 400 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:29:54,543 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 156 flow [2025-03-17 14:29:54,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2025-03-17 14:29:54,544 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-03-17 14:29:54,544 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 156 flow [2025-03-17 14:29:54,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:54,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:54,544 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:54,551 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-17 14:29:54,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:54,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:54,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1485264162, now seen corresponding path program 1 times [2025-03-17 14:29:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:54,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984807433] [2025-03-17 14:29:54,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:54,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:29:54,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:29:54,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:54,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:54,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:54,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984807433] [2025-03-17 14:29:54,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984807433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:54,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669009417] [2025-03-17 14:29:54,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:54,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:54,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:54,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:54,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:29:54,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:29:54,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:29:54,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:54,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:54,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:29:54,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:54,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:55,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669009417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:55,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:55,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 14:29:55,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701317210] [2025-03-17 14:29:55,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:55,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:29:55,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:55,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:29:55,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:29:55,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:29:55,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 156 flow. Second operand has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:55,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:55,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:29:55,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:55,279 INFO L124 PetriNetUnfolderBase]: 1788/2668 cut-off events. [2025-03-17 14:29:55,279 INFO L125 PetriNetUnfolderBase]: For 1660/1744 co-relation queries the response was YES. [2025-03-17 14:29:55,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6846 conditions, 2668 events. 1788/2668 cut-off events. For 1660/1744 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12920 event pairs, 1114 based on Foata normal form. 38/2472 useless extension candidates. Maximal degree in co-relation 4673. Up to 1826 conditions per place. [2025-03-17 14:29:55,291 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 74 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2025-03-17 14:29:55,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 456 flow [2025-03-17 14:29:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:29:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:29:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2025-03-17 14:29:55,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-03-17 14:29:55,292 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 156 flow. Second operand 8 states and 155 transitions. [2025-03-17 14:29:55,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 456 flow [2025-03-17 14:29:55,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:55,295 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 215 flow [2025-03-17 14:29:55,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=215, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2025-03-17 14:29:55,295 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2025-03-17 14:29:55,295 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 215 flow [2025-03-17 14:29:55,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:55,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:55,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:55,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:29:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:55,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:55,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:55,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1658535346, now seen corresponding path program 1 times [2025-03-17 14:29:55,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:55,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001692483] [2025-03-17 14:29:55,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:55,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:29:55,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:29:55,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:55,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:55,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001692483] [2025-03-17 14:29:55,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001692483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:55,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:55,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:29:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543686640] [2025-03-17 14:29:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:55,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:55,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:55,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:55,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:55,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-17 14:29:55,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-17 14:29:55,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:55,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-17 14:29:55,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:55,889 INFO L124 PetriNetUnfolderBase]: 1759/2720 cut-off events. [2025-03-17 14:29:55,890 INFO L125 PetriNetUnfolderBase]: For 3888/3950 co-relation queries the response was YES. [2025-03-17 14:29:55,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7659 conditions, 2720 events. 1759/2720 cut-off events. For 3888/3950 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13650 event pairs, 874 based on Foata normal form. 0/2521 useless extension candidates. Maximal degree in co-relation 4983. Up to 1692 conditions per place. [2025-03-17 14:29:55,909 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 58 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-03-17 14:29:55,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 465 flow [2025-03-17 14:29:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-17 14:29:55,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-03-17 14:29:55,910 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 215 flow. Second operand 5 states and 95 transitions. [2025-03-17 14:29:55,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 465 flow [2025-03-17 14:29:55,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 450 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-17 14:29:55,916 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 236 flow [2025-03-17 14:29:55,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2025-03-17 14:29:55,917 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-03-17 14:29:55,918 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 236 flow [2025-03-17 14:29:55,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-17 14:29:55,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:55,918 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:55,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:29:55,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:55,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1938456295, now seen corresponding path program 2 times [2025-03-17 14:29:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:55,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198406438] [2025-03-17 14:29:55,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:29:55,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:55,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 14:29:55,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:29:55,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:29:55,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:29:56,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198406438] [2025-03-17 14:29:56,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198406438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949343071] [2025-03-17 14:29:56,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:29:56,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:56,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:56,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:56,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:29:56,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 14:29:56,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:29:56,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:29:56,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:56,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:29:56,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:56,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:56,241 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-17 14:29:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949343071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:56,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:56,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-17 14:29:56,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766133963] [2025-03-17 14:29:56,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:56,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:29:56,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:56,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:29:56,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:29:56,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:29:56,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 236 flow. Second operand has 16 states, 16 states have (on average 11.125) internal successors, (178), 16 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:56,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:56,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:29:56,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:56,990 INFO L124 PetriNetUnfolderBase]: 2578/3691 cut-off events. [2025-03-17 14:29:56,990 INFO L125 PetriNetUnfolderBase]: For 6636/6744 co-relation queries the response was YES. [2025-03-17 14:29:56,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12033 conditions, 3691 events. 2578/3691 cut-off events. For 6636/6744 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16976 event pairs, 594 based on Foata normal form. 0/3500 useless extension candidates. Maximal degree in co-relation 9060. Up to 999 conditions per place. [2025-03-17 14:29:57,006 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 123 selfloop transitions, 13 changer transitions 0/139 dead transitions. [2025-03-17 14:29:57,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 139 transitions, 940 flow [2025-03-17 14:29:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:29:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:29:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2025-03-17 14:29:57,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2025-03-17 14:29:57,011 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 236 flow. Second operand 11 states and 215 transitions. [2025-03-17 14:29:57,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 139 transitions, 940 flow [2025-03-17 14:29:57,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 139 transitions, 936 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:57,017 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 272 flow [2025-03-17 14:29:57,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=272, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2025-03-17 14:29:57,019 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2025-03-17 14:29:57,019 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 272 flow [2025-03-17 14:29:57,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.125) internal successors, (178), 16 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:57,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:57,019 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:57,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:29:57,220 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,SelfDestructingSolverStorable9 [2025-03-17 14:29:57,220 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:57,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:57,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1023667154, now seen corresponding path program 2 times [2025-03-17 14:29:57,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:57,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292775143] [2025-03-17 14:29:57,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:29:57,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:57,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 14:29:57,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:29:57,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:29:57,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:29:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292775143] [2025-03-17 14:29:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292775143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427522067] [2025-03-17 14:29:57,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:29:57,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:57,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:57,387 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:57,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:29:57,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 14:29:57,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:29:57,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:29:57,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:57,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:29:57,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:57,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:57,614 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 24 treesize of output 20 [2025-03-17 14:29:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427522067] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:57,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:57,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-17 14:29:57,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824478232] [2025-03-17 14:29:57,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:57,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:29:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:57,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:29:57,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:29:57,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:29:57,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 272 flow. Second operand has 20 states, 20 states have (on average 10.9) internal successors, (218), 20 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:57,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:57,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:29:57,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:58,689 INFO L124 PetriNetUnfolderBase]: 3434/4813 cut-off events. [2025-03-17 14:29:58,689 INFO L125 PetriNetUnfolderBase]: For 7634/7916 co-relation queries the response was YES. [2025-03-17 14:29:58,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16719 conditions, 4813 events. 3434/4813 cut-off events. For 7634/7916 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 22602 event pairs, 481 based on Foata normal form. 172/4977 useless extension candidates. Maximal degree in co-relation 13119. Up to 954 conditions per place. [2025-03-17 14:29:58,710 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 166 selfloop transitions, 18 changer transitions 0/188 dead transitions. [2025-03-17 14:29:58,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 188 transitions, 1250 flow [2025-03-17 14:29:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:29:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:29:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 284 transitions. [2025-03-17 14:29:58,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4057142857142857 [2025-03-17 14:29:58,712 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 272 flow. Second operand 14 states and 284 transitions. [2025-03-17 14:29:58,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 188 transitions, 1250 flow [2025-03-17 14:29:58,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 188 transitions, 1191 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-03-17 14:29:58,721 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 320 flow [2025-03-17 14:29:58,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=320, PETRI_PLACES=76, PETRI_TRANSITIONS=54} [2025-03-17 14:29:58,722 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2025-03-17 14:29:58,722 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 54 transitions, 320 flow [2025-03-17 14:29:58,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.9) internal successors, (218), 20 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:58,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:58,722 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:58,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:29:58,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:58,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:58,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:58,923 INFO L85 PathProgramCache]: Analyzing trace with hash -122211304, now seen corresponding path program 1 times [2025-03-17 14:29:58,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797362476] [2025-03-17 14:29:58,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:58,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:29:58,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:29:58,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:58,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:59,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:59,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797362476] [2025-03-17 14:29:59,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797362476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:59,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661786286] [2025-03-17 14:29:59,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:59,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:59,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:59,010 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:59,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:29:59,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:29:59,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:29:59,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:59,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:59,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:29:59,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:59,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:59,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661786286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:59,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:59,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 14:29:59,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549252414] [2025-03-17 14:29:59,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:59,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:29:59,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:59,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:29:59,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:29:59,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:29:59,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 54 transitions, 320 flow. Second operand has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:59,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:59,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:29:59,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:59,554 INFO L124 PetriNetUnfolderBase]: 3196/4549 cut-off events. [2025-03-17 14:29:59,554 INFO L125 PetriNetUnfolderBase]: For 12524/12784 co-relation queries the response was YES. [2025-03-17 14:29:59,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16558 conditions, 4549 events. 3196/4549 cut-off events. For 12524/12784 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 20762 event pairs, 2017 based on Foata normal form. 34/4553 useless extension candidates. Maximal degree in co-relation 13638. Up to 3650 conditions per place. [2025-03-17 14:29:59,578 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 75 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2025-03-17 14:29:59,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 91 transitions, 684 flow [2025-03-17 14:29:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:29:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:29:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2025-03-17 14:29:59,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.365 [2025-03-17 14:29:59,579 INFO L175 Difference]: Start difference. First operand has 76 places, 54 transitions, 320 flow. Second operand 8 states and 146 transitions. [2025-03-17 14:29:59,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 91 transitions, 684 flow [2025-03-17 14:29:59,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 91 transitions, 599 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-03-17 14:29:59,589 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 330 flow [2025-03-17 14:29:59,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=330, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2025-03-17 14:29:59,589 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2025-03-17 14:29:59,589 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 330 flow [2025-03-17 14:29:59,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:59,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:59,590 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:59,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:29:59,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:59,791 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:29:59,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:59,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1678826252, now seen corresponding path program 2 times [2025-03-17 14:29:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:59,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271541716] [2025-03-17 14:29:59,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:29:59,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:59,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 14:29:59,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:29:59,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:29:59,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:29:59,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:59,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271541716] [2025-03-17 14:29:59,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271541716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:59,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269420315] [2025-03-17 14:29:59,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:29:59,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:59,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:59,924 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:59,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:29:59,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 14:29:59,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:29:59,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:29:59,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:59,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:29:59,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:30:00,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:00,280 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 35 treesize of output 31 [2025-03-17 14:30:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:30:00,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269420315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:00,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:00,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-17 14:30:00,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878535814] [2025-03-17 14:30:00,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:00,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 14:30:00,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:00,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 14:30:00,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:30:00,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:30:00,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 330 flow. Second operand has 19 states, 19 states have (on average 11.368421052631579) internal successors, (216), 19 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:00,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:00,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:30:00,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:00,876 INFO L124 PetriNetUnfolderBase]: 3196/4505 cut-off events. [2025-03-17 14:30:00,876 INFO L125 PetriNetUnfolderBase]: For 7983/8211 co-relation queries the response was YES. [2025-03-17 14:30:00,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16038 conditions, 4505 events. 3196/4505 cut-off events. For 7983/8211 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 20459 event pairs, 673 based on Foata normal form. 103/4606 useless extension candidates. Maximal degree in co-relation 13162. Up to 1506 conditions per place. [2025-03-17 14:30:00,896 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 106 selfloop transitions, 13 changer transitions 0/125 dead transitions. [2025-03-17 14:30:00,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 125 transitions, 936 flow [2025-03-17 14:30:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:30:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:30:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-03-17 14:30:00,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3657142857142857 [2025-03-17 14:30:00,897 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 330 flow. Second operand 7 states and 128 transitions. [2025-03-17 14:30:00,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 125 transitions, 936 flow [2025-03-17 14:30:00,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 125 transitions, 923 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 14:30:00,906 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 359 flow [2025-03-17 14:30:00,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=359, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2025-03-17 14:30:00,907 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2025-03-17 14:30:00,907 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 359 flow [2025-03-17 14:30:00,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.368421052631579) internal successors, (216), 19 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:00,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:00,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:00,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:30:01,108 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,SelfDestructingSolverStorable12 [2025-03-17 14:30:01,108 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:30:01,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1197421776, now seen corresponding path program 1 times [2025-03-17 14:30:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:01,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128437181] [2025-03-17 14:30:01,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:01,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:30:01,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:30:01,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:01,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:01,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:01,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128437181] [2025-03-17 14:30:01,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128437181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:01,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:01,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:30:01,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972576939] [2025-03-17 14:30:01,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:01,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:30:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:01,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:30:01,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:30:01,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-17 14:30:01,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:01,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:01,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-17 14:30:01,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:01,375 INFO L124 PetriNetUnfolderBase]: 2704/4080 cut-off events. [2025-03-17 14:30:01,375 INFO L125 PetriNetUnfolderBase]: For 10510/10691 co-relation queries the response was YES. [2025-03-17 14:30:01,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15584 conditions, 4080 events. 2704/4080 cut-off events. For 10510/10691 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19841 event pairs, 632 based on Foata normal form. 2/4068 useless extension candidates. Maximal degree in co-relation 12440. Up to 3332 conditions per place. [2025-03-17 14:30:01,392 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 69 selfloop transitions, 4 changer transitions 1/82 dead transitions. [2025-03-17 14:30:01,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 82 transitions, 632 flow [2025-03-17 14:30:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:30:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:30:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-17 14:30:01,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2025-03-17 14:30:01,393 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 359 flow. Second operand 3 states and 74 transitions. [2025-03-17 14:30:01,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 82 transitions, 632 flow [2025-03-17 14:30:01,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 598 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-17 14:30:01,403 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 363 flow [2025-03-17 14:30:01,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2025-03-17 14:30:01,404 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2025-03-17 14:30:01,404 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 363 flow [2025-03-17 14:30:01,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:01,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:01,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:01,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:30:01,404 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:30:01,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:01,405 INFO L85 PathProgramCache]: Analyzing trace with hash 699264302, now seen corresponding path program 1 times [2025-03-17 14:30:01,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:01,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052139373] [2025-03-17 14:30:01,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:01,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:01,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:30:01,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:30:01,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:01,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:30:01,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:01,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052139373] [2025-03-17 14:30:01,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052139373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:01,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:01,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:30:01,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323151496] [2025-03-17 14:30:01,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:01,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:30:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:01,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:30:01,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:30:01,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:30:01,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 363 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:01,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:01,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:30:01,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:01,745 INFO L124 PetriNetUnfolderBase]: 3186/4594 cut-off events. [2025-03-17 14:30:01,745 INFO L125 PetriNetUnfolderBase]: For 9797/10036 co-relation queries the response was YES. [2025-03-17 14:30:01,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17033 conditions, 4594 events. 3186/4594 cut-off events. For 9797/10036 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 21768 event pairs, 945 based on Foata normal form. 161/4650 useless extension candidates. Maximal degree in co-relation 13933. Up to 2446 conditions per place. [2025-03-17 14:30:01,763 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 72 selfloop transitions, 8 changer transitions 0/86 dead transitions. [2025-03-17 14:30:01,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 86 transitions, 654 flow [2025-03-17 14:30:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:30:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:30:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-17 14:30:01,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-03-17 14:30:01,764 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 363 flow. Second operand 4 states and 76 transitions. [2025-03-17 14:30:01,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 86 transitions, 654 flow [2025-03-17 14:30:01,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 86 transitions, 640 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:01,774 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 349 flow [2025-03-17 14:30:01,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2025-03-17 14:30:01,775 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2025-03-17 14:30:01,775 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 349 flow [2025-03-17 14:30:01,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:01,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:01,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:01,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:30:01,775 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:30:01,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2067569100, now seen corresponding path program 1 times [2025-03-17 14:30:01,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:01,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891679517] [2025-03-17 14:30:01,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:01,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:01,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:30:01,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:30:01,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:01,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:01,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:01,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891679517] [2025-03-17 14:30:01,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891679517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:01,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773720719] [2025-03-17 14:30:01,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:01,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:01,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:01,839 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:01,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:30:01,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:30:01,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:30:01,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:01,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:01,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:30:01,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:01,915 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-17 14:30:01,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:01,938 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-17 14:30:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773720719] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:01,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:30:01,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-03-17 14:30:01,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011350651] [2025-03-17 14:30:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:01,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:30:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:01,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:30:01,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:30:01,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:30:01,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:01,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:01,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:30:01,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:02,201 INFO L124 PetriNetUnfolderBase]: 3031/4479 cut-off events. [2025-03-17 14:30:02,201 INFO L125 PetriNetUnfolderBase]: For 11278/11463 co-relation queries the response was YES. [2025-03-17 14:30:02,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16802 conditions, 4479 events. 3031/4479 cut-off events. For 11278/11463 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21717 event pairs, 1013 based on Foata normal form. 130/4517 useless extension candidates. Maximal degree in co-relation 14112. Up to 2503 conditions per place. [2025-03-17 14:30:02,217 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 68 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2025-03-17 14:30:02,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 636 flow [2025-03-17 14:30:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:30:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:30:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-03-17 14:30:02,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.352 [2025-03-17 14:30:02,218 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 349 flow. Second operand 5 states and 88 transitions. [2025-03-17 14:30:02,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 636 flow [2025-03-17 14:30:02,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 610 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:30:02,227 INFO L231 Difference]: Finished difference. Result has 80 places, 59 transitions, 357 flow [2025-03-17 14:30:02,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=80, PETRI_TRANSITIONS=59} [2025-03-17 14:30:02,227 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2025-03-17 14:30:02,227 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 59 transitions, 357 flow [2025-03-17 14:30:02,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:02,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:02,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:02,234 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-17 14:30:02,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 14:30:02,428 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:30:02,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash -42569234, now seen corresponding path program 1 times [2025-03-17 14:30:02,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:02,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568305986] [2025-03-17 14:30:02,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:02,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:02,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:30:02,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:30:02,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:02,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:02,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:02,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568305986] [2025-03-17 14:30:02,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568305986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:02,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:30:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170880157] [2025-03-17 14:30:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:02,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:30:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:02,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:30:02,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:30:02,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:30:02,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 59 transitions, 357 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:02,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:02,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:30:02,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:03,460 INFO L124 PetriNetUnfolderBase]: 3286/4806 cut-off events. [2025-03-17 14:30:03,461 INFO L125 PetriNetUnfolderBase]: For 13778/14050 co-relation queries the response was YES. [2025-03-17 14:30:03,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18214 conditions, 4806 events. 3286/4806 cut-off events. For 13778/14050 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 23404 event pairs, 951 based on Foata normal form. 2/4671 useless extension candidates. Maximal degree in co-relation 14754. Up to 3971 conditions per place. [2025-03-17 14:30:03,482 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 102 selfloop transitions, 32 changer transitions 15/156 dead transitions. [2025-03-17 14:30:03,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 156 transitions, 1187 flow [2025-03-17 14:30:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:30:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:30:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-03-17 14:30:03,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36 [2025-03-17 14:30:03,483 INFO L175 Difference]: Start difference. First operand has 80 places, 59 transitions, 357 flow. Second operand 11 states and 198 transitions. [2025-03-17 14:30:03,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 156 transitions, 1187 flow [2025-03-17 14:30:03,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 156 transitions, 1162 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-17 14:30:03,498 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 618 flow [2025-03-17 14:30:03,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=618, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2025-03-17 14:30:03,499 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2025-03-17 14:30:03,499 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 618 flow [2025-03-17 14:30:03,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:03,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:03,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:03,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:30:03,499 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:30:03,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:03,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1336174026, now seen corresponding path program 2 times [2025-03-17 14:30:03,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:03,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244784096] [2025-03-17 14:30:03,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:03,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:03,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 14:30:03,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:30:03,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:03,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:03,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:03,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244784096] [2025-03-17 14:30:03,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244784096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:03,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574455343] [2025-03-17 14:30:03,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:03,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:03,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:03,845 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:03,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:30:03,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 14:30:03,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:30:03,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:03,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:03,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 14:30:03,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:03,950 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 15 treesize of output 1 [2025-03-17 14:30:04,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2025-03-17 14:30:04,208 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 51 treesize of output 47 [2025-03-17 14:30:04,210 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 47 treesize of output 43 [2025-03-17 14:30:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:04,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:04,546 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 177 treesize of output 173 [2025-03-17 14:30:04,549 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 173 treesize of output 169 [2025-03-17 14:30:05,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 187 [2025-03-17 14:30:05,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:30:05,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 239 [2025-03-17 14:30:14,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2025-03-17 14:30:14,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:30:14,219 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 128 treesize of output 122 [2025-03-17 14:30:14,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 205 [2025-03-17 14:30:14,690 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-03-17 14:30:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 1 [2025-03-17 14:30:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:14,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574455343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:14,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:14,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-17 14:30:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496539883] [2025-03-17 14:30:14,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:14,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 14:30:14,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:14,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 14:30:14,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:30:14,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:30:14,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 618 flow. Second operand has 25 states, 25 states have (on average 11.88) internal successors, (297), 25 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:14,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:14,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:30:14,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:16,578 INFO L124 PetriNetUnfolderBase]: 3344/5115 cut-off events. [2025-03-17 14:30:16,578 INFO L125 PetriNetUnfolderBase]: For 17380/17526 co-relation queries the response was YES. [2025-03-17 14:30:16,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21186 conditions, 5115 events. 3344/5115 cut-off events. For 17380/17526 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 27123 event pairs, 1163 based on Foata normal form. 2/4986 useless extension candidates. Maximal degree in co-relation 20606. Up to 4096 conditions per place. [2025-03-17 14:30:16,603 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 135 selfloop transitions, 65 changer transitions 43/250 dead transitions. [2025-03-17 14:30:16,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 250 transitions, 2064 flow [2025-03-17 14:30:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 14:30:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-17 14:30:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 420 transitions. [2025-03-17 14:30:16,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3230769230769231 [2025-03-17 14:30:16,605 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 618 flow. Second operand 26 states and 420 transitions. [2025-03-17 14:30:16,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 250 transitions, 2064 flow [2025-03-17 14:30:16,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 250 transitions, 1955 flow, removed 39 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:16,631 INFO L231 Difference]: Finished difference. Result has 128 places, 131 transitions, 1154 flow [2025-03-17 14:30:16,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1154, PETRI_PLACES=128, PETRI_TRANSITIONS=131} [2025-03-17 14:30:16,632 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 76 predicate places. [2025-03-17 14:30:16,632 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 131 transitions, 1154 flow [2025-03-17 14:30:16,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.88) internal successors, (297), 25 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:16,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:16,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:16,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:30:16,832 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,SelfDestructingSolverStorable17 [2025-03-17 14:30:16,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:30:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1160544908, now seen corresponding path program 3 times [2025-03-17 14:30:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789866417] [2025-03-17 14:30:16,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:30:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:16,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-17 14:30:16,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-17 14:30:16,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:30:16,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789866417] [2025-03-17 14:30:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789866417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629081601] [2025-03-17 14:30:17,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:30:17,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:17,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:17,161 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:17,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:30:17,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-17 14:30:17,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-17 14:30:17,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:30:17,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:17,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 14:30:17,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:17,254 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 15 treesize of output 1 [2025-03-17 14:30:17,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2025-03-17 14:30:17,509 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 51 treesize of output 47 [2025-03-17 14:30:17,510 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 47 treesize of output 43 [2025-03-17 14:30:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:17,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:17,789 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 177 treesize of output 173 [2025-03-17 14:30:17,792 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 173 treesize of output 169 [2025-03-17 14:30:19,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 264 [2025-03-17 14:30:19,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:30:19,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 387 treesize of output 389 [2025-03-17 14:30:34,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 228 [2025-03-17 14:30:34,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:30:34,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 281 treesize of output 311 [2025-03-17 14:30:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:59,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629081601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:59,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:59,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-17 14:30:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25964650] [2025-03-17 14:30:59,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:59,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 14:30:59,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:59,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 14:30:59,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:30:59,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-17 14:30:59,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 131 transitions, 1154 flow. Second operand has 25 states, 25 states have (on average 11.88) internal successors, (297), 25 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:59,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:59,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-17 14:30:59,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:01,777 INFO L124 PetriNetUnfolderBase]: 3457/5339 cut-off events. [2025-03-17 14:31:01,777 INFO L125 PetriNetUnfolderBase]: For 24942/25136 co-relation queries the response was YES. [2025-03-17 14:31:01,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24268 conditions, 5339 events. 3457/5339 cut-off events. For 24942/25136 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 29193 event pairs, 1223 based on Foata normal form. 14/5222 useless extension candidates. Maximal degree in co-relation 23983. Up to 4204 conditions per place. [2025-03-17 14:31:01,809 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 167 selfloop transitions, 85 changer transitions 29/288 dead transitions. [2025-03-17 14:31:01,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 288 transitions, 2744 flow [2025-03-17 14:31:01,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 14:31:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-17 14:31:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 479 transitions. [2025-03-17 14:31:01,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3090322580645161 [2025-03-17 14:31:01,811 INFO L175 Difference]: Start difference. First operand has 128 places, 131 transitions, 1154 flow. Second operand 31 states and 479 transitions. [2025-03-17 14:31:01,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 288 transitions, 2744 flow [2025-03-17 14:31:01,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 288 transitions, 2629 flow, removed 43 selfloop flow, removed 9 redundant places. [2025-03-17 14:31:01,856 INFO L231 Difference]: Finished difference. Result has 154 places, 169 transitions, 1684 flow [2025-03-17 14:31:01,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1684, PETRI_PLACES=154, PETRI_TRANSITIONS=169} [2025-03-17 14:31:01,857 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 102 predicate places. [2025-03-17 14:31:01,857 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 169 transitions, 1684 flow [2025-03-17 14:31:01,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.88) internal successors, (297), 25 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:01,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:31:01,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:31:01,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:31:02,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:02,058 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-17 14:31:02,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:31:02,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1617804874, now seen corresponding path program 4 times [2025-03-17 14:31:02,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:31:02,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057767753] [2025-03-17 14:31:02,059 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:31:02,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:31:02,064 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-17 14:31:02,074 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:31:02,075 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:31:02,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:02,429 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-17 14:31:02,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057767753] [2025-03-17 14:31:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057767753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818545584] [2025-03-17 14:31:02,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:31:02,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:02,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:31:02,432 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:31:02,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:31:02,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-17 14:31:02,487 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:31:02,487 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:31:02,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:02,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 14:31:02,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:31:02,528 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 15 treesize of output 1 [2025-03-17 14:31:02,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2025-03-17 14:31:02,767 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 51 treesize of output 47 [2025-03-17 14:31:02,769 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 47 treesize of output 43 [2025-03-17 14:31:02,827 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-17 14:31:02,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:31:03,016 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 169 treesize of output 165 [2025-03-17 14:31:03,019 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 165 treesize of output 161 [2025-03-17 14:31:04,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 264 [2025-03-17 14:31:04,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:04,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 387 treesize of output 389 [2025-03-17 14:31:23,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 228 [2025-03-17 14:31:23,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:23,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 281 treesize of output 311