./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.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 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:26:37,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:26:37,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:26:37,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:26:37,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:26:37,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:26:37,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:26:37,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:26:37,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:26:37,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:26:37,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:26:37,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:26:37,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:26:37,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:26:37,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:26:37,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:26:37,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:26:37,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:26:37,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:26:37,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:26:37,782 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:26:37,782 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:26:37,782 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:26:37,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:26:37,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:26:37,783 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:26:37,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:26:37,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:26:37,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:26:37,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:26:37,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:26:37,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:26:37,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:26:37,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:26:37,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:26:37,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:26:37,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:26:37,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:26:37,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:26:37,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:26:37,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:26:37,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:26:37,784 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 -> 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f [2025-03-17 14:26:38,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:26:38,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:26:38,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:26:38,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:26:38,026 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:26:38,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-17 14:26:39,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715e04f2d/df6ee56020bf48d39f5e6e6387ad074a/FLAGb49d3b5ad [2025-03-17 14:26:39,342 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:26:39,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-17 14:26:39,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715e04f2d/df6ee56020bf48d39f5e6e6387ad074a/FLAGb49d3b5ad [2025-03-17 14:26:39,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715e04f2d/df6ee56020bf48d39f5e6e6387ad074a [2025-03-17 14:26:39,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:26:39,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:26:39,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:26:39,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:26:39,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:26:39,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:39,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26048c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39, skipping insertion in model container [2025-03-17 14:26:39,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:39,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:26:39,851 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:26:39,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:26:39,869 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:26:39,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:26:39,915 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:26:39,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39 WrapperNode [2025-03-17 14:26:39,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:26:39,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:26:39,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:26:39,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:26:39,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:39,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:39,958 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 295 [2025-03-17 14:26:39,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:26:39,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:26:39,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:26:39,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:26:39,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:39,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:39,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:40,007 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 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-17 14:26:40,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:40,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:40,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:40,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:40,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:40,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:40,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:26:40,032 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:26:40,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:26:40,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:26:40,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (1/1) ... [2025-03-17 14:26:40,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:26:40,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:40,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:26:40,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:26:40,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:26:40,095 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:26:40,095 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:26:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:26:40,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:26:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:26:40,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:26:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 14:26:40,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 14:26:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:26:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:26:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:26:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:26:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:26:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:26:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:26:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:26:40,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:26:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:26:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:26:40,098 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:26:40,179 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:26:40,181 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:26:40,600 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:26:40,600 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:26:40,897 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:26:40,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:26:40,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:26:40 BoogieIcfgContainer [2025-03-17 14:26:40,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:26:40,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:26:40,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:26:40,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:26:40,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:26:39" (1/3) ... [2025-03-17 14:26:40,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acd2878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:26:40, skipping insertion in model container [2025-03-17 14:26:40,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:39" (2/3) ... [2025-03-17 14:26:40,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acd2878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:26:40, skipping insertion in model container [2025-03-17 14:26:40,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:26:40" (3/3) ... [2025-03-17 14:26:40,908 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-03-17 14:26:40,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:26:40,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-17 14:26:40,921 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:26:40,981 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 14:26:41,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-03-17 14:26:41,036 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-03-17 14:26:41,037 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:26:41,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-17 14:26:41,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-03-17 14:26:41,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-03-17 14:26:41,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:26:41,061 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;@6a427acb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:26:41,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-17 14:26:41,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:26:41,066 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:26:41,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:26:41,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:41,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:26:41,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:41,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:41,070 INFO L85 PathProgramCache]: Analyzing trace with hash 797547, now seen corresponding path program 1 times [2025-03-17 14:26:41,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710462706] [2025-03-17 14:26:41,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:41,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:26:41,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:26:41,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:41,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:41,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:41,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710462706] [2025-03-17 14:26:41,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710462706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:41,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:41,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:26:41,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183710666] [2025-03-17 14:26:41,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:41,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:26:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:41,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:26:41,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:26:41,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:41,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-17 14:26:41,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:41,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:41,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:42,877 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-03-17 14:26:42,877 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-03-17 14:26:42,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40874 conditions, 20183 events. 15159/20183 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116394 event pairs, 12544 based on Foata normal form. 1/14315 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-03-17 14:26:43,018 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-17 14:26:43,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-03-17 14:26:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:26:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:26:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-17 14:26:43,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-03-17 14:26:43,040 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-03-17 14:26:43,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-03-17 14:26:43,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 14:26:43,065 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-03-17 14:26:43,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-03-17 14:26:43,068 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-03-17 14:26:43,069 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-03-17 14:26:43,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-17 14:26:43,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:43,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:26:43,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:26:43,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash 797548, now seen corresponding path program 1 times [2025-03-17 14:26:43,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:43,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784752245] [2025-03-17 14:26:43,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:43,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:43,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:26:43,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:26:43,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:43,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:43,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784752245] [2025-03-17 14:26:43,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784752245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:43,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:43,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:26:43,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803757796] [2025-03-17 14:26:43,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:43,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:26:43,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:43,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:26:43,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:26:43,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:43,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:43,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:43,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:43,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:44,591 INFO L124 PetriNetUnfolderBase]: 15160/20186 cut-off events. [2025-03-17 14:26:44,592 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 14:26:44,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40235 conditions, 20186 events. 15160/20186 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116323 event pairs, 12544 based on Foata normal form. 0/14315 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-03-17 14:26:44,707 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-17 14:26:44,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 234 flow [2025-03-17 14:26:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-17 14:26:44,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-17 14:26:44,711 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 116 transitions. [2025-03-17 14:26:44,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 234 flow [2025-03-17 14:26:44,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:44,714 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2025-03-17 14:26:44,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2025-03-17 14:26:44,716 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-03-17 14:26:44,716 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2025-03-17 14:26:44,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:44,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:44,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:26:44,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:26:44,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:44,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash 24725220, now seen corresponding path program 1 times [2025-03-17 14:26:44,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:44,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105861708] [2025-03-17 14:26:44,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:44,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:26:44,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:26:44,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:44,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:44,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:44,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105861708] [2025-03-17 14:26:44,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105861708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:44,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:44,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:26:44,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139355578] [2025-03-17 14:26:44,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:44,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:26:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:44,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:26:44,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:26:44,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:44,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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-17 14:26:44,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:44,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:44,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:46,057 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-03-17 14:26:46,057 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 14:26:46,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40252 conditions, 20189 events. 15161/20189 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116307 event pairs, 12544 based on Foata normal form. 0/14317 useless extension candidates. Maximal degree in co-relation 40227. Up to 19691 conditions per place. [2025-03-17 14:26:46,150 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-17 14:26:46,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 263 flow [2025-03-17 14:26:46,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:26:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:26:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-17 14:26:46,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-17 14:26:46,152 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 135 transitions. [2025-03-17 14:26:46,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 263 flow [2025-03-17 14:26:46,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:26:46,154 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2025-03-17 14:26:46,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-03-17 14:26:46,154 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-17 14:26:46,154 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2025-03-17 14:26:46,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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-17 14:26:46,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:46,155 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:26:46,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:26:46,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:46,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash 766469493, now seen corresponding path program 1 times [2025-03-17 14:26:46,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:46,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759104789] [2025-03-17 14:26:46,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:46,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:46,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:26:46,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:26:46,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:46,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:46,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:46,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759104789] [2025-03-17 14:26:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759104789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:46,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433237724] [2025-03-17 14:26:46,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:46,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:46,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:46,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:46,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:26:46,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:26:46,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:26:46,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:46,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:46,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:26:46,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:46,519 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-17 14:26:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:46,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:46,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433237724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:46,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:26:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764084920] [2025-03-17 14:26:46,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:46,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:26:46,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:46,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:26:46,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:26:46,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:46,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:46,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:46,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:46,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:48,256 INFO L124 PetriNetUnfolderBase]: 15162/20191 cut-off events. [2025-03-17 14:26:48,256 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 14:26:48,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40275 conditions, 20191 events. 15162/20191 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116423 event pairs, 12544 based on Foata normal form. 0/14322 useless extension candidates. Maximal degree in co-relation 40237. Up to 19692 conditions per place. [2025-03-17 14:26:48,333 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 46 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2025-03-17 14:26:48,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 306 flow [2025-03-17 14:26:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:26:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:26:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-03-17 14:26:48,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2025-03-17 14:26:48,335 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 8 states and 183 transitions. [2025-03-17 14:26:48,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 306 flow [2025-03-17 14:26:48,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:26:48,337 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 213 flow [2025-03-17 14:26:48,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-03-17 14:26:48,337 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:26:48,337 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 213 flow [2025-03-17 14:26:48,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:48,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:48,338 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:26:48,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:26:48,538 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-17 14:26:48,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:48,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2008842719, now seen corresponding path program 1 times [2025-03-17 14:26:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:48,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913326968] [2025-03-17 14:26:48,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:48,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:48,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:26:48,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:26:48,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:48,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:48,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:48,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913326968] [2025-03-17 14:26:48,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913326968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:48,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712203534] [2025-03-17 14:26:48,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:48,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:48,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:48,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:48,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:26:48,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:26:48,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:26:48,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:48,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:48,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:26:48,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:48,786 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-17 14:26:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:48,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:49,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712203534] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:49,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:49,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:26:49,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274800096] [2025-03-17 14:26:49,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:49,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:26:49,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:49,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:26:49,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:26:49,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:49,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 213 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:49,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:49,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:49,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:50,145 INFO L124 PetriNetUnfolderBase]: 15163/20193 cut-off events. [2025-03-17 14:26:50,146 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 14:26:50,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40291 conditions, 20193 events. 15163/20193 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116193 event pairs, 12544 based on Foata normal form. 0/14324 useless extension candidates. Maximal degree in co-relation 40245. Up to 19684 conditions per place. [2025-03-17 14:26:50,227 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 40 selfloop transitions, 18 changer transitions 0/67 dead transitions. [2025-03-17 14:26:50,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 337 flow [2025-03-17 14:26:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:26:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:26:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2025-03-17 14:26:50,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2025-03-17 14:26:50,229 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 213 flow. Second operand 9 states and 204 transitions. [2025-03-17 14:26:50,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 337 flow [2025-03-17 14:26:50,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 290 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-17 14:26:50,230 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 210 flow [2025-03-17 14:26:50,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2025-03-17 14:26:50,231 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2025-03-17 14:26:50,231 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 210 flow [2025-03-17 14:26:50,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:50,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:50,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:50,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:26:50,436 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-17 14:26:50,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:50,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:50,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1950010661, now seen corresponding path program 1 times [2025-03-17 14:26:50,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:50,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529962326] [2025-03-17 14:26:50,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:50,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:50,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:26:50,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:26:50,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:50,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:50,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:50,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529962326] [2025-03-17 14:26:50,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529962326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:50,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:50,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:26:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574055466] [2025-03-17 14:26:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:50,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:26:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:50,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:26:50,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:26:50,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:26:50,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:50,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:50,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:26:50,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:51,495 INFO L124 PetriNetUnfolderBase]: 18048/24276 cut-off events. [2025-03-17 14:26:51,495 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-17 14:26:51,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48447 conditions, 24276 events. 18048/24276 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 144751 event pairs, 15126 based on Foata normal form. 630/18612 useless extension candidates. Maximal degree in co-relation 40230. Up to 19698 conditions per place. [2025-03-17 14:26:51,605 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 92 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-17 14:26:51,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 528 flow [2025-03-17 14:26:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:26:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:26:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-03-17 14:26:51,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5484848484848485 [2025-03-17 14:26:51,607 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 210 flow. Second operand 5 states and 181 transitions. [2025-03-17 14:26:51,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 528 flow [2025-03-17 14:26:51,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 475 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-17 14:26:51,608 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 216 flow [2025-03-17 14:26:51,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-03-17 14:26:51,609 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:26:51,609 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 216 flow [2025-03-17 14:26:51,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:51,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:51,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:51,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:26:51,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:51,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:51,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1953617522, now seen corresponding path program 1 times [2025-03-17 14:26:51,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:51,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607789101] [2025-03-17 14:26:51,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:51,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:51,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:26:51,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:26:51,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:51,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:26:51,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607789101] [2025-03-17 14:26:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607789101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:51,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:51,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:26:51,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502081927] [2025-03-17 14:26:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:51,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:26:51,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:51,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:26:51,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:26:51,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:51,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:51,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:51,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:51,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:52,830 INFO L124 PetriNetUnfolderBase]: 13848/18644 cut-off events. [2025-03-17 14:26:52,830 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-03-17 14:26:52,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39550 conditions, 18644 events. 13848/18644 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 106939 event pairs, 11474 based on Foata normal form. 0/14510 useless extension candidates. Maximal degree in co-relation 31373. Up to 18212 conditions per place. [2025-03-17 14:26:52,939 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 50 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2025-03-17 14:26:52,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 324 flow [2025-03-17 14:26:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:26:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:26:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-17 14:26:52,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-03-17 14:26:52,941 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 216 flow. Second operand 5 states and 126 transitions. [2025-03-17 14:26:52,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 324 flow [2025-03-17 14:26:52,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:52,943 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 219 flow [2025-03-17 14:26:52,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-03-17 14:26:52,944 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:26:52,944 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 219 flow [2025-03-17 14:26:52,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:52,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:52,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:52,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:26:52,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:52,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:52,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1866818639, now seen corresponding path program 1 times [2025-03-17 14:26:52,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:52,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086857981] [2025-03-17 14:26:52,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:52,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:26:52,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:26:52,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:52,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:53,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:53,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086857981] [2025-03-17 14:26:53,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086857981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:53,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:53,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:26:53,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336026911] [2025-03-17 14:26:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:53,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:26:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:53,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:26:53,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:26:53,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:53,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:53,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:53,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:53,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:53,877 INFO L124 PetriNetUnfolderBase]: 10167/13757 cut-off events. [2025-03-17 14:26:53,877 INFO L125 PetriNetUnfolderBase]: For 883/883 co-relation queries the response was YES. [2025-03-17 14:26:53,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29202 conditions, 13757 events. 10167/13757 cut-off events. For 883/883 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 76161 event pairs, 8266 based on Foata normal form. 0/11403 useless extension candidates. Maximal degree in co-relation 23092. Up to 13393 conditions per place. [2025-03-17 14:26:53,943 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 51 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2025-03-17 14:26:53,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 327 flow [2025-03-17 14:26:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-17 14:26:53,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-17 14:26:53,944 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 219 flow. Second operand 4 states and 108 transitions. [2025-03-17 14:26:53,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 327 flow [2025-03-17 14:26:53,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 65 transitions, 315 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:26:53,947 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 213 flow [2025-03-17 14:26:53,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2025-03-17 14:26:53,948 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-17 14:26:53,948 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 213 flow [2025-03-17 14:26:53,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:53,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:53,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:53,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:26:53,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:53,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1866818638, now seen corresponding path program 1 times [2025-03-17 14:26:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945501130] [2025-03-17 14:26:53,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:53,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:26:53,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:26:53,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:53,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:54,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:54,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945501130] [2025-03-17 14:26:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945501130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:54,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:54,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:26:54,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352857400] [2025-03-17 14:26:54,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:26:54,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:54,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:26:54,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:26:54,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:26:54,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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-17 14:26:54,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:54,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:26:54,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:54,741 INFO L124 PetriNetUnfolderBase]: 12936/17848 cut-off events. [2025-03-17 14:26:54,741 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-03-17 14:26:54,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37904 conditions, 17848 events. 12936/17848 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 105365 event pairs, 10753 based on Foata normal form. 500/16041 useless extension candidates. Maximal degree in co-relation 23114. Up to 13409 conditions per place. [2025-03-17 14:26:54,832 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 77 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-03-17 14:26:54,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 453 flow [2025-03-17 14:26:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-03-17 14:26:54,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2025-03-17 14:26:54,834 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 213 flow. Second operand 4 states and 149 transitions. [2025-03-17 14:26:54,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 453 flow [2025-03-17 14:26:54,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 93 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:54,836 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 231 flow [2025-03-17 14:26:54,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-03-17 14:26:54,837 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:26:54,837 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 231 flow [2025-03-17 14:26:54,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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-17 14:26:54,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:54,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:54,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:26:54,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:54,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:54,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1953617523, now seen corresponding path program 1 times [2025-03-17 14:26:54,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:54,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170931814] [2025-03-17 14:26:54,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:54,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:54,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:26:54,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:26:54,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:54,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:54,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:54,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170931814] [2025-03-17 14:26:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170931814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:54,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482009188] [2025-03-17 14:26:54,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:54,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:54,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:54,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:54,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:26:55,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:26:55,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:26:55,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:55,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:55,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:26:55,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:55,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:26:55,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:26:55,095 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 18 treesize of output 13 [2025-03-17 14:26:55,104 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:26:55,105 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-17 14:26:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:55,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:26:55,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482009188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:55,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:26:55,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-17 14:26:55,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098474066] [2025-03-17 14:26:55,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:55,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:26:55,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:55,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:26:55,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:26:55,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:55,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:55,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:55,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:55,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:55,687 INFO L124 PetriNetUnfolderBase]: 9642/13381 cut-off events. [2025-03-17 14:26:55,687 INFO L125 PetriNetUnfolderBase]: For 1789/1789 co-relation queries the response was YES. [2025-03-17 14:26:55,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29299 conditions, 13381 events. 9642/13381 cut-off events. For 1789/1789 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 76332 event pairs, 7905 based on Foata normal form. 0/12180 useless extension candidates. Maximal degree in co-relation 16340. Up to 12970 conditions per place. [2025-03-17 14:26:55,746 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 50 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-03-17 14:26:55,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 63 transitions, 331 flow [2025-03-17 14:26:55,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-17 14:26:55,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-17 14:26:55,747 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 231 flow. Second operand 4 states and 106 transitions. [2025-03-17 14:26:55,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 63 transitions, 331 flow [2025-03-17 14:26:55,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 63 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:26:55,749 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 226 flow [2025-03-17 14:26:55,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-03-17 14:26:55,750 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:26:55,750 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 226 flow [2025-03-17 14:26:55,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:55,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:55,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:55,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:26:55,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:55,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:55,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1771811119, now seen corresponding path program 1 times [2025-03-17 14:26:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:55,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262090695] [2025-03-17 14:26:55,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:55,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:26:55,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:26:55,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:55,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:56,088 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-17 14:26:56,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:56,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262090695] [2025-03-17 14:26:56,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262090695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:56,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64151610] [2025-03-17 14:26:56,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:56,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:56,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:56,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:56,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:26:56,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:26:56,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:26:56,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:56,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:56,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:26:56,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:56,225 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-17 14:26:56,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:26:56,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64151610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:56,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:26:56,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-17 14:26:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555179311] [2025-03-17 14:26:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:56,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:26:56,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:56,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:26:56,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:26:56,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:26:56,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:56,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:56,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:26:56,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:56,668 INFO L124 PetriNetUnfolderBase]: 7325/10281 cut-off events. [2025-03-17 14:26:56,668 INFO L125 PetriNetUnfolderBase]: For 1452/1452 co-relation queries the response was YES. [2025-03-17 14:26:56,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21975 conditions, 10281 events. 7325/10281 cut-off events. For 1452/1452 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 57537 event pairs, 5929 based on Foata normal form. 0/9935 useless extension candidates. Maximal degree in co-relation 15705. Up to 9905 conditions per place. [2025-03-17 14:26:56,708 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 45 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-03-17 14:26:56,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 61 transitions, 322 flow [2025-03-17 14:26:56,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-17 14:26:56,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-17 14:26:56,710 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 226 flow. Second operand 4 states and 112 transitions. [2025-03-17 14:26:56,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 61 transitions, 322 flow [2025-03-17 14:26:56,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:56,712 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 227 flow [2025-03-17 14:26:56,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-03-17 14:26:56,712 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2025-03-17 14:26:56,712 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 227 flow [2025-03-17 14:26:56,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:56,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:56,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:56,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:26:56,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:56,913 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:56,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1817132925, now seen corresponding path program 1 times [2025-03-17 14:26:56,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:56,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553635635] [2025-03-17 14:26:56,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:56,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:26:56,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:26:56,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:56,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:57,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553635635] [2025-03-17 14:26:57,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553635635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:57,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:57,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:26:57,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720666259] [2025-03-17 14:26:57,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:57,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:26:57,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:57,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:26:57,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:26:57,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:26:57,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:57,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:57,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:26:57,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:57,659 INFO L124 PetriNetUnfolderBase]: 8366/12217 cut-off events. [2025-03-17 14:26:57,659 INFO L125 PetriNetUnfolderBase]: For 1781/1781 co-relation queries the response was YES. [2025-03-17 14:26:57,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25816 conditions, 12217 events. 8366/12217 cut-off events. For 1781/1781 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 73694 event pairs, 881 based on Foata normal form. 558/12685 useless extension candidates. Maximal degree in co-relation 22078. Up to 6046 conditions per place. [2025-03-17 14:26:57,718 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 85 selfloop transitions, 6 changer transitions 3/103 dead transitions. [2025-03-17 14:26:57,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 103 transitions, 519 flow [2025-03-17 14:26:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:26:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:26:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2025-03-17 14:26:57,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5181818181818182 [2025-03-17 14:26:57,721 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 227 flow. Second operand 5 states and 171 transitions. [2025-03-17 14:26:57,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 103 transitions, 519 flow [2025-03-17 14:26:57,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:57,724 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 208 flow [2025-03-17 14:26:57,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2025-03-17 14:26:57,725 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-03-17 14:26:57,725 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 208 flow [2025-03-17 14:26:57,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:57,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:57,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:57,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:26:57,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:57,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1462684463, now seen corresponding path program 1 times [2025-03-17 14:26:57,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:57,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796352266] [2025-03-17 14:26:57,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:57,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:57,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 14:26:57,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:26:57,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:57,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:26:57,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:57,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796352266] [2025-03-17 14:26:57,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796352266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:57,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:57,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:26:57,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585142839] [2025-03-17 14:26:57,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:57,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:26:57,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:57,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:26:57,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:26:57,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:26:57,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:57,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:57,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:26:57,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:58,503 INFO L124 PetriNetUnfolderBase]: 8635/12293 cut-off events. [2025-03-17 14:26:58,503 INFO L125 PetriNetUnfolderBase]: For 3603/3603 co-relation queries the response was YES. [2025-03-17 14:26:58,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28113 conditions, 12293 events. 8635/12293 cut-off events. For 3603/3603 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 70525 event pairs, 1207 based on Foata normal form. 554/12801 useless extension candidates. Maximal degree in co-relation 28074. Up to 6156 conditions per place. [2025-03-17 14:26:58,571 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 97 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2025-03-17 14:26:58,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 114 transitions, 567 flow [2025-03-17 14:26:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:26:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:26:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-03-17 14:26:58,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-03-17 14:26:58,572 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 208 flow. Second operand 6 states and 204 transitions. [2025-03-17 14:26:58,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 114 transitions, 567 flow [2025-03-17 14:26:58,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 114 transitions, 551 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-17 14:26:58,577 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 235 flow [2025-03-17 14:26:58,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2025-03-17 14:26:58,577 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2025-03-17 14:26:58,577 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 235 flow [2025-03-17 14:26:58,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:58,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:58,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:58,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:26:58,578 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:58,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1674383489, now seen corresponding path program 2 times [2025-03-17 14:26:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:58,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214984261] [2025-03-17 14:26:58,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:26:58,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:58,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 14:26:58,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 35 statements. [2025-03-17 14:26:58,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:26:58,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:26:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:58,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214984261] [2025-03-17 14:26:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214984261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:58,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:58,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:26:58,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561121326] [2025-03-17 14:26:58,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:58,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:26:58,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:58,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:26:58,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:26:58,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:26:58,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:58,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:58,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:26:58,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:00,210 INFO L124 PetriNetUnfolderBase]: 20814/29083 cut-off events. [2025-03-17 14:27:00,210 INFO L125 PetriNetUnfolderBase]: For 13771/13771 co-relation queries the response was YES. [2025-03-17 14:27:00,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73752 conditions, 29083 events. 20814/29083 cut-off events. For 13771/13771 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 178204 event pairs, 4226 based on Foata normal form. 332/29150 useless extension candidates. Maximal degree in co-relation 73711. Up to 10041 conditions per place. [2025-03-17 14:27:00,377 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 114 selfloop transitions, 13 changer transitions 0/136 dead transitions. [2025-03-17 14:27:00,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 136 transitions, 725 flow [2025-03-17 14:27:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:27:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:27:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-03-17 14:27:00,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5429292929292929 [2025-03-17 14:27:00,379 INFO L175 Difference]: Start difference. First operand has 75 places, 62 transitions, 235 flow. Second operand 6 states and 215 transitions. [2025-03-17 14:27:00,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 136 transitions, 725 flow [2025-03-17 14:27:00,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 136 transitions, 715 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:00,388 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 333 flow [2025-03-17 14:27:00,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2025-03-17 14:27:00,388 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 14 predicate places. [2025-03-17 14:27:00,388 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 333 flow [2025-03-17 14:27:00,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:00,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:00,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:00,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:27:00,389 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:00,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash 67509692, now seen corresponding path program 1 times [2025-03-17 14:27:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706844517] [2025-03-17 14:27:00,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:00,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 14:27:00,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:27:00,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:00,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:00,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:00,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706844517] [2025-03-17 14:27:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706844517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:00,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693029685] [2025-03-17 14:27:00,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:00,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:00,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:00,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:00,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:27:00,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 14:27:00,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:27:00,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:00,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:00,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:27:00,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:00,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 14:27:01,061 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 5 treesize of output 3 [2025-03-17 14:27:01,065 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 10 treesize of output 8 [2025-03-17 14:27:01,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 14:27:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:01,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:01,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 14:27:01,288 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 10 treesize of output 8 [2025-03-17 14:27:01,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-03-17 14:27:01,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-03-17 14:27:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:01,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693029685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:01,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:01,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-17 14:27:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36386739] [2025-03-17 14:27:01,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:01,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 14:27:01,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:01,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 14:27:01,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-17 14:27:01,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:27:01,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 333 flow. Second operand has 18 states, 18 states have (on average 22.5) internal successors, (405), 18 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-17 14:27:01,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:01,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:27:01,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:11,098 INFO L124 PetriNetUnfolderBase]: 85436/120635 cut-off events. [2025-03-17 14:27:11,098 INFO L125 PetriNetUnfolderBase]: For 170864/170864 co-relation queries the response was YES. [2025-03-17 14:27:11,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354787 conditions, 120635 events. 85436/120635 cut-off events. For 170864/170864 co-relation queries the response was YES. Maximal size of possible extension queue 3781. Compared 871061 event pairs, 5619 based on Foata normal form. 1200/121779 useless extension candidates. Maximal degree in co-relation 218831. Up to 32895 conditions per place. [2025-03-17 14:27:12,113 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 441 selfloop transitions, 77 changer transitions 12/539 dead transitions. [2025-03-17 14:27:12,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 539 transitions, 3360 flow [2025-03-17 14:27:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 14:27:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-17 14:27:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 963 transitions. [2025-03-17 14:27:12,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5211038961038961 [2025-03-17 14:27:12,116 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 333 flow. Second operand 28 states and 963 transitions. [2025-03-17 14:27:12,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 539 transitions, 3360 flow [2025-03-17 14:27:12,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 539 transitions, 3301 flow, removed 25 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:12,244 INFO L231 Difference]: Finished difference. Result has 119 places, 144 transitions, 1079 flow [2025-03-17 14:27:12,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1079, PETRI_PLACES=119, PETRI_TRANSITIONS=144} [2025-03-17 14:27:12,245 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2025-03-17 14:27:12,245 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 144 transitions, 1079 flow [2025-03-17 14:27:12,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 22.5) internal successors, (405), 18 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-17 14:27:12,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:12,246 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:12,390 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-17 14:27:12,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:27:12,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:12,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1516162686, now seen corresponding path program 1 times [2025-03-17 14:27:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629904502] [2025-03-17 14:27:12,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:12,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 14:27:12,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 14:27:12,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:12,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:13,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629904502] [2025-03-17 14:27:13,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629904502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72080470] [2025-03-17 14:27:13,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:13,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:13,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:13,134 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:13,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:27:13,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 14:27:13,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 14:27:13,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:13,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:13,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:27:13,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:13,324 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 5 treesize of output 3 [2025-03-17 14:27:13,328 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 10 treesize of output 8 [2025-03-17 14:27:13,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-03-17 14:27:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:27:13,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:13,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:13,469 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 26 treesize of output 18 [2025-03-17 14:27:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:27:13,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72080470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:13,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:13,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 15 [2025-03-17 14:27:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008665803] [2025-03-17 14:27:13,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:13,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:27:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:13,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:27:13,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:27:13,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:27:13,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 144 transitions, 1079 flow. Second operand has 16 states, 16 states have (on average 23.25) internal successors, (372), 16 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:13,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:13,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:27:13,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand