./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-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-?-798a7b3-m [2025-03-04 10:10:31,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:10:31,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:10:31,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:10:31,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:10:31,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:10:31,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:10:31,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:10:31,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:10:31,179 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:10:31,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:10:31,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:10:31,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:10:31,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:10:31,180 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:10:31,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:10:31,181 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:10:31,182 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:10:31,182 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:10:31,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:10:31,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:10:31,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:10:31,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:10:31,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:31,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:10:31,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:10:31,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:10:31,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:10:31,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:10:31,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:10:31,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:10:31,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:10:31,183 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-04 10:10:31,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:10:31,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:10:31,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:10:31,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:10:31,424 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:10:31,426 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-04 10:10:32,564 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85af1a37e/bbcf65462bc74e089252ea72c95e5723/FLAG49802b757 [2025-03-04 10:10:32,809 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:10:32,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-04 10:10:32,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85af1a37e/bbcf65462bc74e089252ea72c95e5723/FLAG49802b757 [2025-03-04 10:10:32,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85af1a37e/bbcf65462bc74e089252ea72c95e5723 [2025-03-04 10:10:32,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:10:32,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:10:32,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:32,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:10:32,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:10:32,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:32" (1/1) ... [2025-03-04 10:10:32,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e7f772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:32, skipping insertion in model container [2025-03-04 10:10:32,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:32" (1/1) ... [2025-03-04 10:10:32,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:10:33,065 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:10:33,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:33,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:10:33,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:33,126 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:10:33,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33 WrapperNode [2025-03-04 10:10:33,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:33,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:33,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:10:33,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:10:33,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,174 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 295 [2025-03-04 10:10:33,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:33,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:10:33,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:10:33,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:10:33,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,210 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-04 10:10:33,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:10:33,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:10:33,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:10:33,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:10:33,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (1/1) ... [2025-03-04 10:10:33,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:33,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:10:33,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:10:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:10:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:10:33,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:10:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:10:33,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:10:33,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:10:33,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:10:33,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:10:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:10:33,284 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:10:33,385 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:10:33,386 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:10:33,815 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:10:33,815 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:10:34,120 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:10:34,121 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:10:34,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:34 BoogieIcfgContainer [2025-03-04 10:10:34,122 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:10:34,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:10:34,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:10:34,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:10:34,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:10:32" (1/3) ... [2025-03-04 10:10:34,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b4a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:34, skipping insertion in model container [2025-03-04 10:10:34,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:33" (2/3) ... [2025-03-04 10:10:34,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b4a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:34, skipping insertion in model container [2025-03-04 10:10:34,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:34" (3/3) ... [2025-03-04 10:10:34,132 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-03-04 10:10:34,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:10:34,146 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-04 10:10:34,147 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:10:34,222 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:10:34,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-03-04 10:10:34,289 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-03-04 10:10:34,291 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:10:34,297 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 140 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-04 10:10:34,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-03-04 10:10:34,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-03-04 10:10:34,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:10:34,318 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;@2e955718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:10:34,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 10:10:34,321 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:10:34,321 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:10:34,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:10:34,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:34,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:10:34,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:34,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash 800587, now seen corresponding path program 1 times [2025-03-04 10:10:34,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:34,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076713268] [2025-03-04 10:10:34,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:34,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:34,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:10:34,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:10:34,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:34,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:34,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:34,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076713268] [2025-03-04 10:10:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076713268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:34,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:10:34,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384240981] [2025-03-04 10:10:34,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:34,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:34,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:34,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:34,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:34,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:10:34,628 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-04 10:10:34,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:34,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:10:34,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:36,237 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-03-04 10:10:36,238 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-03-04 10:10:36,286 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 115955 event pairs, 12544 based on Foata normal form. 1/14525 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-03-04 10:10:36,410 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-04 10:10:36,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-03-04 10:10:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-04 10:10:36,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-03-04 10:10:36,431 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-03-04 10:10:36,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-03-04 10:10:36,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:10:36,560 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-03-04 10:10:36,562 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-04 10:10:36,566 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-03-04 10:10:36,566 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-03-04 10:10:36,566 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-04 10:10:36,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:36,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:10:36,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:10:36,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash 800588, now seen corresponding path program 1 times [2025-03-04 10:10:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:36,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743320778] [2025-03-04 10:10:36,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:36,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:10:36,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:10:36,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:36,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:36,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:36,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743320778] [2025-03-04 10:10:36,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743320778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:36,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:36,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:36,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582504965] [2025-03-04 10:10:36,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:36,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:36,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:36,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:36,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:36,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:10:36,856 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-04 10:10:36,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:36,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:10:36,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:38,081 INFO L124 PetriNetUnfolderBase]: 15160/20186 cut-off events. [2025-03-04 10:10:38,082 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 10:10:38,123 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 115902 event pairs, 12544 based on Foata normal form. 0/14525 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-03-04 10:10:38,196 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-04 10:10:38,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 234 flow [2025-03-04 10:10:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-04 10:10:38,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-04 10:10:38,199 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 116 transitions. [2025-03-04 10:10:38,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 234 flow [2025-03-04 10:10:38,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:38,202 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2025-03-04 10:10:38,202 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-04 10:10:38,203 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-03-04 10:10:38,203 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2025-03-04 10:10:38,203 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-04 10:10:38,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:38,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:10:38,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:10:38,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 24819526, now seen corresponding path program 1 times [2025-03-04 10:10:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:38,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719725223] [2025-03-04 10:10:38,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:38,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:10:38,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:10:38,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:38,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719725223] [2025-03-04 10:10:38,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719725223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:38,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:38,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549823164] [2025-03-04 10:10:38,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:38,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:38,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:38,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:38,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:38,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:10:38,438 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-04 10:10:38,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:38,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:10:38,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:39,703 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-03-04 10:10:39,703 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 10:10:39,725 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 115859 event pairs, 12544 based on Foata normal form. 0/14527 useless extension candidates. Maximal degree in co-relation 40227. Up to 19691 conditions per place. [2025-03-04 10:10:39,821 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-04 10:10:39,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 263 flow [2025-03-04 10:10:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-04 10:10:39,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 10:10:39,825 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 135 transitions. [2025-03-04 10:10:39,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 263 flow [2025-03-04 10:10:39,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:39,827 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2025-03-04 10:10:39,827 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-04 10:10:39,829 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-04 10:10:39,829 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2025-03-04 10:10:39,829 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-04 10:10:39,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:39,829 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:10:39,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:10:39,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:39,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash 769391090, now seen corresponding path program 1 times [2025-03-04 10:10:39,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:39,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802336883] [2025-03-04 10:10:39,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:39,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:10:39,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:10:39,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:39,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802336883] [2025-03-04 10:10:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802336883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394475234] [2025-03-04 10:10:40,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:40,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:40,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:40,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:40,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:10:40,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:10:40,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:10:40,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:40,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:40,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:10:40,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:40,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:10:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:40,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:40,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394475234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:40,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:40,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:10:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846674093] [2025-03-04 10:10:40,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:40,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:10:40,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:40,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:10:40,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:10:40,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:10:40,475 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-04 10:10:40,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:40,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:10:40,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:41,811 INFO L124 PetriNetUnfolderBase]: 15162/20191 cut-off events. [2025-03-04 10:10:41,811 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 10:10:41,825 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 115951 event pairs, 12544 based on Foata normal form. 0/14532 useless extension candidates. Maximal degree in co-relation 40237. Up to 19692 conditions per place. [2025-03-04 10:10:41,883 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 46 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2025-03-04 10:10:41,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 306 flow [2025-03-04 10:10:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-03-04 10:10:41,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2025-03-04 10:10:41,885 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 8 states and 183 transitions. [2025-03-04 10:10:41,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 306 flow [2025-03-04 10:10:41,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:41,886 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 213 flow [2025-03-04 10:10:41,886 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-04 10:10:41,887 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-04 10:10:41,887 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 213 flow [2025-03-04 10:10:41,887 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-04 10:10:41,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:41,887 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:10:41,894 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-04 10:10:42,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:42,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:42,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:42,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1918214525, now seen corresponding path program 1 times [2025-03-04 10:10:42,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:42,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521491772] [2025-03-04 10:10:42,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:42,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:42,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:10:42,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:10:42,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:42,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:42,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:42,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521491772] [2025-03-04 10:10:42,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521491772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:42,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138869346] [2025-03-04 10:10:42,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:42,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:42,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:42,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:10:42,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:10:42,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:10:42,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:42,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:42,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:10:42,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:42,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:10:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:42,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:42,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138869346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:42,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:42,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:10:42,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692097634] [2025-03-04 10:10:42,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:42,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:10:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:42,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:10:42,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:10:42,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:10:42,641 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-04 10:10:42,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:42,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:10:42,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:43,732 INFO L124 PetriNetUnfolderBase]: 15162/20190 cut-off events. [2025-03-04 10:10:43,732 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 10:10:43,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40282 conditions, 20190 events. 15162/20190 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115888 event pairs, 12544 based on Foata normal form. 0/14532 useless extension candidates. Maximal degree in co-relation 40236. Up to 19683 conditions per place. [2025-03-04 10:10:43,839 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 40 selfloop transitions, 15 changer transitions 0/64 dead transitions. [2025-03-04 10:10:43,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 319 flow [2025-03-04 10:10:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:10:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:10:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2025-03-04 10:10:43,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-03-04 10:10:43,840 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 213 flow. Second operand 7 states and 165 transitions. [2025-03-04 10:10:43,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 319 flow [2025-03-04 10:10:43,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 272 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 10:10:43,842 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 192 flow [2025-03-04 10:10:43,842 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=7, PETRI_FLOW=192, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-03-04 10:10:43,842 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-04 10:10:43,842 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 192 flow [2025-03-04 10:10:43,843 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-04 10:10:43,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:43,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:43,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:10:44,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:44,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:44,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash -752860672, now seen corresponding path program 1 times [2025-03-04 10:10:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:44,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894000911] [2025-03-04 10:10:44,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:44,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:44,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:10:44,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:10:44,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:44,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894000911] [2025-03-04 10:10:44,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894000911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:44,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744685007] [2025-03-04 10:10:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:44,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:44,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:44,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:44,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:10:44,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 192 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-04 10:10:44,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:44,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:10:44,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:45,559 INFO L124 PetriNetUnfolderBase]: 18046/24270 cut-off events. [2025-03-04 10:10:45,560 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-04 10:10:45,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48423 conditions, 24270 events. 18046/24270 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 144204 event pairs, 15126 based on Foata normal form. 630/18644 useless extension candidates. Maximal degree in co-relation 40230. Up to 19695 conditions per place. [2025-03-04 10:10:45,700 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 86 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2025-03-04 10:10:45,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 480 flow [2025-03-04 10:10:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-03-04 10:10:45,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5484848484848485 [2025-03-04 10:10:45,702 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 192 flow. Second operand 5 states and 181 transitions. [2025-03-04 10:10:45,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 480 flow [2025-03-04 10:10:45,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 439 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-04 10:10:45,706 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 204 flow [2025-03-04 10:10:45,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-03-04 10:10:45,707 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-04 10:10:45,708 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 204 flow [2025-03-04 10:10:45,709 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-04 10:10:45,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:45,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:45,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:10:45,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:45,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash 371078938, now seen corresponding path program 1 times [2025-03-04 10:10:45,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:45,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207720481] [2025-03-04 10:10:45,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:45,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:10:45,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:10:45,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:45,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:45,821 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-04 10:10:45,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:45,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207720481] [2025-03-04 10:10:45,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207720481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:45,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:45,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:45,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235687642] [2025-03-04 10:10:45,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:45,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:45,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:45,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:45,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:10:45,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 204 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-04 10:10:45,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:45,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:10:45,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:46,959 INFO L124 PetriNetUnfolderBase]: 13846/18638 cut-off events. [2025-03-04 10:10:46,959 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-03-04 10:10:46,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39532 conditions, 18638 events. 13846/18638 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 107525 event pairs, 11474 based on Foata normal form. 0/14633 useless extension candidates. Maximal degree in co-relation 31364. Up to 18210 conditions per place. [2025-03-04 10:10:47,015 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 48 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-03-04 10:10:47,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 64 transitions, 306 flow [2025-03-04 10:10:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-04 10:10:47,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-03-04 10:10:47,016 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 204 flow. Second operand 5 states and 126 transitions. [2025-03-04 10:10:47,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 64 transitions, 306 flow [2025-03-04 10:10:47,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:47,018 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 205 flow [2025-03-04 10:10:47,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2025-03-04 10:10:47,018 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-04 10:10:47,018 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 205 flow [2025-03-04 10:10:47,019 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-04 10:10:47,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:47,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:47,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:10:47,019 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:47,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:47,019 INFO L85 PathProgramCache]: Analyzing trace with hash 371078939, now seen corresponding path program 1 times [2025-03-04 10:10:47,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:47,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119215826] [2025-03-04 10:10:47,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:47,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:47,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:10:47,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:10:47,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:47,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:47,200 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-04 10:10:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119215826] [2025-03-04 10:10:47,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119215826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677930030] [2025-03-04 10:10:47,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:47,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:47,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:47,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:47,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:10:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:10:47,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:10:47,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:47,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:47,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:10:47,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:47,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:10:47,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:10:47,324 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-04 10:10:47,337 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:10:47,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:10:47,363 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-04 10:10:47,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:10:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677930030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:10:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-04 10:10:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070127286] [2025-03-04 10:10:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:47,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:47,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:47,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:10:47,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:10:47,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 205 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-04 10:10:47,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:47,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:10:47,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:47,956 INFO L124 PetriNetUnfolderBase]: 10318/13958 cut-off events. [2025-03-04 10:10:47,956 INFO L125 PetriNetUnfolderBase]: For 992/992 co-relation queries the response was YES. [2025-03-04 10:10:47,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28870 conditions, 13958 events. 10318/13958 cut-off events. For 992/992 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 77982 event pairs, 8438 based on Foata normal form. 0/11788 useless extension candidates. Maximal degree in co-relation 20658. Up to 13649 conditions per place. [2025-03-04 10:10:48,014 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 49 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-03-04 10:10:48,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 303 flow [2025-03-04 10:10:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-04 10:10:48,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 10:10:48,016 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 205 flow. Second operand 4 states and 108 transitions. [2025-03-04 10:10:48,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 303 flow [2025-03-04 10:10:48,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 62 transitions, 292 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:48,018 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 194 flow [2025-03-04 10:10:48,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-03-04 10:10:48,019 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-04 10:10:48,019 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 194 flow [2025-03-04 10:10:48,019 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-04 10:10:48,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:48,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:48,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:10:48,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:48,220 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:48,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1754012507, now seen corresponding path program 1 times [2025-03-04 10:10:48,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:48,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885547439] [2025-03-04 10:10:48,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:48,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:48,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:10:48,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:10:48,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:48,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:48,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885547439] [2025-03-04 10:10:48,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885547439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:48,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934228634] [2025-03-04 10:10:48,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:48,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:48,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:48,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:48,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:10:48,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 194 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-04 10:10:48,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:48,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:10:48,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:48,699 INFO L124 PetriNetUnfolderBase]: 7579/10306 cut-off events. [2025-03-04 10:10:48,699 INFO L125 PetriNetUnfolderBase]: For 737/737 co-relation queries the response was YES. [2025-03-04 10:10:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21330 conditions, 10306 events. 7579/10306 cut-off events. For 737/737 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 54923 event pairs, 6078 based on Foata normal form. 0/9254 useless extension candidates. Maximal degree in co-relation 15262. Up to 10036 conditions per place. [2025-03-04 10:10:48,738 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-04 10:10:48,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 292 flow [2025-03-04 10:10:48,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 10:10:48,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-04 10:10:48,739 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 194 flow. Second operand 4 states and 106 transitions. [2025-03-04 10:10:48,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 292 flow [2025-03-04 10:10:48,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:48,740 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 193 flow [2025-03-04 10:10:48,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-03-04 10:10:48,741 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-04 10:10:48,741 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 193 flow [2025-03-04 10:10:48,741 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-04 10:10:48,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:48,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:48,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:10:48,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:48,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1754012508, now seen corresponding path program 1 times [2025-03-04 10:10:48,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:48,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887621919] [2025-03-04 10:10:48,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:48,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:10:48,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:10:48,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:48,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:48,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:48,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887621919] [2025-03-04 10:10:48,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887621919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:48,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:48,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382470465] [2025-03-04 10:10:48,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:48,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:48,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:48,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:48,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:48,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:10:48,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 193 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-04 10:10:48,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:48,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:10:48,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:49,453 INFO L124 PetriNetUnfolderBase]: 9640/13375 cut-off events. [2025-03-04 10:10:49,454 INFO L125 PetriNetUnfolderBase]: For 995/995 co-relation queries the response was YES. [2025-03-04 10:10:49,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27677 conditions, 13375 events. 9640/13375 cut-off events. For 995/995 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 75948 event pairs, 7905 based on Foata normal form. 382/12914 useless extension candidates. Maximal degree in co-relation 19838. Up to 10048 conditions per place. [2025-03-04 10:10:49,501 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 70 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2025-03-04 10:10:49,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 411 flow [2025-03-04 10:10:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-03-04 10:10:49,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5492424242424242 [2025-03-04 10:10:49,502 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 193 flow. Second operand 4 states and 145 transitions. [2025-03-04 10:10:49,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 411 flow [2025-03-04 10:10:49,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:49,504 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 212 flow [2025-03-04 10:10:49,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2025-03-04 10:10:49,505 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-04 10:10:49,505 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 212 flow [2025-03-04 10:10:49,505 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-04 10:10:49,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:49,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:49,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:10:49,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:49,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1593925415, now seen corresponding path program 1 times [2025-03-04 10:10:49,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:49,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237656543] [2025-03-04 10:10:49,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:49,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:10:49,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:10:49,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:49,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:49,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:49,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237656543] [2025-03-04 10:10:49,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237656543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:49,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772002348] [2025-03-04 10:10:49,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:49,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:49,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:49,660 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:49,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:10:49,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:10:49,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:10:49,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:49,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:49,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:10:49,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:49,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:10:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772002348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:10:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 10:10:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528956519] [2025-03-04 10:10:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:49,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:49,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:49,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:10:49,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:10:49,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 212 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-04 10:10:49,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:49,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:10:49,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:50,263 INFO L124 PetriNetUnfolderBase]: 7323/10275 cut-off events. [2025-03-04 10:10:50,263 INFO L125 PetriNetUnfolderBase]: For 1453/1453 co-relation queries the response was YES. [2025-03-04 10:10:50,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21954 conditions, 10275 events. 7323/10275 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 57651 event pairs, 5929 based on Foata normal form. 0/10031 useless extension candidates. Maximal degree in co-relation 15695. Up to 9903 conditions per place. [2025-03-04 10:10:50,307 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 43 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-03-04 10:10:50,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 58 transitions, 302 flow [2025-03-04 10:10:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-04 10:10:50,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-04 10:10:50,308 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 212 flow. Second operand 4 states and 112 transitions. [2025-03-04 10:10:50,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 58 transitions, 302 flow [2025-03-04 10:10:50,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 58 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:50,311 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 211 flow [2025-03-04 10:10:50,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-03-04 10:10:50,311 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-04 10:10:50,311 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 211 flow [2025-03-04 10:10:50,311 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-04 10:10:50,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:50,311 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-04 10:10:50,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:10:50,512 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-04 10:10:50,512 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:50,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash -152366483, now seen corresponding path program 1 times [2025-03-04 10:10:50,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:50,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358391671] [2025-03-04 10:10:50,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:50,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:50,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:10:50,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:10:50,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:50,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:50,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:50,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358391671] [2025-03-04 10:10:50,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358391671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:50,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:50,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:10:50,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95222570] [2025-03-04 10:10:50,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:50,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:50,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:50,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:50,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:50,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:10:50,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 211 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-04 10:10:50,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:50,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:10:50,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:51,277 INFO L124 PetriNetUnfolderBase]: 8364/12211 cut-off events. [2025-03-04 10:10:51,277 INFO L125 PetriNetUnfolderBase]: For 1781/1781 co-relation queries the response was YES. [2025-03-04 10:10:51,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25792 conditions, 12211 events. 8364/12211 cut-off events. For 1781/1781 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 73891 event pairs, 881 based on Foata normal form. 558/12714 useless extension candidates. Maximal degree in co-relation 22066. Up to 6046 conditions per place. [2025-03-04 10:10:51,322 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 83 selfloop transitions, 5 changer transitions 3/100 dead transitions. [2025-03-04 10:10:51,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 497 flow [2025-03-04 10:10:51,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2025-03-04 10:10:51,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5181818181818182 [2025-03-04 10:10:51,323 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 211 flow. Second operand 5 states and 171 transitions. [2025-03-04 10:10:51,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 497 flow [2025-03-04 10:10:51,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:51,326 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 191 flow [2025-03-04 10:10:51,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2025-03-04 10:10:51,326 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-04 10:10:51,326 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 191 flow [2025-03-04 10:10:51,326 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-04 10:10:51,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:51,327 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-04 10:10:51,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:10:51,327 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:51,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash -48937970, now seen corresponding path program 1 times [2025-03-04 10:10:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095804422] [2025-03-04 10:10:51,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:51,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:10:51,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:10:51,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:51,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:10:51,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095804422] [2025-03-04 10:10:51,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095804422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:51,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:51,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:10:51,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892827449] [2025-03-04 10:10:51,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:51,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:51,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:51,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:51,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:51,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:10:51,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 191 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-04 10:10:51,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:51,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:10:51,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:52,350 INFO L124 PetriNetUnfolderBase]: 10767/15311 cut-off events. [2025-03-04 10:10:52,350 INFO L125 PetriNetUnfolderBase]: For 5041/5041 co-relation queries the response was YES. [2025-03-04 10:10:52,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35282 conditions, 15311 events. 10767/15311 cut-off events. For 5041/5041 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 91462 event pairs, 1207 based on Foata normal form. 554/15840 useless extension candidates. Maximal degree in co-relation 35243. Up to 9177 conditions per place. [2025-03-04 10:10:52,425 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 97 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2025-03-04 10:10:52,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 114 transitions, 568 flow [2025-03-04 10:10:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2025-03-04 10:10:52,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5176767676767676 [2025-03-04 10:10:52,427 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 191 flow. Second operand 6 states and 205 transitions. [2025-03-04 10:10:52,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 114 transitions, 568 flow [2025-03-04 10:10:52,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 114 transitions, 550 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 10:10:52,434 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 235 flow [2025-03-04 10:10:52,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2025-03-04 10:10:52,434 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-03-04 10:10:52,434 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 235 flow [2025-03-04 10:10:52,434 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-04 10:10:52,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:52,434 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-04 10:10:52,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:10:52,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:52,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1507746616, now seen corresponding path program 2 times [2025-03-04 10:10:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:52,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33514949] [2025-03-04 10:10:52,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:52,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:52,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 10:10:52,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-03-04 10:10:52,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:52,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:10:52,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33514949] [2025-03-04 10:10:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33514949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:52,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:52,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:10:52,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220757384] [2025-03-04 10:10:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:52,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:52,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:52,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:52,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:52,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:10:52,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 235 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-04 10:10:52,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:52,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:10:52,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:53,611 INFO L124 PetriNetUnfolderBase]: 13365/18880 cut-off events. [2025-03-04 10:10:53,612 INFO L125 PetriNetUnfolderBase]: For 11611/11611 co-relation queries the response was YES. [2025-03-04 10:10:53,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49947 conditions, 18880 events. 13365/18880 cut-off events. For 11611/11611 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 112161 event pairs, 618 based on Foata normal form. 466/19320 useless extension candidates. Maximal degree in co-relation 49906. Up to 7915 conditions per place. [2025-03-04 10:10:53,741 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 120 selfloop transitions, 11 changer transitions 0/140 dead transitions. [2025-03-04 10:10:53,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 140 transitions, 738 flow [2025-03-04 10:10:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2025-03-04 10:10:53,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5631313131313131 [2025-03-04 10:10:53,742 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 235 flow. Second operand 6 states and 223 transitions. [2025-03-04 10:10:53,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 140 transitions, 738 flow [2025-03-04 10:10:53,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 140 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:53,762 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 317 flow [2025-03-04 10:10:53,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2025-03-04 10:10:53,763 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2025-03-04 10:10:53,763 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 317 flow [2025-03-04 10:10:53,763 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-04 10:10:53,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:53,763 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-04 10:10:53,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:10:53,763 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:53,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash 774547924, now seen corresponding path program 1 times [2025-03-04 10:10:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:53,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725752783] [2025-03-04 10:10:53,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:53,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:53,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:10:53,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:10:53,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:53,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:54,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:54,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725752783] [2025-03-04 10:10:54,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725752783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:54,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062142657] [2025-03-04 10:10:54,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:54,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:54,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:54,190 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:54,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:10:54,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:10:54,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:10:54,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:54,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:54,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:10:54,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:54,309 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-04 10:10:54,458 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-04 10:10:54,462 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-04 10:10:54,558 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-04 10:10:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:54,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:54,661 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-04 10:10:54,665 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-04 10:10:55,063 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-04 10:10:55,069 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-04 10:10:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062142657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:55,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:55,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-04 10:10:55,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327666387] [2025-03-04 10:10:55,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:55,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:10:55,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:55,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:10:55,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:10:55,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:10:55,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 317 flow. Second operand has 18 states, 18 states have (on average 22.61111111111111) internal successors, (407), 18 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:55,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:55,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:10:55,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:58,679 INFO L124 PetriNetUnfolderBase]: 33247/47351 cut-off events. [2025-03-04 10:10:58,679 INFO L125 PetriNetUnfolderBase]: For 66072/66072 co-relation queries the response was YES. [2025-03-04 10:10:58,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143176 conditions, 47351 events. 33247/47351 cut-off events. For 66072/66072 co-relation queries the response was YES. Maximal size of possible extension queue 1963. Compared 322494 event pairs, 9212 based on Foata normal form. 3/47322 useless extension candidates. Maximal degree in co-relation 73007. Up to 18697 conditions per place. [2025-03-04 10:10:58,984 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 246 selfloop transitions, 48 changer transitions 10/313 dead transitions. [2025-03-04 10:10:58,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 313 transitions, 1993 flow [2025-03-04 10:10:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:10:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:10:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 637 transitions. [2025-03-04 10:10:58,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2025-03-04 10:10:58,986 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 317 flow. Second operand 21 states and 637 transitions. [2025-03-04 10:10:58,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 313 transitions, 1993 flow [2025-03-04 10:10:59,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 313 transitions, 1983 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-04 10:10:59,791 INFO L231 Difference]: Finished difference. Result has 105 places, 110 transitions, 826 flow [2025-03-04 10:10:59,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=826, PETRI_PLACES=105, PETRI_TRANSITIONS=110} [2025-03-04 10:10:59,792 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 37 predicate places. [2025-03-04 10:10:59,792 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 110 transitions, 826 flow [2025-03-04 10:10:59,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 22.61111111111111) internal successors, (407), 18 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:59,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:59,792 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-04 10:10:59,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:10:59,993 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-04 10:10:59,993 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:10:59,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:59,994 INFO L85 PathProgramCache]: Analyzing trace with hash 294932695, now seen corresponding path program 1 times [2025-03-04 10:10:59,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:59,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606427824] [2025-03-04 10:10:59,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:59,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:00,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:11:00,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:11:00,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:00,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:00,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:00,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606427824] [2025-03-04 10:11:00,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606427824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:00,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921957373] [2025-03-04 10:11:00,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:00,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:00,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:00,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:01,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:11:01,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:11:01,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:11:01,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:01,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:01,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:11:01,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:01,174 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-04 10:11:01,178 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-04 10:11:01,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-04 10:11:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:11:01,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:01,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:01,380 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-04 10:11:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:11:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921957373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:01,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 16 [2025-03-04 10:11:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977159615] [2025-03-04 10:11:01,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:01,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:11:01,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:01,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:11:01,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:11:01,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:11:01,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 826 flow. Second operand has 17 states, 17 states have (on average 20.941176470588236) internal successors, (356), 17 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:01,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:01,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:11:01,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:06,315 INFO L124 PetriNetUnfolderBase]: 42104/60005 cut-off events. [2025-03-04 10:11:06,315 INFO L125 PetriNetUnfolderBase]: For 132294/132294 co-relation queries the response was YES. [2025-03-04 10:11:06,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189886 conditions, 60005 events. 42104/60005 cut-off events. For 132294/132294 co-relation queries the response was YES. Maximal size of possible extension queue 2485. Compared 421893 event pairs, 2655 based on Foata normal form. 2/59908 useless extension candidates. Maximal degree in co-relation 149865. Up to 16860 conditions per place. [2025-03-04 10:11:06,693 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 180 selfloop transitions, 69 changer transitions 1/259 dead transitions. [2025-03-04 10:11:06,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 259 transitions, 2005 flow [2025-03-04 10:11:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:11:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:11:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 436 transitions. [2025-03-04 10:11:06,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2025-03-04 10:11:06,695 INFO L175 Difference]: Start difference. First operand has 105 places, 110 transitions, 826 flow. Second operand 16 states and 436 transitions. [2025-03-04 10:11:06,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 259 transitions, 2005 flow [2025-03-04 10:11:08,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 259 transitions, 1972 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:08,803 INFO L231 Difference]: Finished difference. Result has 120 places, 135 transitions, 1241 flow [2025-03-04 10:11:08,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1241, PETRI_PLACES=120, PETRI_TRANSITIONS=135} [2025-03-04 10:11:08,803 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 52 predicate places. [2025-03-04 10:11:08,803 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 135 transitions, 1241 flow [2025-03-04 10:11:08,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 20.941176470588236) internal successors, (356), 17 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:08,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:08,804 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:08,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:11:09,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:11:09,004 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:11:09,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1765358872, now seen corresponding path program 2 times [2025-03-04 10:11:09,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:09,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832279861] [2025-03-04 10:11:09,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:09,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 10:11:09,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:11:09,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:09,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:11:09,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:09,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832279861] [2025-03-04 10:11:09,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832279861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:09,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068232759] [2025-03-04 10:11:09,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:09,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:09,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:09,104 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:09,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:11:09,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 10:11:09,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:11:09,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:09,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:09,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:09,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:11:09,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:11:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068232759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:09,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:09,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 10:11:09,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902650194] [2025-03-04 10:11:09,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:09,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:11:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:09,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:11:09,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:11:09,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:11:09,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 135 transitions, 1241 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:09,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:09,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:11:09,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:18,909 INFO L124 PetriNetUnfolderBase]: 77135/109369 cut-off events. [2025-03-04 10:11:18,910 INFO L125 PetriNetUnfolderBase]: For 352155/352155 co-relation queries the response was YES. [2025-03-04 10:11:19,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359662 conditions, 109369 events. 77135/109369 cut-off events. For 352155/352155 co-relation queries the response was YES. Maximal size of possible extension queue 3810. Compared 805739 event pairs, 15403 based on Foata normal form. 1112/110261 useless extension candidates. Maximal degree in co-relation 270918. Up to 42588 conditions per place. [2025-03-04 10:11:19,650 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 160 selfloop transitions, 49 changer transitions 0/218 dead transitions. [2025-03-04 10:11:19,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 218 transitions, 2172 flow [2025-03-04 10:11:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2025-03-04 10:11:19,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-04 10:11:19,652 INFO L175 Difference]: Start difference. First operand has 120 places, 135 transitions, 1241 flow. Second operand 4 states and 168 transitions. [2025-03-04 10:11:19,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 218 transitions, 2172 flow [2025-03-04 10:11:25,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 218 transitions, 2118 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-03-04 10:11:25,128 INFO L231 Difference]: Finished difference. Result has 120 places, 150 transitions, 1616 flow [2025-03-04 10:11:25,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1616, PETRI_PLACES=120, PETRI_TRANSITIONS=150} [2025-03-04 10:11:25,129 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 52 predicate places. [2025-03-04 10:11:25,129 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 150 transitions, 1616 flow [2025-03-04 10:11:25,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:25,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:25,129 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, 1, 1, 1, 1, 1] [2025-03-04 10:11:25,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:25,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:25,330 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:11:25,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:25,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1624489705, now seen corresponding path program 1 times [2025-03-04 10:11:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:25,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16217274] [2025-03-04 10:11:25,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:25,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:11:25,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:11:25,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:25,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:11:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16217274] [2025-03-04 10:11:25,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16217274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:25,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699406126] [2025-03-04 10:11:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:25,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:25,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:25,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:25,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:11:25,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 150 transitions, 1616 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:25,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:25,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:11:25,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand