./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum2.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 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:12:55,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:12:55,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:12:55,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:12:55,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:12:56,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:12:56,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:12:56,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:12:56,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:12:56,013 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:12:56,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:12:56,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:12:56,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:12:56,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:12:56,015 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:12:56,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:12:56,015 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:12:56,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:12:56,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:12:56,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:12:56,015 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:12:56,016 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:12:56,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:12:56,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:12:56,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:12:56,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:12:56,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:12:56,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:12:56,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:12:56,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:12:56,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:12:56,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:12:56,018 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2025-03-04 10:12:56,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:12:56,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:12:56,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:12:56,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:12:56,250 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:12:56,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-03-04 10:12:57,434 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be57a6656/edfdeafb05b342ea88d4fafb8a65a69b/FLAGdd8d79566 [2025-03-04 10:12:57,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:12:57,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-03-04 10:12:57,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be57a6656/edfdeafb05b342ea88d4fafb8a65a69b/FLAGdd8d79566 [2025-03-04 10:12:57,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be57a6656/edfdeafb05b342ea88d4fafb8a65a69b [2025-03-04 10:12:57,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:12:57,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:12:57,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:12:57,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:12:57,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:12:57,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:57,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3a61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57, skipping insertion in model container [2025-03-04 10:12:57,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:57,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:12:57,915 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-04 10:12:57,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:12:57,927 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:12:57,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:12:57,953 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:12:57,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57 WrapperNode [2025-03-04 10:12:57,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:12:57,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:12:57,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:12:57,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:12:57,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:57,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:57,981 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 251 [2025-03-04 10:12:57,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:12:57,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:12:57,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:12:57,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:12:57,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:57,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:57,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:57,999 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 10:12:57,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:57,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:58,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:58,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:58,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:58,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:58,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:12:58,014 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:12:58,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:12:58,014 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:12:58,015 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (1/1) ... [2025-03-04 10:12:58,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:12:58,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:58,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:12:58,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:12:58,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:12:58,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:12:58,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:12:58,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:12:58,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:12:58,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:12:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:12:58,063 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:12:58,135 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:12:58,136 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:12:58,569 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:12:58,569 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:12:58,882 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:12:58,882 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:12:58,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:12:58 BoogieIcfgContainer [2025-03-04 10:12:58,883 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:12:58,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:12:58,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:12:58,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:12:58,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:12:57" (1/3) ... [2025-03-04 10:12:58,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9e480e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:12:58, skipping insertion in model container [2025-03-04 10:12:58,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:57" (2/3) ... [2025-03-04 10:12:58,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9e480e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:12:58, skipping insertion in model container [2025-03-04 10:12:58,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:12:58" (3/3) ... [2025-03-04 10:12:58,890 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-03-04 10:12:58,901 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:12:58,903 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 51 locations, 1 initial locations, 5 loop locations, and 18 error locations. [2025-03-04 10:12:58,903 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:12:58,954 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:12:58,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 131 flow [2025-03-04 10:12:59,005 INFO L124 PetriNetUnfolderBase]: 5/52 cut-off events. [2025-03-04 10:12:59,010 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:12:59,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 5/52 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-04 10:12:59,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 55 transitions, 131 flow [2025-03-04 10:12:59,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 120 flow [2025-03-04 10:12:59,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:12:59,028 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;@3c0f8a15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:12:59,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-04 10:12:59,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:12:59,034 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:12:59,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:12:59,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:59,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:12:59,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:12:59,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:59,039 INFO L85 PathProgramCache]: Analyzing trace with hash 804613, now seen corresponding path program 1 times [2025-03-04 10:12:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650083998] [2025-03-04 10:12:59,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:59,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:12:59,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:12:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:59,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:59,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:59,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650083998] [2025-03-04 10:12:59,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650083998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:59,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:59,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:12:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52332076] [2025-03-04 10:12:59,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:59,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:12:59,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:59,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:12:59,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:12:59,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:12:59,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:59,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:59,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:12:59,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:59,802 INFO L124 PetriNetUnfolderBase]: 2971/4302 cut-off events. [2025-03-04 10:12:59,802 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-03-04 10:12:59,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8744 conditions, 4302 events. 2971/4302 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 25548 event pairs, 2534 based on Foata normal form. 1/2488 useless extension candidates. Maximal degree in co-relation 8225. Up to 4213 conditions per place. [2025-03-04 10:12:59,827 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 39 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-03-04 10:12:59,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 194 flow [2025-03-04 10:12:59,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:12:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:12:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-04 10:12:59,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-03-04 10:12:59,840 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 120 flow. Second operand 3 states and 74 transitions. [2025-03-04 10:12:59,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 194 flow [2025-03-04 10:12:59,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 182 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:12:59,849 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 104 flow [2025-03-04 10:12:59,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2025-03-04 10:12:59,854 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -8 predicate places. [2025-03-04 10:12:59,855 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 104 flow [2025-03-04 10:12:59,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:59,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:59,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:12:59,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:12:59,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:12:59,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash 804614, now seen corresponding path program 1 times [2025-03-04 10:12:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:59,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615536868] [2025-03-04 10:12:59,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:59,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:12:59,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:12:59,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:59,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:00,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:00,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615536868] [2025-03-04 10:13:00,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615536868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:00,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:00,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:00,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634460581] [2025-03-04 10:13:00,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:00,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:00,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:00,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:00,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:00,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:13:00,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:00,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:00,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:13:00,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:00,607 INFO L124 PetriNetUnfolderBase]: 2972/4305 cut-off events. [2025-03-04 10:13:00,607 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:13:00,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8606 conditions, 4305 events. 2972/4305 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 25538 event pairs, 2534 based on Foata normal form. 0/2488 useless extension candidates. Maximal degree in co-relation 8577. Up to 4222 conditions per place. [2025-03-04 10:13:00,626 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 42 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-03-04 10:13:00,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 202 flow [2025-03-04 10:13:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-04 10:13:00,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39545454545454545 [2025-03-04 10:13:00,629 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 104 flow. Second operand 4 states and 87 transitions. [2025-03-04 10:13:00,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 202 flow [2025-03-04 10:13:00,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:00,631 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 127 flow [2025-03-04 10:13:00,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-03-04 10:13:00,632 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2025-03-04 10:13:00,632 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 127 flow [2025-03-04 10:13:00,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:00,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:00,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:13:00,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:13:00,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:00,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash 24945635, now seen corresponding path program 1 times [2025-03-04 10:13:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:00,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915276347] [2025-03-04 10:13:00,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:00,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:13:00,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:13:00,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:00,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:00,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:00,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915276347] [2025-03-04 10:13:00,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915276347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:00,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:00,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002571141] [2025-03-04 10:13:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:00,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:00,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:00,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:00,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-04 10:13:00,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:00,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:00,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-04 10:13:00,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:01,128 INFO L124 PetriNetUnfolderBase]: 2971/4308 cut-off events. [2025-03-04 10:13:01,128 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:13:01,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8620 conditions, 4308 events. 2971/4308 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 25558 event pairs, 2534 based on Foata normal form. 1/2494 useless extension candidates. Maximal degree in co-relation 8600. Up to 4219 conditions per place. [2025-03-04 10:13:01,146 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 41 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2025-03-04 10:13:01,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 223 flow [2025-03-04 10:13:01,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-03-04 10:13:01,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4409090909090909 [2025-03-04 10:13:01,147 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 127 flow. Second operand 4 states and 97 transitions. [2025-03-04 10:13:01,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 223 flow [2025-03-04 10:13:01,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:01,149 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 142 flow [2025-03-04 10:13:01,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-03-04 10:13:01,149 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2025-03-04 10:13:01,149 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 142 flow [2025-03-04 10:13:01,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:01,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:01,150 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:13:01,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:13:01,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:01,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:01,150 INFO L85 PathProgramCache]: Analyzing trace with hash 773259297, now seen corresponding path program 1 times [2025-03-04 10:13:01,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:01,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856586979] [2025-03-04 10:13:01,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:01,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:01,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:13:01,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:13:01,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:01,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:01,346 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-04 10:13:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:01,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856586979] [2025-03-04 10:13:01,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856586979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:01,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888360630] [2025-03-04 10:13:01,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:01,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:01,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:01,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:01,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:13:01,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:13:01,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:13:01,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:01,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:01,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:13:01,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:01,465 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-04 10:13:01,583 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-04 10:13:01,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:01,670 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-04 10:13:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888360630] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:01,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:13:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063605732] [2025-03-04 10:13:01,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:01,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:13:01,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:01,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:13:01,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:13:01,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:13:01,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 142 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:01,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:01,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:13:01,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:02,173 INFO L124 PetriNetUnfolderBase]: 2971/4306 cut-off events. [2025-03-04 10:13:02,174 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:13:02,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8628 conditions, 4306 events. 2971/4306 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 25484 event pairs, 2534 based on Foata normal form. 0/2493 useless extension candidates. Maximal degree in co-relation 8605. Up to 4220 conditions per place. [2025-03-04 10:13:02,196 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 39 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2025-03-04 10:13:02,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 228 flow [2025-03-04 10:13:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:13:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:13:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-03-04 10:13:02,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2025-03-04 10:13:02,200 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 142 flow. Second operand 6 states and 105 transitions. [2025-03-04 10:13:02,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 228 flow [2025-03-04 10:13:02,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 220 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:02,202 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 142 flow [2025-03-04 10:13:02,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-03-04 10:13:02,203 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2025-03-04 10:13:02,204 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 142 flow [2025-03-04 10:13:02,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:02,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:02,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:13:02,211 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-04 10:13:02,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:02,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:02,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1798762968, now seen corresponding path program 1 times [2025-03-04 10:13:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315927770] [2025-03-04 10:13:02,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:02,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:13:02,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:13:02,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:02,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:02,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:02,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315927770] [2025-03-04 10:13:02,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315927770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:02,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016371340] [2025-03-04 10:13:02,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:02,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:02,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:02,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:02,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:13:02,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:13:02,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:13:02,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:02,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:02,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:13:02,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:02,666 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-04 10:13:02,765 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:13:02,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-03-04 10:13:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:02,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016371340] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:13:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-03-04 10:13:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190920848] [2025-03-04 10:13:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:02,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:02,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:02,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:13:02,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:13:02,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:02,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:02,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:13:02,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:03,204 INFO L124 PetriNetUnfolderBase]: 2971/4305 cut-off events. [2025-03-04 10:13:03,204 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:13:03,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8626 conditions, 4305 events. 2971/4305 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 25612 event pairs, 2534 based on Foata normal form. 1/2493 useless extension candidates. Maximal degree in co-relation 8601. Up to 4219 conditions per place. [2025-03-04 10:13:03,215 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 42 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-03-04 10:13:03,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 236 flow [2025-03-04 10:13:03,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-03-04 10:13:03,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3527272727272727 [2025-03-04 10:13:03,216 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 142 flow. Second operand 5 states and 97 transitions. [2025-03-04 10:13:03,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 236 flow [2025-03-04 10:13:03,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 210 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 10:13:03,217 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 128 flow [2025-03-04 10:13:03,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2025-03-04 10:13:03,218 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-03-04 10:13:03,218 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 128 flow [2025-03-04 10:13:03,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:03,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:03,218 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:03,224 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-04 10:13:03,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:03,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:03,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:03,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2034333312, now seen corresponding path program 1 times [2025-03-04 10:13:03,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:03,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530257637] [2025-03-04 10:13:03,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:03,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:03,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:13:03,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:13:03,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:03,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:03,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:03,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530257637] [2025-03-04 10:13:03,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530257637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:03,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260727543] [2025-03-04 10:13:03,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:03,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:03,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:03,521 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-04 10:13:03,523 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-04 10:13:03,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:13:03,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:13:03,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:03,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:03,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:13:03,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:03,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:03,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260727543] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:03,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:03,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:13:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342089711] [2025-03-04 10:13:03,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:03,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:13:03,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:03,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:13:03,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:13:03,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-04 10:13:03,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 128 flow. Second operand has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:03,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:03,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-04 10:13:03,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:04,473 INFO L124 PetriNetUnfolderBase]: 5941/8608 cut-off events. [2025-03-04 10:13:04,473 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 10:13:04,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17222 conditions, 8608 events. 5941/8608 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 54682 event pairs, 5068 based on Foata normal form. 1/5056 useless extension candidates. Maximal degree in co-relation 8597. Up to 4217 conditions per place. [2025-03-04 10:13:04,513 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 74 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2025-03-04 10:13:04,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 414 flow [2025-03-04 10:13:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:13:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:13:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2025-03-04 10:13:04,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2025-03-04 10:13:04,516 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 128 flow. Second operand 8 states and 185 transitions. [2025-03-04 10:13:04,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 414 flow [2025-03-04 10:13:04,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 93 transitions, 400 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:13:04,518 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 192 flow [2025-03-04 10:13:04,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-03-04 10:13:04,519 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2025-03-04 10:13:04,520 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 192 flow [2025-03-04 10:13:04,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:04,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:04,521 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:13:04,527 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-04 10:13:04,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:04,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:04,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:04,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1838303557, now seen corresponding path program 2 times [2025-03-04 10:13:04,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:04,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131745446] [2025-03-04 10:13:04,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:04,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:04,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 10:13:04,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:13:04,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:04,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:13:04,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131745446] [2025-03-04 10:13:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131745446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49201162] [2025-03-04 10:13:04,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:04,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:04,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:04,981 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-04 10:13:04,983 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-04 10:13:05,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 10:13:05,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:13:05,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:05,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:05,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:13:05,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:05,053 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-04 10:13:05,147 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:13:05,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-03-04 10:13:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:05,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:05,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49201162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:05,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:05,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-03-04 10:13:05,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583538236] [2025-03-04 10:13:05,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:05,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:13:05,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:05,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:13:05,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:13:05,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:13:05,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 192 flow. Second operand has 16 states, 16 states have (on average 11.75) internal successors, (188), 16 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:05,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:05,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:13:05,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:06,553 INFO L124 PetriNetUnfolderBase]: 5940/8605 cut-off events. [2025-03-04 10:13:06,554 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 10:13:06,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17235 conditions, 8605 events. 5940/8605 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 53911 event pairs, 5068 based on Foata normal form. 3/5055 useless extension candidates. Maximal degree in co-relation 8597. Up to 4213 conditions per place. [2025-03-04 10:13:06,580 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 70 selfloop transitions, 17 changer transitions 0/91 dead transitions. [2025-03-04 10:13:06,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 442 flow [2025-03-04 10:13:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:13:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:13:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2025-03-04 10:13:06,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2025-03-04 10:13:06,583 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 192 flow. Second operand 10 states and 190 transitions. [2025-03-04 10:13:06,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 442 flow [2025-03-04 10:13:06,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 424 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:06,585 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 210 flow [2025-03-04 10:13:06,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=210, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-03-04 10:13:06,586 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2025-03-04 10:13:06,586 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 210 flow [2025-03-04 10:13:06,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.75) internal successors, (188), 16 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:06,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:06,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:06,593 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-04 10:13:06,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:06,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:06,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:06,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1463906377, now seen corresponding path program 1 times [2025-03-04 10:13:06,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:06,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621028554] [2025-03-04 10:13:06,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:06,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:06,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:06,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:06,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:06,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:06,960 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-04 10:13:06,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621028554] [2025-03-04 10:13:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621028554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482674813] [2025-03-04 10:13:06,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:06,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:06,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:06,963 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-04 10:13:06,964 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-04 10:13:07,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:07,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:07,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:07,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:07,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:13:07,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:07,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:13:07,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:07,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:13:07,072 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:13:07,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:13:07,113 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-04 10:13:07,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:07,191 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 52 treesize of output 48 [2025-03-04 10:13:07,246 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-04 10:13:07,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482674813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:07,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:07,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:13:07,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179500022] [2025-03-04 10:13:07,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:07,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:13:07,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:07,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:13:07,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:13:07,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:13:07,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 210 flow. Second operand has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:07,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:07,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:13:07,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:08,217 INFO L124 PetriNetUnfolderBase]: 9772/13989 cut-off events. [2025-03-04 10:13:08,217 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 10:13:08,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28013 conditions, 13989 events. 9772/13989 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 88879 event pairs, 3078 based on Foata normal form. 0/8179 useless extension candidates. Maximal degree in co-relation 13977. Up to 5716 conditions per place. [2025-03-04 10:13:08,258 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 86 selfloop transitions, 15 changer transitions 0/105 dead transitions. [2025-03-04 10:13:08,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 520 flow [2025-03-04 10:13:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:13:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:13:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2025-03-04 10:13:08,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3717171717171717 [2025-03-04 10:13:08,260 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 210 flow. Second operand 9 states and 184 transitions. [2025-03-04 10:13:08,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 520 flow [2025-03-04 10:13:08,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 105 transitions, 490 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:08,263 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 242 flow [2025-03-04 10:13:08,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=242, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2025-03-04 10:13:08,263 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2025-03-04 10:13:08,263 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 242 flow [2025-03-04 10:13:08,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:08,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:08,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:08,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:13:08,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:08,464 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:08,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1463906378, now seen corresponding path program 1 times [2025-03-04 10:13:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:08,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8433465] [2025-03-04 10:13:08,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:08,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:08,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:08,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:08,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:08,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:08,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:08,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8433465] [2025-03-04 10:13:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8433465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:08,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:08,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086504226] [2025-03-04 10:13:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:08,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:08,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:08,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:08,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:13:08,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-04 10:13:08,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:08,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:13:08,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:08,912 INFO L124 PetriNetUnfolderBase]: 6492/9363 cut-off events. [2025-03-04 10:13:08,912 INFO L125 PetriNetUnfolderBase]: For 3461/3461 co-relation queries the response was YES. [2025-03-04 10:13:08,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22143 conditions, 9363 events. 6492/9363 cut-off events. For 3461/3461 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 58073 event pairs, 5344 based on Foata normal form. 0/6667 useless extension candidates. Maximal degree in co-relation 11059. Up to 9116 conditions per place. [2025-03-04 10:13:08,941 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 50 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2025-03-04 10:13:08,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 335 flow [2025-03-04 10:13:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-03-04 10:13:08,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36818181818181817 [2025-03-04 10:13:08,942 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 242 flow. Second operand 4 states and 81 transitions. [2025-03-04 10:13:08,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 335 flow [2025-03-04 10:13:08,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 57 transitions, 325 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:13:08,945 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 225 flow [2025-03-04 10:13:08,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-03-04 10:13:08,945 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2025-03-04 10:13:08,945 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 225 flow [2025-03-04 10:13:08,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-04 10:13:08,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:08,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:08,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:13:08,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:08,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1463906379, now seen corresponding path program 1 times [2025-03-04 10:13:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321633882] [2025-03-04 10:13:08,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:08,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:08,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:08,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:08,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321633882] [2025-03-04 10:13:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321633882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321359180] [2025-03-04 10:13:09,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:09,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:09,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:09,095 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-04 10:13:09,096 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-04 10:13:09,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:09,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:09,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:09,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:09,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:13:09,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:09,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:09,232 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-04 10:13:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:09,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321359180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:09,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:13:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033821712] [2025-03-04 10:13:09,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:09,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:13:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:09,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:13:09,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:13:09,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-04 10:13:09,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 225 flow. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:09,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:09,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-04 10:13:09,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:10,037 INFO L124 PetriNetUnfolderBase]: 5942/8593 cut-off events. [2025-03-04 10:13:10,038 INFO L125 PetriNetUnfolderBase]: For 2597/2597 co-relation queries the response was YES. [2025-03-04 10:13:10,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20350 conditions, 8593 events. 5942/8593 cut-off events. For 2597/2597 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 51836 event pairs, 2118 based on Foata normal form. 0/6372 useless extension candidates. Maximal degree in co-relation 10162. Up to 5226 conditions per place. [2025-03-04 10:13:10,088 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 79 selfloop transitions, 13 changer transitions 0/96 dead transitions. [2025-03-04 10:13:10,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 96 transitions, 495 flow [2025-03-04 10:13:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:13:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:13:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2025-03-04 10:13:10,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43896103896103894 [2025-03-04 10:13:10,089 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 225 flow. Second operand 7 states and 169 transitions. [2025-03-04 10:13:10,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 96 transitions, 495 flow [2025-03-04 10:13:10,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 491 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:10,093 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 243 flow [2025-03-04 10:13:10,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2025-03-04 10:13:10,093 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2025-03-04 10:13:10,094 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 243 flow [2025-03-04 10:13:10,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:10,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:10,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:10,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:10,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:10,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:10,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:10,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1463906376, now seen corresponding path program 1 times [2025-03-04 10:13:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:10,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233618942] [2025-03-04 10:13:10,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:10,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:10,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:10,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:10,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:10,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:10,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233618942] [2025-03-04 10:13:10,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233618942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:10,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:10,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101656045] [2025-03-04 10:13:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:10,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:10,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:10,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:10,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:13:10,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:10,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:10,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:13:10,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:10,656 INFO L124 PetriNetUnfolderBase]: 3628/5267 cut-off events. [2025-03-04 10:13:10,656 INFO L125 PetriNetUnfolderBase]: For 5027/5027 co-relation queries the response was YES. [2025-03-04 10:13:10,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13813 conditions, 5267 events. 3628/5267 cut-off events. For 5027/5027 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 29270 event pairs, 2840 based on Foata normal form. 342/4619 useless extension candidates. Maximal degree in co-relation 6894. Up to 5092 conditions per place. [2025-03-04 10:13:10,670 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-03-04 10:13:10,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 53 transitions, 335 flow [2025-03-04 10:13:10,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-03-04 10:13:10,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32 [2025-03-04 10:13:10,671 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 243 flow. Second operand 5 states and 88 transitions. [2025-03-04 10:13:10,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 53 transitions, 335 flow [2025-03-04 10:13:10,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 53 transitions, 308 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:13:10,673 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 220 flow [2025-03-04 10:13:10,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-03-04 10:13:10,674 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2025-03-04 10:13:10,674 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 220 flow [2025-03-04 10:13:10,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:10,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:10,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:10,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:13:10,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:10,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1943585686, now seen corresponding path program 1 times [2025-03-04 10:13:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:10,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975228733] [2025-03-04 10:13:10,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:10,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:13:10,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:13:10,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:10,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:10,750 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-04 10:13:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975228733] [2025-03-04 10:13:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975228733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468342322] [2025-03-04 10:13:10,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:10,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:10,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:10,753 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-04 10:13:10,754 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-04 10:13:10,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:13:10,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:13:10,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:10,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:10,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:13:10,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:10,849 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-04 10:13:10,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:10,898 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-04 10:13:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468342322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:10,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:10,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:13:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209302060] [2025-03-04 10:13:10,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:13:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:10,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:13:10,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:13:10,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:13:10,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 220 flow. Second operand has 14 states, 14 states have (on average 13.071428571428571) internal successors, (183), 14 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:10,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:10,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:13:10,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:11,296 INFO L124 PetriNetUnfolderBase]: 2914/4275 cut-off events. [2025-03-04 10:13:11,296 INFO L125 PetriNetUnfolderBase]: For 2286/2286 co-relation queries the response was YES. [2025-03-04 10:13:11,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10456 conditions, 4275 events. 2914/4275 cut-off events. For 2286/2286 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 22057 event pairs, 2027 based on Foata normal form. 0/3432 useless extension candidates. Maximal degree in co-relation 7376. Up to 2967 conditions per place. [2025-03-04 10:13:11,310 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 82 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2025-03-04 10:13:11,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 574 flow [2025-03-04 10:13:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:13:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:13:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2025-03-04 10:13:11,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3797979797979798 [2025-03-04 10:13:11,311 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 220 flow. Second operand 9 states and 188 transitions. [2025-03-04 10:13:11,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 574 flow [2025-03-04 10:13:11,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 566 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:11,313 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 257 flow [2025-03-04 10:13:11,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2025-03-04 10:13:11,314 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2025-03-04 10:13:11,314 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 257 flow [2025-03-04 10:13:11,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.071428571428571) internal successors, (183), 14 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:11,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:11,314 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:11,320 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-04 10:13:11,514 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-04 10:13:11,515 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:11,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:11,515 INFO L85 PathProgramCache]: Analyzing trace with hash 137834196, now seen corresponding path program 1 times [2025-03-04 10:13:11,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:11,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172564445] [2025-03-04 10:13:11,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:11,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:11,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:13:11,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:13:11,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:11,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:11,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:11,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172564445] [2025-03-04 10:13:11,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172564445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:11,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321953053] [2025-03-04 10:13:11,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:11,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:11,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:11,606 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-04 10:13:11,608 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-04 10:13:11,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:13:11,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:13:11,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:11,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:11,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:13:11,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:11,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:11,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321953053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:11,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:13:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420715003] [2025-03-04 10:13:11,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:11,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:13:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:11,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:13:11,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:13:11,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:13:11,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 257 flow. Second operand has 14 states, 14 states have (on average 13.214285714285714) internal successors, (185), 14 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:11,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:11,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:13:11,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:12,127 INFO L124 PetriNetUnfolderBase]: 2804/4117 cut-off events. [2025-03-04 10:13:12,128 INFO L125 PetriNetUnfolderBase]: For 2012/2149 co-relation queries the response was YES. [2025-03-04 10:13:12,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10418 conditions, 4117 events. 2804/4117 cut-off events. For 2012/2149 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21321 event pairs, 1937 based on Foata normal form. 44/3443 useless extension candidates. Maximal degree in co-relation 7851. Up to 3135 conditions per place. [2025-03-04 10:13:12,138 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 84 selfloop transitions, 17 changer transitions 0/104 dead transitions. [2025-03-04 10:13:12,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 104 transitions, 605 flow [2025-03-04 10:13:12,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:13:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:13:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2025-03-04 10:13:12,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-03-04 10:13:12,139 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 257 flow. Second operand 10 states and 209 transitions. [2025-03-04 10:13:12,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 104 transitions, 605 flow [2025-03-04 10:13:12,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 580 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:13:12,142 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 307 flow [2025-03-04 10:13:12,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=307, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2025-03-04 10:13:12,142 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2025-03-04 10:13:12,142 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 307 flow [2025-03-04 10:13:12,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.214285714285714) internal successors, (185), 14 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:12,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:12,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:12,148 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-04 10:13:12,347 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-04 10:13:12,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:12,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash 482090929, now seen corresponding path program 1 times [2025-03-04 10:13:12,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:12,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909711807] [2025-03-04 10:13:12,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:12,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:12,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:12,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:12,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:12,503 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-04 10:13:12,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:12,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909711807] [2025-03-04 10:13:12,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909711807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:12,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:12,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:13:12,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619225602] [2025-03-04 10:13:12,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:12,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:13:12,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:12,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:13:12,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:13:12,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:13:12,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:12,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:12,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:13:12,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:12,892 INFO L124 PetriNetUnfolderBase]: 2912/4328 cut-off events. [2025-03-04 10:13:12,892 INFO L125 PetriNetUnfolderBase]: For 4835/4958 co-relation queries the response was YES. [2025-03-04 10:13:12,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11711 conditions, 4328 events. 2912/4328 cut-off events. For 4835/4958 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22461 event pairs, 1251 based on Foata normal form. 0/3545 useless extension candidates. Maximal degree in co-relation 8574. Up to 2334 conditions per place. [2025-03-04 10:13:12,910 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 72 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2025-03-04 10:13:12,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 86 transitions, 603 flow [2025-03-04 10:13:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:13:12,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:13:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-03-04 10:13:12,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2025-03-04 10:13:12,911 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 307 flow. Second operand 6 states and 114 transitions. [2025-03-04 10:13:12,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 86 transitions, 603 flow [2025-03-04 10:13:12,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 86 transitions, 574 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 10:13:12,916 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 326 flow [2025-03-04 10:13:12,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2025-03-04 10:13:12,916 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2025-03-04 10:13:12,916 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 326 flow [2025-03-04 10:13:12,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:12,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:12,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:12,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:13:12,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:12,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash 482090931, now seen corresponding path program 1 times [2025-03-04 10:13:12,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:12,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797143795] [2025-03-04 10:13:12,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:12,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:12,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:12,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:12,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:12,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:13,082 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-04 10:13:13,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:13,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797143795] [2025-03-04 10:13:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797143795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:13,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367454819] [2025-03-04 10:13:13,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:13,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:13,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:13,085 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-04 10:13:13,087 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-04 10:13:13,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:13,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:13,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:13,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:13,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:13:13,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:13,261 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-04 10:13:13,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:13,349 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 36 treesize of output 32 [2025-03-04 10:13:13,416 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-04 10:13:13,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367454819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:13,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:13,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 10:13:13,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689342523] [2025-03-04 10:13:13,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:13,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:13:13,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:13,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:13:13,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:13:13,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-04 10:13:13,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 326 flow. Second operand has 20 states, 20 states have (on average 14.1) internal successors, (282), 20 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:13,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:13,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-04 10:13:13,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:14,332 INFO L124 PetriNetUnfolderBase]: 2986/4466 cut-off events. [2025-03-04 10:13:14,332 INFO L125 PetriNetUnfolderBase]: For 6761/6973 co-relation queries the response was YES. [2025-03-04 10:13:14,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14068 conditions, 4466 events. 2986/4466 cut-off events. For 6761/6973 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23740 event pairs, 1764 based on Foata normal form. 0/3852 useless extension candidates. Maximal degree in co-relation 9917. Up to 2652 conditions per place. [2025-03-04 10:13:14,354 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 107 selfloop transitions, 22 changer transitions 0/133 dead transitions. [2025-03-04 10:13:14,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 133 transitions, 931 flow [2025-03-04 10:13:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:13:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:13:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 321 transitions. [2025-03-04 10:13:14,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3433155080213904 [2025-03-04 10:13:14,356 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 326 flow. Second operand 17 states and 321 transitions. [2025-03-04 10:13:14,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 133 transitions, 931 flow [2025-03-04 10:13:14,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:14,364 INFO L231 Difference]: Finished difference. Result has 96 places, 68 transitions, 419 flow [2025-03-04 10:13:14,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=419, PETRI_PLACES=96, PETRI_TRANSITIONS=68} [2025-03-04 10:13:14,364 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 40 predicate places. [2025-03-04 10:13:14,365 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 68 transitions, 419 flow [2025-03-04 10:13:14,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.1) internal successors, (282), 20 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:14,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:14,365 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:14,371 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-04 10:13:14,565 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,SelfDestructingSolverStorable14 [2025-03-04 10:13:14,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:14,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1726499155, now seen corresponding path program 2 times [2025-03-04 10:13:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150149786] [2025-03-04 10:13:14,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:14,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 10:13:14,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:13:14,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:14,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:14,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:14,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150149786] [2025-03-04 10:13:14,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150149786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:14,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964853387] [2025-03-04 10:13:14,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:14,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:14,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:14,765 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-04 10:13:14,766 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-04 10:13:14,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 10:13:14,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:13:14,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:14,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:14,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:13:14,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:14,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:13:14,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:14,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:13:14,902 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:13:14,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:13:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:14,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:15,039 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 52 treesize of output 48 [2025-03-04 10:13:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964853387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:15,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:15,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2025-03-04 10:13:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713038913] [2025-03-04 10:13:15,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:15,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:13:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:15,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:13:15,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:13:15,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:13:15,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 68 transitions, 419 flow. Second operand has 17 states, 17 states have (on average 12.294117647058824) internal successors, (209), 17 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:15,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:15,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:13:15,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:16,343 INFO L124 PetriNetUnfolderBase]: 4895/7112 cut-off events. [2025-03-04 10:13:16,344 INFO L125 PetriNetUnfolderBase]: For 14076/14354 co-relation queries the response was YES. [2025-03-04 10:13:16,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23496 conditions, 7112 events. 4895/7112 cut-off events. For 14076/14354 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 37520 event pairs, 1363 based on Foata normal form. 0/6403 useless extension candidates. Maximal degree in co-relation 19005. Up to 2233 conditions per place. [2025-03-04 10:13:16,384 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 129 selfloop transitions, 19 changer transitions 0/152 dead transitions. [2025-03-04 10:13:16,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 152 transitions, 1148 flow [2025-03-04 10:13:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:13:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:13:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 274 transitions. [2025-03-04 10:13:16,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3321212121212121 [2025-03-04 10:13:16,385 INFO L175 Difference]: Start difference. First operand has 96 places, 68 transitions, 419 flow. Second operand 15 states and 274 transitions. [2025-03-04 10:13:16,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 152 transitions, 1148 flow [2025-03-04 10:13:16,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 152 transitions, 1123 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:13:16,396 INFO L231 Difference]: Finished difference. Result has 105 places, 73 transitions, 471 flow [2025-03-04 10:13:16,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=471, PETRI_PLACES=105, PETRI_TRANSITIONS=73} [2025-03-04 10:13:16,396 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 49 predicate places. [2025-03-04 10:13:16,397 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 73 transitions, 471 flow [2025-03-04 10:13:16,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.294117647058824) internal successors, (209), 17 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:16,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:16,397 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:16,406 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-04 10:13:16,597 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,SelfDestructingSolverStorable15 [2025-03-04 10:13:16,597 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:16,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1726499153, now seen corresponding path program 1 times [2025-03-04 10:13:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:16,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99009243] [2025-03-04 10:13:16,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:16,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:13:16,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:13:16,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:16,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:13:16,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:16,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99009243] [2025-03-04 10:13:16,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99009243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:16,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166649619] [2025-03-04 10:13:16,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:16,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:16,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:16,768 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-04 10:13:16,770 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-04 10:13:16,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:13:16,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:13:16,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:16,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:16,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:13:16,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:13:16,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:16,970 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-04 10:13:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:13:17,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166649619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:17,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:17,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-04 10:13:17,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505520184] [2025-03-04 10:13:17,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:17,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:13:17,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:17,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:13:17,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:13:17,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-04 10:13:17,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 73 transitions, 471 flow. Second operand has 18 states, 18 states have (on average 14.166666666666666) internal successors, (255), 18 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:17,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:17,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-04 10:13:17,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:17,981 INFO L124 PetriNetUnfolderBase]: 4384/6494 cut-off events. [2025-03-04 10:13:17,981 INFO L125 PetriNetUnfolderBase]: For 15394/15649 co-relation queries the response was YES. [2025-03-04 10:13:17,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24369 conditions, 6494 events. 4384/6494 cut-off events. For 15394/15649 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 34911 event pairs, 1723 based on Foata normal form. 0/6200 useless extension candidates. Maximal degree in co-relation 19670. Up to 2744 conditions per place. [2025-03-04 10:13:18,019 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 127 selfloop transitions, 19 changer transitions 0/150 dead transitions. [2025-03-04 10:13:18,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 150 transitions, 1178 flow [2025-03-04 10:13:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:13:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:13:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 290 transitions. [2025-03-04 10:13:18,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37662337662337664 [2025-03-04 10:13:18,022 INFO L175 Difference]: Start difference. First operand has 105 places, 73 transitions, 471 flow. Second operand 14 states and 290 transitions. [2025-03-04 10:13:18,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 150 transitions, 1178 flow [2025-03-04 10:13:18,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 150 transitions, 1148 flow, removed 1 selfloop flow, removed 12 redundant places. [2025-03-04 10:13:18,040 INFO L231 Difference]: Finished difference. Result has 106 places, 72 transitions, 475 flow [2025-03-04 10:13:18,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=475, PETRI_PLACES=106, PETRI_TRANSITIONS=72} [2025-03-04 10:13:18,041 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places. [2025-03-04 10:13:18,041 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 72 transitions, 475 flow [2025-03-04 10:13:18,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.166666666666666) internal successors, (255), 18 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:18,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:18,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:18,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:13:18,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:13:18,242 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:18,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:18,242 INFO L85 PathProgramCache]: Analyzing trace with hash -398873538, now seen corresponding path program 1 times [2025-03-04 10:13:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596954943] [2025-03-04 10:13:18,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:18,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:13:18,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:13:18,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:18,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:18,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:18,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596954943] [2025-03-04 10:13:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596954943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791264916] [2025-03-04 10:13:18,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:18,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:18,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:18,355 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-04 10:13:18,357 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-04 10:13:18,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:13:18,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:13:18,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:18,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:18,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:13:18,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:18,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:18,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791264916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:18,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:18,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:13:18,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747500672] [2025-03-04 10:13:18,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:18,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:13:18,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:18,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:13:18,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:13:18,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:13:18,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 72 transitions, 475 flow. Second operand has 15 states, 15 states have (on average 13.466666666666667) internal successors, (202), 15 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:18,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:18,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:13:18,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:19,174 INFO L124 PetriNetUnfolderBase]: 5070/7171 cut-off events. [2025-03-04 10:13:19,174 INFO L125 PetriNetUnfolderBase]: For 20643/21078 co-relation queries the response was YES. [2025-03-04 10:13:19,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27430 conditions, 7171 events. 5070/7171 cut-off events. For 20643/21078 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 34939 event pairs, 3425 based on Foata normal form. 34/7016 useless extension candidates. Maximal degree in co-relation 24002. Up to 6098 conditions per place. [2025-03-04 10:13:19,220 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 84 selfloop transitions, 17 changer transitions 0/104 dead transitions. [2025-03-04 10:13:19,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 104 transitions, 827 flow [2025-03-04 10:13:19,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:13:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:13:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2025-03-04 10:13:19,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3618181818181818 [2025-03-04 10:13:19,221 INFO L175 Difference]: Start difference. First operand has 106 places, 72 transitions, 475 flow. Second operand 10 states and 199 transitions. [2025-03-04 10:13:19,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 104 transitions, 827 flow [2025-03-04 10:13:19,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 774 flow, removed 0 selfloop flow, removed 14 redundant places. [2025-03-04 10:13:19,234 INFO L231 Difference]: Finished difference. Result has 101 places, 71 transitions, 456 flow [2025-03-04 10:13:19,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=456, PETRI_PLACES=101, PETRI_TRANSITIONS=71} [2025-03-04 10:13:19,234 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 45 predicate places. [2025-03-04 10:13:19,234 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 71 transitions, 456 flow [2025-03-04 10:13:19,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.466666666666667) internal successors, (202), 15 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:19,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:19,235 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:19,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:19,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:13:19,435 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:19,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1722417935, now seen corresponding path program 2 times [2025-03-04 10:13:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:19,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293276082] [2025-03-04 10:13:19,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:19,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:13:19,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:13:19,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:19,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:19,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293276082] [2025-03-04 10:13:19,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293276082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:19,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691652916] [2025-03-04 10:13:19,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:19,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:19,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:19,591 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:19,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:13:19,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:13:19,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:13:19,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:19,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:19,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:13:19,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:19,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:13:19,726 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:13:19,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:13:19,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:13:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:19,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:19,922 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 52 treesize of output 48 [2025-03-04 10:13:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691652916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:20,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 20 [2025-03-04 10:13:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489466059] [2025-03-04 10:13:20,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:20,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:13:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:20,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:13:20,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:13:20,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2025-03-04 10:13:20,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 71 transitions, 456 flow. Second operand has 22 states, 22 states have (on average 11.181818181818182) internal successors, (246), 22 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:20,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:20,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2025-03-04 10:13:20,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:21,746 INFO L124 PetriNetUnfolderBase]: 6472/8873 cut-off events. [2025-03-04 10:13:21,747 INFO L125 PetriNetUnfolderBase]: For 22064/22821 co-relation queries the response was YES. [2025-03-04 10:13:21,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33530 conditions, 8873 events. 6472/8873 cut-off events. For 22064/22821 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 43588 event pairs, 766 based on Foata normal form. 292/8655 useless extension candidates. Maximal degree in co-relation 29954. Up to 2268 conditions per place. [2025-03-04 10:13:21,787 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 195 selfloop transitions, 23 changer transitions 0/221 dead transitions. [2025-03-04 10:13:21,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 221 transitions, 1715 flow [2025-03-04 10:13:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:13:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:13:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 352 transitions. [2025-03-04 10:13:21,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3368421052631579 [2025-03-04 10:13:21,789 INFO L175 Difference]: Start difference. First operand has 101 places, 71 transitions, 456 flow. Second operand 19 states and 352 transitions. [2025-03-04 10:13:21,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 221 transitions, 1715 flow [2025-03-04 10:13:21,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 221 transitions, 1670 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-03-04 10:13:21,811 INFO L231 Difference]: Finished difference. Result has 113 places, 74 transitions, 498 flow [2025-03-04 10:13:21,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=498, PETRI_PLACES=113, PETRI_TRANSITIONS=74} [2025-03-04 10:13:21,812 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 57 predicate places. [2025-03-04 10:13:21,812 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 74 transitions, 498 flow [2025-03-04 10:13:21,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.181818181818182) internal successors, (246), 22 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:21,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:21,812 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:21,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:22,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:22,013 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:22,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1722417933, now seen corresponding path program 1 times [2025-03-04 10:13:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:22,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694051810] [2025-03-04 10:13:22,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:22,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:22,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:13:22,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:13:22,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:22,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:13:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694051810] [2025-03-04 10:13:22,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694051810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122846646] [2025-03-04 10:13:22,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:22,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:22,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:22,201 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:22,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:13:22,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:13:22,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:13:22,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:22,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:22,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:13:22,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:13:22,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:22,438 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-04 10:13:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:13:22,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122846646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:22,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:22,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2025-03-04 10:13:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873218631] [2025-03-04 10:13:22,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:22,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:13:22,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:22,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:13:22,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:13:22,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-04 10:13:22,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 74 transitions, 498 flow. Second operand has 22 states, 22 states have (on average 13.818181818181818) internal successors, (304), 22 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:22,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:22,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-04 10:13:22,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:23,711 INFO L124 PetriNetUnfolderBase]: 4704/6858 cut-off events. [2025-03-04 10:13:23,711 INFO L125 PetriNetUnfolderBase]: For 20882/21352 co-relation queries the response was YES. [2025-03-04 10:13:23,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27380 conditions, 6858 events. 4704/6858 cut-off events. For 20882/21352 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 34755 event pairs, 1382 based on Foata normal form. 0/6548 useless extension candidates. Maximal degree in co-relation 24085. Up to 2801 conditions per place. [2025-03-04 10:13:23,752 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 145 selfloop transitions, 20 changer transitions 0/171 dead transitions. [2025-03-04 10:13:23,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 171 transitions, 1345 flow [2025-03-04 10:13:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:13:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:13:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 303 transitions. [2025-03-04 10:13:23,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3935064935064935 [2025-03-04 10:13:23,753 INFO L175 Difference]: Start difference. First operand has 113 places, 74 transitions, 498 flow. Second operand 14 states and 303 transitions. [2025-03-04 10:13:23,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 171 transitions, 1345 flow [2025-03-04 10:13:23,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 171 transitions, 1283 flow, removed 8 selfloop flow, removed 16 redundant places. [2025-03-04 10:13:23,772 INFO L231 Difference]: Finished difference. Result has 113 places, 76 transitions, 505 flow [2025-03-04 10:13:23,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=505, PETRI_PLACES=113, PETRI_TRANSITIONS=76} [2025-03-04 10:13:23,772 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 57 predicate places. [2025-03-04 10:13:23,772 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 76 transitions, 505 flow [2025-03-04 10:13:23,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.818181818181818) internal successors, (304), 22 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:23,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:23,773 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:23,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:23,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:23,973 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:23,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1351150282, now seen corresponding path program 2 times [2025-03-04 10:13:23,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:23,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27363229] [2025-03-04 10:13:23,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:23,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:23,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:13:23,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:13:23,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:23,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:13:24,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27363229] [2025-03-04 10:13:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27363229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902659195] [2025-03-04 10:13:24,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:24,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:24,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:24,167 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:24,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:13:24,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:13:24,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:13:24,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:24,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:24,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:13:24,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:24,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:24,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-04 10:13:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:24,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902659195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:24,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:24,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 23 [2025-03-04 10:13:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492672642] [2025-03-04 10:13:24,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:24,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:13:24,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:24,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:13:24,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:13:24,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:13:24,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 76 transitions, 505 flow. Second operand has 24 states, 24 states have (on average 13.208333333333334) internal successors, (317), 24 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:24,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:24,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:13:24,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:27,024 INFO L124 PetriNetUnfolderBase]: 14253/19714 cut-off events. [2025-03-04 10:13:27,024 INFO L125 PetriNetUnfolderBase]: For 68976/70651 co-relation queries the response was YES. [2025-03-04 10:13:27,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79903 conditions, 19714 events. 14253/19714 cut-off events. For 68976/70651 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 108794 event pairs, 2935 based on Foata normal form. 1032/20230 useless extension candidates. Maximal degree in co-relation 68388. Up to 3522 conditions per place. [2025-03-04 10:13:27,146 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 281 selfloop transitions, 42 changer transitions 0/328 dead transitions. [2025-03-04 10:13:27,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 328 transitions, 2820 flow [2025-03-04 10:13:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:13:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 10:13:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 491 transitions. [2025-03-04 10:13:27,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34335664335664334 [2025-03-04 10:13:27,147 INFO L175 Difference]: Start difference. First operand has 113 places, 76 transitions, 505 flow. Second operand 26 states and 491 transitions. [2025-03-04 10:13:27,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 328 transitions, 2820 flow [2025-03-04 10:13:27,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 328 transitions, 2724 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-04 10:13:27,209 INFO L231 Difference]: Finished difference. Result has 128 places, 97 transitions, 742 flow [2025-03-04 10:13:27,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=742, PETRI_PLACES=128, PETRI_TRANSITIONS=97} [2025-03-04 10:13:27,209 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 72 predicate places. [2025-03-04 10:13:27,209 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 97 transitions, 742 flow [2025-03-04 10:13:27,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.208333333333334) internal successors, (317), 24 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:27,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:27,209 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:27,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:13:27,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:27,410 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:27,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash -577535698, now seen corresponding path program 2 times [2025-03-04 10:13:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570965299] [2025-03-04 10:13:27,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:27,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:13:27,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:13:27,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:27,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570965299] [2025-03-04 10:13:27,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570965299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989431868] [2025-03-04 10:13:27,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:27,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:27,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:27,498 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:27,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:13:27,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:13:27,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:13:27,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:27,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:27,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:13:27,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:27,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:27,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989431868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:27,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:27,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 10:13:27,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099960970] [2025-03-04 10:13:27,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:27,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:13:27,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:27,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:13:27,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:13:27,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:13:27,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 97 transitions, 742 flow. Second operand has 19 states, 19 states have (on average 13.263157894736842) internal successors, (252), 19 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:27,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:27,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:13:27,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:29,205 INFO L124 PetriNetUnfolderBase]: 12084/17255 cut-off events. [2025-03-04 10:13:29,205 INFO L125 PetriNetUnfolderBase]: For 57407/58683 co-relation queries the response was YES. [2025-03-04 10:13:29,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71854 conditions, 17255 events. 12084/17255 cut-off events. For 57407/58683 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 96218 event pairs, 4836 based on Foata normal form. 0/16645 useless extension candidates. Maximal degree in co-relation 59233. Up to 6245 conditions per place. [2025-03-04 10:13:29,322 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 186 selfloop transitions, 35 changer transitions 0/227 dead transitions. [2025-03-04 10:13:29,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 227 transitions, 2047 flow [2025-03-04 10:13:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:13:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:13:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 316 transitions. [2025-03-04 10:13:29,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35909090909090907 [2025-03-04 10:13:29,323 INFO L175 Difference]: Start difference. First operand has 128 places, 97 transitions, 742 flow. Second operand 16 states and 316 transitions. [2025-03-04 10:13:29,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 227 transitions, 2047 flow [2025-03-04 10:13:29,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 227 transitions, 1985 flow, removed 22 selfloop flow, removed 6 redundant places. [2025-03-04 10:13:29,389 INFO L231 Difference]: Finished difference. Result has 141 places, 105 transitions, 880 flow [2025-03-04 10:13:29,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=880, PETRI_PLACES=141, PETRI_TRANSITIONS=105} [2025-03-04 10:13:29,390 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 85 predicate places. [2025-03-04 10:13:29,390 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 105 transitions, 880 flow [2025-03-04 10:13:29,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.263157894736842) internal successors, (252), 19 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:29,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:29,390 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:29,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:13:29,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:13:29,591 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:29,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:29,591 INFO L85 PathProgramCache]: Analyzing trace with hash 316285915, now seen corresponding path program 2 times [2025-03-04 10:13:29,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:29,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858613694] [2025-03-04 10:13:29,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:29,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:29,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:13:29,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:13:29,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:29,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:29,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:29,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858613694] [2025-03-04 10:13:29,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858613694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:29,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871561608] [2025-03-04 10:13:29,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:29,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:29,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:29,829 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:29,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:13:29,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:13:29,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:13:29,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:29,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:29,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 10:13:29,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:29,918 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 10 treesize of output 9 [2025-03-04 10:13:29,999 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:13:30,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2025-03-04 10:13:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:30,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:30,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871561608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:30,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:30,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 10:13:30,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257605747] [2025-03-04 10:13:30,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:30,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:13:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:30,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:13:30,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:13:30,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-03-04 10:13:30,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 105 transitions, 880 flow. Second operand has 26 states, 26 states have (on average 9.307692307692308) internal successors, (242), 26 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:30,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:30,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-03-04 10:13:30,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:34,266 INFO L124 PetriNetUnfolderBase]: 11987/16666 cut-off events. [2025-03-04 10:13:34,266 INFO L125 PetriNetUnfolderBase]: For 72034/73660 co-relation queries the response was YES. [2025-03-04 10:13:34,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74287 conditions, 16666 events. 11987/16666 cut-off events. For 72034/73660 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 90156 event pairs, 2519 based on Foata normal form. 580/16661 useless extension candidates. Maximal degree in co-relation 68635. Up to 3439 conditions per place. [2025-03-04 10:13:34,413 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 319 selfloop transitions, 57 changer transitions 0/381 dead transitions. [2025-03-04 10:13:34,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 381 transitions, 3722 flow [2025-03-04 10:13:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 10:13:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 10:13:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 485 transitions. [2025-03-04 10:13:34,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26721763085399447 [2025-03-04 10:13:34,415 INFO L175 Difference]: Start difference. First operand has 141 places, 105 transitions, 880 flow. Second operand 33 states and 485 transitions. [2025-03-04 10:13:34,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 381 transitions, 3722 flow [2025-03-04 10:13:34,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 381 transitions, 3642 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-03-04 10:13:34,519 INFO L231 Difference]: Finished difference. Result has 165 places, 121 transitions, 1121 flow [2025-03-04 10:13:34,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1121, PETRI_PLACES=165, PETRI_TRANSITIONS=121} [2025-03-04 10:13:34,520 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 109 predicate places. [2025-03-04 10:13:34,520 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 121 transitions, 1121 flow [2025-03-04 10:13:34,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.307692307692308) internal successors, (242), 26 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:34,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:34,520 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:34,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:34,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:34,722 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:34,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:34,723 INFO L85 PathProgramCache]: Analyzing trace with hash -988317907, now seen corresponding path program 1 times [2025-03-04 10:13:34,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:34,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322901667] [2025-03-04 10:13:34,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:34,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:34,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:13:34,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:13:34,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:34,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:34,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:34,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322901667] [2025-03-04 10:13:34,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322901667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:34,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692840518] [2025-03-04 10:13:34,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:34,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:34,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:34,850 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:34,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:13:34,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:13:34,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:13:34,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:34,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:34,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:13:34,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:13:35,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:13:35,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692840518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:35,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:35,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-03-04 10:13:35,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717351063] [2025-03-04 10:13:35,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:35,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:13:35,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:35,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:13:35,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:13:35,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:13:35,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 121 transitions, 1121 flow. Second operand has 20 states, 20 states have (on average 13.5) internal successors, (270), 20 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:35,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:35,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:13:35,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:36,475 INFO L124 PetriNetUnfolderBase]: 8442/12079 cut-off events. [2025-03-04 10:13:36,475 INFO L125 PetriNetUnfolderBase]: For 63197/63646 co-relation queries the response was YES. [2025-03-04 10:13:36,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56705 conditions, 12079 events. 8442/12079 cut-off events. For 63197/63646 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 64132 event pairs, 4274 based on Foata normal form. 208/12094 useless extension candidates. Maximal degree in co-relation 56614. Up to 6297 conditions per place. [2025-03-04 10:13:36,565 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 149 selfloop transitions, 40 changer transitions 0/200 dead transitions. [2025-03-04 10:13:36,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 200 transitions, 2151 flow [2025-03-04 10:13:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:13:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:13:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2025-03-04 10:13:36,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2025-03-04 10:13:36,567 INFO L175 Difference]: Start difference. First operand has 165 places, 121 transitions, 1121 flow. Second operand 12 states and 236 transitions. [2025-03-04 10:13:36,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 200 transitions, 2151 flow [2025-03-04 10:13:36,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 200 transitions, 1996 flow, removed 16 selfloop flow, removed 21 redundant places. [2025-03-04 10:13:36,623 INFO L231 Difference]: Finished difference. Result has 158 places, 125 transitions, 1161 flow [2025-03-04 10:13:36,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1161, PETRI_PLACES=158, PETRI_TRANSITIONS=125} [2025-03-04 10:13:36,624 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 102 predicate places. [2025-03-04 10:13:36,624 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 125 transitions, 1161 flow [2025-03-04 10:13:36,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 13.5) internal successors, (270), 20 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:36,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:36,624 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-04 10:13:36,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:13:36,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:36,825 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:36,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash -786983800, now seen corresponding path program 1 times [2025-03-04 10:13:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:36,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073744419] [2025-03-04 10:13:36,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:36,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:13:36,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:36,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:36,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:36,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:13:36,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:36,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073744419] [2025-03-04 10:13:36,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073744419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:36,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:36,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:36,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591970950] [2025-03-04 10:13:36,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:36,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:36,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:36,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:36,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:36,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-04 10:13:36,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 125 transitions, 1161 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:36,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:36,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-04 10:13:36,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:37,685 INFO L124 PetriNetUnfolderBase]: 7115/10657 cut-off events. [2025-03-04 10:13:37,685 INFO L125 PetriNetUnfolderBase]: For 55875/56664 co-relation queries the response was YES. [2025-03-04 10:13:37,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50627 conditions, 10657 events. 7115/10657 cut-off events. For 55875/56664 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 58553 event pairs, 1761 based on Foata normal form. 3/10500 useless extension candidates. Maximal degree in co-relation 50529. Up to 9059 conditions per place. [2025-03-04 10:13:37,771 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 138 selfloop transitions, 6 changer transitions 1/157 dead transitions. [2025-03-04 10:13:37,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 157 transitions, 1690 flow [2025-03-04 10:13:37,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-04 10:13:37,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2025-03-04 10:13:37,772 INFO L175 Difference]: Start difference. First operand has 158 places, 125 transitions, 1161 flow. Second operand 3 states and 86 transitions. [2025-03-04 10:13:37,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 157 transitions, 1690 flow [2025-03-04 10:13:37,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 157 transitions, 1602 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-04 10:13:37,828 INFO L231 Difference]: Finished difference. Result has 152 places, 130 transitions, 1140 flow [2025-03-04 10:13:37,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=152, PETRI_TRANSITIONS=130} [2025-03-04 10:13:37,828 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 96 predicate places. [2025-03-04 10:13:37,828 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 130 transitions, 1140 flow [2025-03-04 10:13:37,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:37,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:37,829 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:37,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:13:37,829 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:37,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1942685775, now seen corresponding path program 3 times [2025-03-04 10:13:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:37,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262249833] [2025-03-04 10:13:37,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:13:37,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:37,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 5 equivalence classes. [2025-03-04 10:13:37,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 25 statements. [2025-03-04 10:13:37,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:13:37,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 10:13:37,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:37,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262249833] [2025-03-04 10:13:37,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262249833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:37,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825993828] [2025-03-04 10:13:37,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:13:37,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:37,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:37,951 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:37,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:13:38,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 5 equivalence classes. [2025-03-04 10:13:38,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 25 statements. [2025-03-04 10:13:38,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:13:38,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:38,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:13:38,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:38,039 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-04 10:13:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 10:13:38,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 10:13:38,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825993828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:38,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:38,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2025-03-04 10:13:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544279543] [2025-03-04 10:13:38,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:38,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:13:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:38,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:13:38,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:13:38,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:13:38,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 130 transitions, 1140 flow. Second operand has 18 states, 18 states have (on average 13.61111111111111) internal successors, (245), 18 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:38,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:38,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:13:38,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:39,799 INFO L124 PetriNetUnfolderBase]: 8661/12502 cut-off events. [2025-03-04 10:13:39,799 INFO L125 PetriNetUnfolderBase]: For 60830/61654 co-relation queries the response was YES. [2025-03-04 10:13:39,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59784 conditions, 12502 events. 8661/12502 cut-off events. For 60830/61654 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 68657 event pairs, 1285 based on Foata normal form. 128/12332 useless extension candidates. Maximal degree in co-relation 59696. Up to 3382 conditions per place. [2025-03-04 10:13:39,897 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 257 selfloop transitions, 30 changer transitions 0/296 dead transitions. [2025-03-04 10:13:39,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 296 transitions, 2977 flow [2025-03-04 10:13:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:13:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:13:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2025-03-04 10:13:39,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2025-03-04 10:13:39,898 INFO L175 Difference]: Start difference. First operand has 152 places, 130 transitions, 1140 flow. Second operand 8 states and 185 transitions. [2025-03-04 10:13:39,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 296 transitions, 2977 flow [2025-03-04 10:13:39,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 296 transitions, 2959 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:39,986 INFO L231 Difference]: Finished difference. Result has 156 places, 130 transitions, 1190 flow [2025-03-04 10:13:39,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1190, PETRI_PLACES=156, PETRI_TRANSITIONS=130} [2025-03-04 10:13:39,986 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 100 predicate places. [2025-03-04 10:13:39,987 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 130 transitions, 1190 flow [2025-03-04 10:13:39,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.61111111111111) internal successors, (245), 18 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:39,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:39,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:39,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:40,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:40,187 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:40,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1673100669, now seen corresponding path program 1 times [2025-03-04 10:13:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:40,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725024205] [2025-03-04 10:13:40,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:40,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:40,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:13:40,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:13:40,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:40,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:40,251 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-04 10:13:40,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:40,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725024205] [2025-03-04 10:13:40,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725024205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:40,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440362155] [2025-03-04 10:13:40,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:40,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:40,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:40,254 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:40,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:13:40,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:13:40,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:13:40,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:40,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:40,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:13:40,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:40,361 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-04 10:13:40,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:40,394 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-04 10:13:40,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440362155] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:40,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:13:40,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-03-04 10:13:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616220509] [2025-03-04 10:13:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:40,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:40,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:40,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:40,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:13:40,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:13:40,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 130 transitions, 1190 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:40,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:40,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:13:40,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:41,275 INFO L124 PetriNetUnfolderBase]: 8126/11913 cut-off events. [2025-03-04 10:13:41,275 INFO L125 PetriNetUnfolderBase]: For 67677/68423 co-relation queries the response was YES. [2025-03-04 10:13:41,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57900 conditions, 11913 events. 8126/11913 cut-off events. For 67677/68423 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 65565 event pairs, 2440 based on Foata normal form. 346/11950 useless extension candidates. Maximal degree in co-relation 57813. Up to 6430 conditions per place. [2025-03-04 10:13:41,347 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 150 selfloop transitions, 13 changer transitions 0/172 dead transitions. [2025-03-04 10:13:41,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 172 transitions, 1819 flow [2025-03-04 10:13:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-03-04 10:13:41,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-03-04 10:13:41,348 INFO L175 Difference]: Start difference. First operand has 156 places, 130 transitions, 1190 flow. Second operand 5 states and 105 transitions. [2025-03-04 10:13:41,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 172 transitions, 1819 flow [2025-03-04 10:13:41,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 172 transitions, 1762 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:41,426 INFO L231 Difference]: Finished difference. Result has 155 places, 127 transitions, 1120 flow [2025-03-04 10:13:41,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1120, PETRI_PLACES=155, PETRI_TRANSITIONS=127} [2025-03-04 10:13:41,427 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 99 predicate places. [2025-03-04 10:13:41,427 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 127 transitions, 1120 flow [2025-03-04 10:13:41,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:41,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:41,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:41,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:13:41,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:13:41,628 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:41,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2076140551, now seen corresponding path program 1 times [2025-03-04 10:13:41,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:41,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235357712] [2025-03-04 10:13:41,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:41,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:41,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:13:41,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:13:41,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:41,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:13:41,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:41,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235357712] [2025-03-04 10:13:41,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235357712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:41,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:41,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:13:41,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735640525] [2025-03-04 10:13:41,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:41,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:41,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:41,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:41,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:41,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:13:41,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 127 transitions, 1120 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:41,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:41,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:13:41,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:42,476 INFO L124 PetriNetUnfolderBase]: 7576/10949 cut-off events. [2025-03-04 10:13:42,477 INFO L125 PetriNetUnfolderBase]: For 65861/67072 co-relation queries the response was YES. [2025-03-04 10:13:42,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52713 conditions, 10949 events. 7576/10949 cut-off events. For 65861/67072 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 58926 event pairs, 2311 based on Foata normal form. 272/10761 useless extension candidates. Maximal degree in co-relation 52626. Up to 5914 conditions per place. [2025-03-04 10:13:42,571 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 136 selfloop transitions, 22 changer transitions 0/164 dead transitions. [2025-03-04 10:13:42,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 164 transitions, 1773 flow [2025-03-04 10:13:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-04 10:13:42,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41363636363636364 [2025-03-04 10:13:42,573 INFO L175 Difference]: Start difference. First operand has 155 places, 127 transitions, 1120 flow. Second operand 4 states and 91 transitions. [2025-03-04 10:13:42,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 164 transitions, 1773 flow [2025-03-04 10:13:42,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 164 transitions, 1726 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:42,632 INFO L231 Difference]: Finished difference. Result has 152 places, 124 transitions, 1110 flow [2025-03-04 10:13:42,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1110, PETRI_PLACES=152, PETRI_TRANSITIONS=124} [2025-03-04 10:13:42,632 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 96 predicate places. [2025-03-04 10:13:42,632 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 124 transitions, 1110 flow [2025-03-04 10:13:42,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:42,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:42,632 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:42,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 10:13:42,632 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:42,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1362450672, now seen corresponding path program 2 times [2025-03-04 10:13:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:42,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788304542] [2025-03-04 10:13:42,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:42,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:42,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:13:42,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:13:42,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:42,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:13:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788304542] [2025-03-04 10:13:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788304542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424266712] [2025-03-04 10:13:42,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:42,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:42,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:42,775 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:42,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:13:42,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:13:42,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:13:42,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:42,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:42,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:13:42,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:13:42,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:13:43,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424266712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:43,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:43,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 10:13:43,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039054927] [2025-03-04 10:13:43,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:43,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:13:43,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:43,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:13:43,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:13:43,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:13:43,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 124 transitions, 1110 flow. Second operand has 23 states, 23 states have (on average 13.217391304347826) internal successors, (304), 23 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:43,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:43,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:13:43,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:44,460 INFO L124 PetriNetUnfolderBase]: 10126/14848 cut-off events. [2025-03-04 10:13:44,460 INFO L125 PetriNetUnfolderBase]: For 78059/78717 co-relation queries the response was YES. [2025-03-04 10:13:44,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70851 conditions, 14848 events. 10126/14848 cut-off events. For 78059/78717 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 84173 event pairs, 4159 based on Foata normal form. 118/14822 useless extension candidates. Maximal degree in co-relation 58226. Up to 5315 conditions per place. [2025-03-04 10:13:44,576 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 205 selfloop transitions, 59 changer transitions 0/276 dead transitions. [2025-03-04 10:13:44,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 276 transitions, 2975 flow [2025-03-04 10:13:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:13:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:13:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 293 transitions. [2025-03-04 10:13:44,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35515151515151516 [2025-03-04 10:13:44,578 INFO L175 Difference]: Start difference. First operand has 152 places, 124 transitions, 1110 flow. Second operand 15 states and 293 transitions. [2025-03-04 10:13:44,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 276 transitions, 2975 flow [2025-03-04 10:13:44,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 276 transitions, 2869 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:44,676 INFO L231 Difference]: Finished difference. Result has 169 places, 145 transitions, 1520 flow [2025-03-04 10:13:44,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1520, PETRI_PLACES=169, PETRI_TRANSITIONS=145} [2025-03-04 10:13:44,677 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 113 predicate places. [2025-03-04 10:13:44,677 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 145 transitions, 1520 flow [2025-03-04 10:13:44,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 13.217391304347826) internal successors, (304), 23 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:44,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:44,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:44,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 10:13:44,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:13:44,878 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:44,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash -265612494, now seen corresponding path program 1 times [2025-03-04 10:13:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:44,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072513311] [2025-03-04 10:13:44,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:44,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:13:44,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:13:44,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:44,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:45,271 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-04 10:13:45,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:45,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072513311] [2025-03-04 10:13:45,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072513311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470743875] [2025-03-04 10:13:45,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:45,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:45,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:45,273 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:45,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:13:45,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:13:45,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:13:45,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:45,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:45,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 10:13:45,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:45,413 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-04 10:13:45,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:45,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-04 10:13:45,585 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-04 10:13:45,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:45,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:45,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2025-03-04 10:13:45,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:45,937 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 258 treesize of output 234 [2025-03-04 10:13:46,446 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-04 10:13:46,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 139 [2025-03-04 10:13:46,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:46,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 174 [2025-03-04 10:13:46,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:46,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 134 [2025-03-04 10:13:46,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 178 [2025-03-04 10:13:46,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 110 [2025-03-04 10:13:46,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2025-03-04 10:13:46,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 50 [2025-03-04 10:13:46,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 211 [2025-03-04 10:13:46,717 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 10:13:46,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,725 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2025-03-04 10:13:46,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,730 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 50 [2025-03-04 10:13:46,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,746 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 295 [2025-03-04 10:13:46,751 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 10:13:46,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,760 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 143 [2025-03-04 10:13:46,765 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 10:13:46,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,772 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 10:13:46,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 1 [2025-03-04 10:13:46,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,781 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 227 [2025-03-04 10:13:46,785 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 10:13:46,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:46,791 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 211 [2025-03-04 10:13:46,795 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 10:13:46,902 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-04 10:13:46,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470743875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:46,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:46,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2025-03-04 10:13:46,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325801726] [2025-03-04 10:13:46,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:46,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:13:46,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:46,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:13:46,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:13:47,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-04 10:13:47,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 145 transitions, 1520 flow. Second operand has 26 states, 26 states have (on average 14.423076923076923) internal successors, (375), 26 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:47,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:47,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-04 10:13:47,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:48,699 INFO L124 PetriNetUnfolderBase]: 8270/12602 cut-off events. [2025-03-04 10:13:48,699 INFO L125 PetriNetUnfolderBase]: For 86487/87504 co-relation queries the response was YES. [2025-03-04 10:13:48,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62895 conditions, 12602 events. 8270/12602 cut-off events. For 86487/87504 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 74015 event pairs, 3645 based on Foata normal form. 1/12453 useless extension candidates. Maximal degree in co-relation 52256. Up to 10806 conditions per place. [2025-03-04 10:13:48,928 INFO L140 encePairwiseOnDemand]: 41/55 looper letters, 125 selfloop transitions, 53 changer transitions 37/228 dead transitions. [2025-03-04 10:13:48,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 228 transitions, 2545 flow [2025-03-04 10:13:48,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:13:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:13:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 329 transitions. [2025-03-04 10:13:48,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3518716577540107 [2025-03-04 10:13:48,929 INFO L175 Difference]: Start difference. First operand has 169 places, 145 transitions, 1520 flow. Second operand 17 states and 329 transitions. [2025-03-04 10:13:48,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 228 transitions, 2545 flow [2025-03-04 10:13:49,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 228 transitions, 2527 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-04 10:13:49,003 INFO L231 Difference]: Finished difference. Result has 191 places, 149 transitions, 1675 flow [2025-03-04 10:13:49,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1675, PETRI_PLACES=191, PETRI_TRANSITIONS=149} [2025-03-04 10:13:49,003 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 135 predicate places. [2025-03-04 10:13:49,003 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 149 transitions, 1675 flow [2025-03-04 10:13:49,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 14.423076923076923) internal successors, (375), 26 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:49,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:49,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:49,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 10:13:49,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:49,204 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:49,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1264474660, now seen corresponding path program 2 times [2025-03-04 10:13:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:49,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87354358] [2025-03-04 10:13:49,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:49,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:13:49,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:13:49,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:49,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:49,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:49,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87354358] [2025-03-04 10:13:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87354358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498730093] [2025-03-04 10:13:49,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:49,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:49,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:49,906 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:49,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:13:49,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:13:49,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:13:49,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:49,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:49,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 10:13:49,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:50,064 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-04 10:13:50,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:50,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-04 10:13:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:50,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:50,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:50,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2025-03-04 10:13:50,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:50,595 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 283 treesize of output 235 [2025-03-04 10:13:50,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:50,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 182 [2025-03-04 10:13:51,218 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:13:51,219 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:13:51,220 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 10:13:51,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:51,231 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 10:13:51,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 1 [2025-03-04 10:13:51,258 INFO L349 Elim1Store]: treesize reduction 49, result has 14.0 percent of original size [2025-03-04 10:13:51,259 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 112 treesize of output 71 [2025-03-04 10:13:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:51,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498730093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:51,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:51,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2025-03-04 10:13:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562525879] [2025-03-04 10:13:51,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:51,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:13:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:51,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:13:51,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:13:51,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:13:51,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 149 transitions, 1675 flow. Second operand has 31 states, 31 states have (on average 12.35483870967742) internal successors, (383), 31 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:51,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:51,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:13:51,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:54,052 INFO L124 PetriNetUnfolderBase]: 8473/13214 cut-off events. [2025-03-04 10:13:54,053 INFO L125 PetriNetUnfolderBase]: For 89642/90728 co-relation queries the response was YES. [2025-03-04 10:13:54,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65430 conditions, 13214 events. 8473/13214 cut-off events. For 89642/90728 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 81998 event pairs, 4971 based on Foata normal form. 13/13091 useless extension candidates. Maximal degree in co-relation 65370. Up to 11058 conditions per place. [2025-03-04 10:13:54,144 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 136 selfloop transitions, 111 changer transitions 30/290 dead transitions. [2025-03-04 10:13:54,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 290 transitions, 3397 flow [2025-03-04 10:13:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:13:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 10:13:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 417 transitions. [2025-03-04 10:13:54,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2916083916083916 [2025-03-04 10:13:54,146 INFO L175 Difference]: Start difference. First operand has 191 places, 149 transitions, 1675 flow. Second operand 26 states and 417 transitions. [2025-03-04 10:13:54,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 290 transitions, 3397 flow [2025-03-04 10:13:54,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 290 transitions, 3194 flow, removed 32 selfloop flow, removed 12 redundant places. [2025-03-04 10:13:54,255 INFO L231 Difference]: Finished difference. Result has 212 places, 198 transitions, 2392 flow [2025-03-04 10:13:54,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2392, PETRI_PLACES=212, PETRI_TRANSITIONS=198} [2025-03-04 10:13:54,256 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 156 predicate places. [2025-03-04 10:13:54,256 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 198 transitions, 2392 flow [2025-03-04 10:13:54,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 12.35483870967742) internal successors, (383), 31 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:54,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:54,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:54,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 10:13:54,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:54,457 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:54,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:54,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1641682202, now seen corresponding path program 3 times [2025-03-04 10:13:54,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:54,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885621478] [2025-03-04 10:13:54,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:13:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:54,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-03-04 10:13:54,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-03-04 10:13:54,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:13:54,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:13:54,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:54,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885621478] [2025-03-04 10:13:54,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885621478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:54,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966366962] [2025-03-04 10:13:54,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:13:54,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:54,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:54,849 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:54,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:13:54,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-03-04 10:13:54,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-03-04 10:13:54,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:13:54,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:54,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 10:13:54,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:54,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:13:55,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:55,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-04 10:13:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:55,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:55,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:55,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2025-03-04 10:13:55,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:55,433 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 112 treesize of output 104 [2025-03-04 10:13:55,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:13:55,441 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 84 treesize of output 68 [2025-03-04 10:13:55,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:55,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966366962] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:55,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:55,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2025-03-04 10:13:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981711821] [2025-03-04 10:13:55,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:55,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:13:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:55,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:13:55,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:13:55,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-04 10:13:55,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 198 transitions, 2392 flow. Second operand has 28 states, 28 states have (on average 14.464285714285714) internal successors, (405), 28 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:55,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:55,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-04 10:13:55,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:58,299 INFO L124 PetriNetUnfolderBase]: 8682/13497 cut-off events. [2025-03-04 10:13:58,300 INFO L125 PetriNetUnfolderBase]: For 109205/110197 co-relation queries the response was YES. [2025-03-04 10:13:58,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70978 conditions, 13497 events. 8682/13497 cut-off events. For 109205/110197 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 83952 event pairs, 3957 based on Foata normal form. 19/13370 useless extension candidates. Maximal degree in co-relation 70866. Up to 11302 conditions per place. [2025-03-04 10:13:58,425 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 172 selfloop transitions, 118 changer transitions 27/330 dead transitions. [2025-03-04 10:13:58,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 330 transitions, 4186 flow [2025-03-04 10:13:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:13:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:13:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 444 transitions. [2025-03-04 10:13:58,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2025-03-04 10:13:58,427 INFO L175 Difference]: Start difference. First operand has 212 places, 198 transitions, 2392 flow. Second operand 24 states and 444 transitions. [2025-03-04 10:13:58,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 330 transitions, 4186 flow [2025-03-04 10:13:58,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 330 transitions, 3939 flow, removed 38 selfloop flow, removed 12 redundant places. [2025-03-04 10:13:58,615 INFO L231 Difference]: Finished difference. Result has 232 places, 233 transitions, 2977 flow [2025-03-04 10:13:58,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2189, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2977, PETRI_PLACES=232, PETRI_TRANSITIONS=233} [2025-03-04 10:13:58,616 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 176 predicate places. [2025-03-04 10:13:58,616 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 2977 flow [2025-03-04 10:13:58,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.464285714285714) internal successors, (405), 28 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:58,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:58,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:58,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 10:13:58,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:58,817 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:58,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:58,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1276250162, now seen corresponding path program 4 times [2025-03-04 10:13:58,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:58,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006682921] [2025-03-04 10:13:58,818 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:13:58,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:58,826 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:13:58,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:13:58,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:13:58,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:59,647 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-04 10:13:59,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:59,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006682921] [2025-03-04 10:13:59,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006682921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:59,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364572804] [2025-03-04 10:13:59,647 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:13:59,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:59,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:59,649 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:59,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:13:59,705 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:13:59,724 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:13:59,724 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:13:59,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:59,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 10:13:59,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:59,730 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-04 10:13:59,747 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-04 10:13:59,770 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:13:59,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:13:59,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:14:00,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 10:14:00,088 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-04 10:14:00,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:00,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364572804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:00,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:00,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2025-03-04 10:14:00,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477455407] [2025-03-04 10:14:00,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:00,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:14:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:00,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:14:00,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:14:00,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-03-04 10:14:00,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 2977 flow. Second operand has 28 states, 28 states have (on average 12.392857142857142) internal successors, (347), 28 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:00,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:00,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-03-04 10:14:00,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:03,071 INFO L124 PetriNetUnfolderBase]: 8701/13507 cut-off events. [2025-03-04 10:14:03,071 INFO L125 PetriNetUnfolderBase]: For 120806/121826 co-relation queries the response was YES. [2025-03-04 10:14:03,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74059 conditions, 13507 events. 8701/13507 cut-off events. For 120806/121826 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 83444 event pairs, 4541 based on Foata normal form. 9/13366 useless extension candidates. Maximal degree in co-relation 73941. Up to 11538 conditions per place. [2025-03-04 10:14:03,228 INFO L140 encePairwiseOnDemand]: 41/55 looper letters, 136 selfloop transitions, 80 changer transitions 52/281 dead transitions. [2025-03-04 10:14:03,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 281 transitions, 3869 flow [2025-03-04 10:14:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:14:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:14:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 251 transitions. [2025-03-04 10:14:03,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30424242424242426 [2025-03-04 10:14:03,229 INFO L175 Difference]: Start difference. First operand has 232 places, 233 transitions, 2977 flow. Second operand 15 states and 251 transitions. [2025-03-04 10:14:03,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 281 transitions, 3869 flow [2025-03-04 10:14:03,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 281 transitions, 3751 flow, removed 27 selfloop flow, removed 9 redundant places. [2025-03-04 10:14:03,429 INFO L231 Difference]: Finished difference. Result has 236 places, 214 transitions, 2791 flow [2025-03-04 10:14:03,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2869, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2791, PETRI_PLACES=236, PETRI_TRANSITIONS=214} [2025-03-04 10:14:03,429 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 180 predicate places. [2025-03-04 10:14:03,429 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 214 transitions, 2791 flow [2025-03-04 10:14:03,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.392857142857142) internal successors, (347), 28 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:03,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:03,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:03,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:03,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 10:14:03,630 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:14:03,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:03,631 INFO L85 PathProgramCache]: Analyzing trace with hash 65414296, now seen corresponding path program 5 times [2025-03-04 10:14:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:03,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44068725] [2025-03-04 10:14:03,631 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:14:03,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:03,636 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-03-04 10:14:03,647 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:14:03,647 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:14:03,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44068725] [2025-03-04 10:14:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44068725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993698948] [2025-03-04 10:14:04,234 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:14:04,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:04,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:04,236 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:04,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:14:04,293 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-03-04 10:14:04,312 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:14:04,312 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:14:04,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:04,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:14:04,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:04,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:14:04,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-04 10:14:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:04,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:04,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:14:04,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 78 [2025-03-04 10:14:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:04,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993698948] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:04,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:04,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2025-03-04 10:14:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366020136] [2025-03-04 10:14:04,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:04,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:14:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:04,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:14:04,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:14:05,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2025-03-04 10:14:05,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 214 transitions, 2791 flow. Second operand has 31 states, 31 states have (on average 11.32258064516129) internal successors, (351), 31 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:05,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:05,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2025-03-04 10:14:05,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:07,944 INFO L124 PetriNetUnfolderBase]: 11037/16639 cut-off events. [2025-03-04 10:14:07,944 INFO L125 PetriNetUnfolderBase]: For 141731/143009 co-relation queries the response was YES. [2025-03-04 10:14:08,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90460 conditions, 16639 events. 11037/16639 cut-off events. For 141731/143009 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 99990 event pairs, 4044 based on Foata normal form. 9/15989 useless extension candidates. Maximal degree in co-relation 90360. Up to 14641 conditions per place. [2025-03-04 10:14:08,122 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 149 selfloop transitions, 67 changer transitions 64/285 dead transitions. [2025-03-04 10:14:08,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 285 transitions, 3928 flow [2025-03-04 10:14:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:14:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:14:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 283 transitions. [2025-03-04 10:14:08,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28585858585858587 [2025-03-04 10:14:08,124 INFO L175 Difference]: Start difference. First operand has 236 places, 214 transitions, 2791 flow. Second operand 18 states and 283 transitions. [2025-03-04 10:14:08,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 285 transitions, 3928 flow [2025-03-04 10:14:08,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 285 transitions, 3700 flow, removed 11 selfloop flow, removed 19 redundant places. [2025-03-04 10:14:08,435 INFO L231 Difference]: Finished difference. Result has 224 places, 192 transitions, 2501 flow [2025-03-04 10:14:08,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2567, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2501, PETRI_PLACES=224, PETRI_TRANSITIONS=192} [2025-03-04 10:14:08,435 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 168 predicate places. [2025-03-04 10:14:08,435 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 192 transitions, 2501 flow [2025-03-04 10:14:08,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.32258064516129) internal successors, (351), 31 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:08,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:08,435 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:08,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:08,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 10:14:08,636 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:14:08,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash -301010829, now seen corresponding path program 3 times [2025-03-04 10:14:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:08,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527644530] [2025-03-04 10:14:08,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:14:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:08,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 6 equivalence classes. [2025-03-04 10:14:08,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 31 statements. [2025-03-04 10:14:08,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:14:08,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 10:14:08,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:08,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527644530] [2025-03-04 10:14:08,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527644530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:08,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047173815] [2025-03-04 10:14:08,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:14:08,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:08,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:08,782 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:08,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:14:08,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 6 equivalence classes. [2025-03-04 10:14:08,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 31 statements. [2025-03-04 10:14:08,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:14:08,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:08,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 10:14:08,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:08,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:14:08,930 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:14:08,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-03-04 10:14:08,940 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:14:08,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:14:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 10:14:09,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:09,553 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 72 treesize of output 68 [2025-03-04 10:14:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 10:14:09,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047173815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:09,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:09,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-04 10:14:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306411049] [2025-03-04 10:14:09,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:09,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:14:09,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:09,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:14:09,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:14:09,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2025-03-04 10:14:09,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 192 transitions, 2501 flow. Second operand has 23 states, 23 states have (on average 11.478260869565217) internal successors, (264), 23 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:09,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:09,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2025-03-04 10:14:09,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:12,244 INFO L124 PetriNetUnfolderBase]: 10052/14788 cut-off events. [2025-03-04 10:14:12,244 INFO L125 PetriNetUnfolderBase]: For 117496/118238 co-relation queries the response was YES. [2025-03-04 10:14:12,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81361 conditions, 14788 events. 10052/14788 cut-off events. For 117496/118238 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 86952 event pairs, 1734 based on Foata normal form. 154/14797 useless extension candidates. Maximal degree in co-relation 81309. Up to 4780 conditions per place. [2025-03-04 10:14:12,525 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 240 selfloop transitions, 48 changer transitions 0/298 dead transitions. [2025-03-04 10:14:12,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 298 transitions, 4071 flow [2025-03-04 10:14:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:14:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:14:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2025-03-04 10:14:12,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3373737373737374 [2025-03-04 10:14:12,526 INFO L175 Difference]: Start difference. First operand has 224 places, 192 transitions, 2501 flow. Second operand 9 states and 167 transitions. [2025-03-04 10:14:12,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 298 transitions, 4071 flow [2025-03-04 10:14:12,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 298 transitions, 3612 flow, removed 33 selfloop flow, removed 23 redundant places. [2025-03-04 10:14:12,779 INFO L231 Difference]: Finished difference. Result has 181 places, 193 transitions, 2246 flow [2025-03-04 10:14:12,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2246, PETRI_PLACES=181, PETRI_TRANSITIONS=193} [2025-03-04 10:14:12,779 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 125 predicate places. [2025-03-04 10:14:12,779 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 193 transitions, 2246 flow [2025-03-04 10:14:12,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.478260869565217) internal successors, (264), 23 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:12,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:12,779 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:12,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:12,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 10:14:12,980 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:14:12,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash -301010827, now seen corresponding path program 1 times [2025-03-04 10:14:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:12,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130701096] [2025-03-04 10:14:12,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:12,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:12,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:14:12,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:14:12,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:12,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:14:13,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:13,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130701096] [2025-03-04 10:14:13,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130701096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:13,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715276599] [2025-03-04 10:14:13,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:13,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:13,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:13,213 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:13,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:14:13,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:14:13,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:14:13,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:13,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:13,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:14:13,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:14:13,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:13,533 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-04 10:14:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:14:13,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715276599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:13,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:13,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 26 [2025-03-04 10:14:13,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613785682] [2025-03-04 10:14:13,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:13,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 10:14:13,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:13,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 10:14:13,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:14:13,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:14:13,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 193 transitions, 2246 flow. Second operand has 27 states, 27 states have (on average 13.444444444444445) internal successors, (363), 27 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:13,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:13,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:14:13,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:17,837 INFO L124 PetriNetUnfolderBase]: 17403/25543 cut-off events. [2025-03-04 10:14:17,837 INFO L125 PetriNetUnfolderBase]: For 171749/172203 co-relation queries the response was YES. [2025-03-04 10:14:17,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132876 conditions, 25543 events. 17403/25543 cut-off events. For 171749/172203 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 161148 event pairs, 2896 based on Foata normal form. 46/25565 useless extension candidates. Maximal degree in co-relation 132833. Up to 3678 conditions per place. [2025-03-04 10:14:18,043 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 545 selfloop transitions, 94 changer transitions 0/649 dead transitions. [2025-03-04 10:14:18,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 649 transitions, 7794 flow [2025-03-04 10:14:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:14:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:14:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 479 transitions. [2025-03-04 10:14:18,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4147186147186147 [2025-03-04 10:14:18,045 INFO L175 Difference]: Start difference. First operand has 181 places, 193 transitions, 2246 flow. Second operand 21 states and 479 transitions. [2025-03-04 10:14:18,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 649 transitions, 7794 flow [2025-03-04 10:14:18,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 649 transitions, 7644 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:18,513 INFO L231 Difference]: Finished difference. Result has 198 places, 225 transitions, 2856 flow [2025-03-04 10:14:18,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2152, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2856, PETRI_PLACES=198, PETRI_TRANSITIONS=225} [2025-03-04 10:14:18,514 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 142 predicate places. [2025-03-04 10:14:18,514 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 225 transitions, 2856 flow [2025-03-04 10:14:18,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.444444444444445) internal successors, (363), 27 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:18,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:18,514 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:18,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 10:14:18,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:18,715 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:14:18,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1236711285, now seen corresponding path program 6 times [2025-03-04 10:14:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:18,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480055807] [2025-03-04 10:14:18,715 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:14:18,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:18,723 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 4 equivalence classes. [2025-03-04 10:14:18,732 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 34 statements. [2025-03-04 10:14:18,735 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:14:18,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:14:18,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:18,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480055807] [2025-03-04 10:14:18,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480055807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:18,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:18,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:14:18,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892007589] [2025-03-04 10:14:18,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:18,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:14:18,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:18,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:14:18,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:14:18,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:14:18,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 225 transitions, 2856 flow. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:18,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:18,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:14:18,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:22,721 INFO L124 PetriNetUnfolderBase]: 19380/29465 cut-off events. [2025-03-04 10:14:22,721 INFO L125 PetriNetUnfolderBase]: For 225496/226786 co-relation queries the response was YES. [2025-03-04 10:14:22,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151272 conditions, 29465 events. 19380/29465 cut-off events. For 225496/226786 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 196227 event pairs, 3280 based on Foata normal form. 157/29202 useless extension candidates. Maximal degree in co-relation 151226. Up to 23775 conditions per place. [2025-03-04 10:14:23,059 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 284 selfloop transitions, 71 changer transitions 1/368 dead transitions. [2025-03-04 10:14:23,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 368 transitions, 5078 flow [2025-03-04 10:14:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:14:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:14:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2025-03-04 10:14:23,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39454545454545453 [2025-03-04 10:14:23,060 INFO L175 Difference]: Start difference. First operand has 198 places, 225 transitions, 2856 flow. Second operand 10 states and 217 transitions. [2025-03-04 10:14:23,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 368 transitions, 5078 flow [2025-03-04 10:14:23,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 368 transitions, 5037 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:23,711 INFO L231 Difference]: Finished difference. Result has 207 places, 245 transitions, 3204 flow [2025-03-04 10:14:23,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2815, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3204, PETRI_PLACES=207, PETRI_TRANSITIONS=245} [2025-03-04 10:14:23,711 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 151 predicate places. [2025-03-04 10:14:23,711 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 245 transitions, 3204 flow [2025-03-04 10:14:23,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:23,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:23,712 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:23,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 10:14:23,712 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:14:23,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:23,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1630199441, now seen corresponding path program 7 times [2025-03-04 10:14:23,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:23,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426144762] [2025-03-04 10:14:23,713 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:14:23,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:23,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:14:23,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:14:23,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:23,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:14:23,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:23,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426144762] [2025-03-04 10:14:23,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426144762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:23,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467387831] [2025-03-04 10:14:23,808 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:14:23,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:23,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:23,810 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:23,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:14:23,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:14:23,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:14:23,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:23,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:23,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:14:23,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:14:23,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:14:24,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467387831] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:24,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:14:24,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-03-04 10:14:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887513940] [2025-03-04 10:14:24,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:24,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:24,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:24,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:24,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:14:24,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 10:14:24,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 245 transitions, 3204 flow. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:24,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:24,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 10:14:24,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand