./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.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 7888761977ccc49b1a75199021e374591654c6a4364e63bfc6c86e1c7bb7d64b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:13:09,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:13:09,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:13:09,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:13:09,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:13:09,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:13:09,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:13:09,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:13:09,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:13:09,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:13:09,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:13:09,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:13:09,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:13:09,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:13:09,120 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:13:09,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:13:09,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:13:09,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:13:09,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:13:09,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:13:09,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:13:09,123 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 -> 7888761977ccc49b1a75199021e374591654c6a4364e63bfc6c86e1c7bb7d64b [2025-03-04 10:13:09,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:13:09,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:13:09,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:13:09,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:13:09,336 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:13:09,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c [2025-03-04 10:13:10,495 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f77db33f/728f94fa5dbc42ac9348d4a71e52467e/FLAG94262874b [2025-03-04 10:13:10,740 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:13:10,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c [2025-03-04 10:13:10,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f77db33f/728f94fa5dbc42ac9348d4a71e52467e/FLAG94262874b [2025-03-04 10:13:11,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f77db33f/728f94fa5dbc42ac9348d4a71e52467e [2025-03-04 10:13:11,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:13:11,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:13:11,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:13:11,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:13:11,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:13:11,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762996bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11, skipping insertion in model container [2025-03-04 10:13:11,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:13:11,223 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:13:11,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:13:11,237 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:13:11,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:13:11,283 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:13:11,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11 WrapperNode [2025-03-04 10:13:11,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:13:11,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:13:11,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:13:11,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:13:11,289 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:13:11" (1/1) ... [2025-03-04 10:13:11,297 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:13:11" (1/1) ... [2025-03-04 10:13:11,313 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 280 [2025-03-04 10:13:11,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:13:11,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:13:11,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:13:11,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:13:11,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,336 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:13:11,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:13:11,348 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:13:11,348 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:13:11,348 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:13:11,349 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (1/1) ... [2025-03-04 10:13:11,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:13:11,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:11,379 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:13:11,384 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:13:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:13:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:13:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:13:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:13:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:13:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:13:11,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:13:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:13:11,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:13:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:13:11,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:13:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:13:11,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:13:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:13:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:13:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:13:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:13:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:13:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:13:11,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:13:11,401 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:13:11,484 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:13:11,485 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:13:11,785 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:13:11,786 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:13:12,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:13:12,000 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:13:12,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:13:12 BoogieIcfgContainer [2025-03-04 10:13:12,001 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:13:12,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:13:12,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:13:12,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:13:12,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:13:11" (1/3) ... [2025-03-04 10:13:12,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d6f7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:13:12, skipping insertion in model container [2025-03-04 10:13:12,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:11" (2/3) ... [2025-03-04 10:13:12,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d6f7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:13:12, skipping insertion in model container [2025-03-04 10:13:12,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:13:12" (3/3) ... [2025-03-04 10:13:12,007 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult3.wvr.c [2025-03-04 10:13:12,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:13:12,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult3.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-04 10:13:12,019 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:13:12,075 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:13:12,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-03-04 10:13:12,129 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-03-04 10:13:12,131 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:13:12,134 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 7. Compared 146 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:13:12,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-03-04 10:13:12,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-03-04 10:13:12,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:13:12,152 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;@12acb8e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:13:12,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 10:13:12,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:13:12,157 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:13:12,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:13:12,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:12,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:13:12,158 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:13:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash 771190, now seen corresponding path program 1 times [2025-03-04 10:13:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119293217] [2025-03-04 10:13:12,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:12,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:12,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:13:12,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:13:12,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:12,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:12,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:12,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119293217] [2025-03-04 10:13:12,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119293217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:12,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:12,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:13:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584903685] [2025-03-04 10:13:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:12,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:12,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:12,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:12,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:12,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:13:12,398 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:13:12,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:12,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:13:12,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:13,925 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-03-04 10:13:13,926 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2025-03-04 10:13:13,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40874 conditions, 20183 events. 15159/20183 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 116350 event pairs, 12544 based on Foata normal form. 1/14567 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-03-04 10:13:14,046 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-04 10:13:14,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-03-04 10:13:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-04 10:13:14,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-03-04 10:13:14,060 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:13:14,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-03-04 10:13:14,153 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:13:14,155 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-03-04 10:13:14,158 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:13:14,161 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-03-04 10:13:14,161 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-03-04 10:13:14,161 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:13:14,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:14,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:13:14,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:13:14,162 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:13:14,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash 771191, now seen corresponding path program 1 times [2025-03-04 10:13:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022254423] [2025-03-04 10:13:14,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:14,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:13:14,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:13:14,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:14,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:14,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:14,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022254423] [2025-03-04 10:13:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022254423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999541706] [2025-03-04 10:13:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:14,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:14,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:14,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:14,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:13:14,468 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:13:14,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:14,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:13:14,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:15,691 INFO L124 PetriNetUnfolderBase]: 15160/20186 cut-off events. [2025-03-04 10:13:15,692 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 10:13:15,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40235 conditions, 20186 events. 15160/20186 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 116362 event pairs, 12544 based on Foata normal form. 0/14567 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-03-04 10:13:15,784 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-04 10:13:15,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 234 flow [2025-03-04 10:13:15,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-04 10:13:15,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-04 10:13:15,786 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:13:15,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 234 flow [2025-03-04 10:13:15,786 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:13:15,787 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2025-03-04 10:13:15,787 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:13:15,788 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-03-04 10:13:15,788 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2025-03-04 10:13:15,788 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:13:15,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:15,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:13:15,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:13:15,788 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:13:15,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash 23909056, now seen corresponding path program 1 times [2025-03-04 10:13:15,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:15,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42897123] [2025-03-04 10:13:15,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:15,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:13:15,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:13:15,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:15,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:15,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:15,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42897123] [2025-03-04 10:13:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42897123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:15,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:15,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803394924] [2025-03-04 10:13:15,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:15,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:15,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:15,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:15,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:16,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:13:16,013 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:13:16,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:16,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:13:16,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:17,124 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-03-04 10:13:17,124 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 10:13:17,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40252 conditions, 20189 events. 15161/20189 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 116310 event pairs, 12544 based on Foata normal form. 0/14569 useless extension candidates. Maximal degree in co-relation 40227. Up to 19691 conditions per place. [2025-03-04 10:13:17,213 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-04 10:13:17,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 263 flow [2025-03-04 10:13:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-04 10:13:17,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 10:13:17,218 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:13:17,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 263 flow [2025-03-04 10:13:17,219 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:13:17,220 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2025-03-04 10:13:17,220 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:13:17,220 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-04 10:13:17,220 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2025-03-04 10:13:17,221 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:13:17,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:17,221 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:13:17,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:13:17,221 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:13:17,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 741139045, now seen corresponding path program 1 times [2025-03-04 10:13:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:17,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675680592] [2025-03-04 10:13:17,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:17,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:13:17,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:13:17,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:17,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:17,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675680592] [2025-03-04 10:13:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675680592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600979752] [2025-03-04 10:13:17,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:17,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:17,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:17,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:17,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:13:17,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:13:17,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:13:17,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:17,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:17,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:13:17,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:17,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:13:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:17,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:17,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600979752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:17,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:17,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:13:17,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103331090] [2025-03-04 10:13:17,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:17,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:13:17,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:17,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:13:17,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:13:17,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:13:17,861 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:13:17,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:17,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:13:17,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:19,136 INFO L124 PetriNetUnfolderBase]: 15161/20188 cut-off events. [2025-03-04 10:13:19,136 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 10:13:19,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40265 conditions, 20188 events. 15161/20188 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 116385 event pairs, 12544 based on Foata normal form. 0/14571 useless extension candidates. Maximal degree in co-relation 40237. Up to 19691 conditions per place. [2025-03-04 10:13:19,219 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 46 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2025-03-04 10:13:19,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 285 flow [2025-03-04 10:13:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:13:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:13:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-03-04 10:13:19,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2025-03-04 10:13:19,221 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 6 states and 147 transitions. [2025-03-04 10:13:19,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 285 flow [2025-03-04 10:13:19,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:19,222 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 192 flow [2025-03-04 10:13:19,222 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=6, PETRI_FLOW=192, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-03-04 10:13:19,223 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-04 10:13:19,223 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 192 flow [2025-03-04 10:13:19,223 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:13:19,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:19,223 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:13:19,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:19,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:19,428 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:13:19,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:19,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1501790698, now seen corresponding path program 1 times [2025-03-04 10:13:19,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:19,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020380069] [2025-03-04 10:13:19,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:19,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:19,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:13:19,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:13:19,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:19,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:19,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020380069] [2025-03-04 10:13:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020380069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975547603] [2025-03-04 10:13:19,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:19,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:19,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:19,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:13:19,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:13:19,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:13:19,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:19,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:19,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:13:19,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:19,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:13:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:19,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:19,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975547603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:19,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:19,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:13:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850552141] [2025-03-04 10:13:19,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:19,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:13:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:19,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:13:19,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:13:19,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:13:19,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 192 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:13:19,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:19,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:13:19,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:21,090 INFO L124 PetriNetUnfolderBase]: 15163/20193 cut-off events. [2025-03-04 10:13:21,090 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-04 10:13:21,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40291 conditions, 20193 events. 15163/20193 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 116203 event pairs, 12544 based on Foata normal form. 0/14576 useless extension candidates. Maximal degree in co-relation 40245. Up to 19684 conditions per place. [2025-03-04 10:13:21,191 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 40 selfloop transitions, 18 changer transitions 0/67 dead transitions. [2025-03-04 10:13:21,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 337 flow [2025-03-04 10:13:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:13:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:13:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2025-03-04 10:13:21,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2025-03-04 10:13:21,193 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 192 flow. Second operand 9 states and 204 transitions. [2025-03-04 10:13:21,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 337 flow [2025-03-04 10:13:21,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 290 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 10:13:21,195 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 210 flow [2025-03-04 10:13:21,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2025-03-04 10:13:21,196 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-04 10:13:21,196 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 210 flow [2025-03-04 10:13:21,196 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:13:21,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:21,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:21,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:13:21,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:21,398 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:13:21,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash 218870391, now seen corresponding path program 1 times [2025-03-04 10:13:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955243215] [2025-03-04 10:13:21,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:21,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:21,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:13:21,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:13:21,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:21,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:21,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955243215] [2025-03-04 10:13:21,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955243215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:21,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:21,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:21,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631724082] [2025-03-04 10:13:21,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:21,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:21,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:21,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:21,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:21,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:13:21,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:21,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:21,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:13:21,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:22,639 INFO L124 PetriNetUnfolderBase]: 18048/24276 cut-off events. [2025-03-04 10:13:22,639 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-04 10:13:22,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48447 conditions, 24276 events. 18048/24276 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 1243. Compared 145004 event pairs, 15126 based on Foata normal form. 633/18658 useless extension candidates. Maximal degree in co-relation 40230. Up to 19698 conditions per place. [2025-03-04 10:13:22,758 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 94 selfloop transitions, 3 changer transitions 0/106 dead transitions. [2025-03-04 10:13:22,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 528 flow [2025-03-04 10:13:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-03-04 10:13:22,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-04 10:13:22,759 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 210 flow. Second operand 4 states and 160 transitions. [2025-03-04 10:13:22,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 528 flow [2025-03-04 10:13:22,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 106 transitions, 475 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:22,761 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 196 flow [2025-03-04 10:13:22,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2025-03-04 10:13:22,762 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-04 10:13:22,762 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 196 flow [2025-03-04 10:13:22,762 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:13:22,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:22,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:22,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:13:22,762 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:13:22,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:22,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1614158153, now seen corresponding path program 1 times [2025-03-04 10:13:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:22,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475863236] [2025-03-04 10:13:22,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:22,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:22,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:13:22,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:13:22,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:22,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:22,858 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:13:22,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475863236] [2025-03-04 10:13:22,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475863236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:22,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:22,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:22,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752582552] [2025-03-04 10:13:22,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:22,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:22,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:22,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:22,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:22,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:13:22,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 196 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:13:22,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:22,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:13:22,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:24,110 INFO L124 PetriNetUnfolderBase]: 13848/18644 cut-off events. [2025-03-04 10:13:24,110 INFO L125 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2025-03-04 10:13:24,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39543 conditions, 18644 events. 13848/18644 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 107310 event pairs, 11474 based on Foata normal form. 0/14697 useless extension candidates. Maximal degree in co-relation 31371. Up to 18212 conditions per place. [2025-03-04 10:13:24,163 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 49 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-03-04 10:13:24,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 300 flow [2025-03-04 10:13:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-04 10:13:24,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-03-04 10:13:24,164 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 196 flow. Second operand 5 states and 126 transitions. [2025-03-04 10:13:24,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 300 flow [2025-03-04 10:13:24,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:24,166 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 197 flow [2025-03-04 10:13:24,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2025-03-04 10:13:24,167 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-04 10:13:24,167 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 197 flow [2025-03-04 10:13:24,167 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:13:24,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:24,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:24,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:13:24,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:24,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1742262789, now seen corresponding path program 1 times [2025-03-04 10:13:24,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:24,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290960454] [2025-03-04 10:13:24,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:24,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:24,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:13:24,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:13:24,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:24,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:24,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290960454] [2025-03-04 10:13:24,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290960454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:24,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:24,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596563467] [2025-03-04 10:13:24,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:24,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:24,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:24,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:24,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:24,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:13:24,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 197 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:13:24,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:24,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:13:24,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:25,194 INFO L124 PetriNetUnfolderBase]: 16617/22735 cut-off events. [2025-03-04 10:13:25,195 INFO L125 PetriNetUnfolderBase]: For 1492/1492 co-relation queries the response was YES. [2025-03-04 10:13:25,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48250 conditions, 22735 events. 16617/22735 cut-off events. For 1492/1492 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 137348 event pairs, 13961 based on Foata normal form. 500/19275 useless extension candidates. Maximal degree in co-relation 31326. Up to 18228 conditions per place. [2025-03-04 10:13:25,272 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 79 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2025-03-04 10:13:25,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 437 flow [2025-03-04 10:13:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2025-03-04 10:13:25,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2025-03-04 10:13:25,273 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 197 flow. Second operand 4 states and 153 transitions. [2025-03-04 10:13:25,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 437 flow [2025-03-04 10:13:25,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 426 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:25,275 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 209 flow [2025-03-04 10:13:25,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-04 10:13:25,275 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-04 10:13:25,275 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 209 flow [2025-03-04 10:13:25,276 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:13:25,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:25,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:25,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:13:25,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:25,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1614158154, now seen corresponding path program 1 times [2025-03-04 10:13:25,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:25,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319157031] [2025-03-04 10:13:25,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:25,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:13:25,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:13:25,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:25,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:25,425 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:13:25,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:25,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319157031] [2025-03-04 10:13:25,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319157031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:25,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:25,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077759168] [2025-03-04 10:13:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:25,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:25,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:25,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:25,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:25,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:13:25,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 209 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:13:25,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:25,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:13:25,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:26,135 INFO L124 PetriNetUnfolderBase]: 12381/17033 cut-off events. [2025-03-04 10:13:26,135 INFO L125 PetriNetUnfolderBase]: For 2156/2156 co-relation queries the response was YES. [2025-03-04 10:13:26,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38014 conditions, 17033 events. 12381/17033 cut-off events. For 2156/2156 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 99681 event pairs, 10265 based on Foata normal form. 0/14883 useless extension candidates. Maximal degree in co-relation 22559. Up to 16572 conditions per place. [2025-03-04 10:13:26,210 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 50 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-03-04 10:13:26,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 309 flow [2025-03-04 10:13:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-04 10:13:26,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 10:13:26,211 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 209 flow. Second operand 4 states and 108 transitions. [2025-03-04 10:13:26,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 309 flow [2025-03-04 10:13:26,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:26,216 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 205 flow [2025-03-04 10:13:26,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-03-04 10:13:26,216 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-04 10:13:26,216 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 205 flow [2025-03-04 10:13:26,217 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:13:26,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:26,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:26,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:13:26,217 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:13:26,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash 402937253, now seen corresponding path program 1 times [2025-03-04 10:13:26,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:26,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267115298] [2025-03-04 10:13:26,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:26,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:26,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:13:26,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:13:26,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:26,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267115298] [2025-03-04 10:13:26,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267115298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922939202] [2025-03-04 10:13:26,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:26,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:26,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:26,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:26,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:13:26,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:13:26,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:13:26,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:26,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:26,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:13:26,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:26,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:13:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922939202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:26,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:13:26,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 10:13:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154556277] [2025-03-04 10:13:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:26,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:26,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:26,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:26,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:13:26,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:13:26,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 205 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:13:26,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:26,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:13:26,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:27,010 INFO L124 PetriNetUnfolderBase]: 9642/13381 cut-off events. [2025-03-04 10:13:27,010 INFO L125 PetriNetUnfolderBase]: For 1781/1781 co-relation queries the response was YES. [2025-03-04 10:13:27,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29288 conditions, 13381 events. 9642/13381 cut-off events. For 1781/1781 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 76650 event pairs, 7905 based on Foata normal form. 0/12298 useless extension candidates. Maximal degree in co-relation 20923. Up to 12955 conditions per place. [2025-03-04 10:13:27,060 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 46 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2025-03-04 10:13:27,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 301 flow [2025-03-04 10:13:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-04 10:13:27,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-04 10:13:27,061 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 205 flow. Second operand 4 states and 114 transitions. [2025-03-04 10:13:27,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 301 flow [2025-03-04 10:13:27,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:27,063 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 204 flow [2025-03-04 10:13:27,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-03-04 10:13:27,064 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-04 10:13:27,064 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 204 flow [2025-03-04 10:13:27,064 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:13:27,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:27,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:27,070 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:13:27,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:27,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:27,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:27,265 INFO L85 PathProgramCache]: Analyzing trace with hash 402937252, now seen corresponding path program 1 times [2025-03-04 10:13:27,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:27,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350869833] [2025-03-04 10:13:27,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:27,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:13:27,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:13:27,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:27,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:27,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:27,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350869833] [2025-03-04 10:13:27,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350869833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:27,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:27,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:27,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168513467] [2025-03-04 10:13:27,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:27,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:27,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:27,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:27,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:27,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:13:27,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:27,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:27,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:13:27,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:27,718 INFO L124 PetriNetUnfolderBase]: 7325/10281 cut-off events. [2025-03-04 10:13:27,718 INFO L125 PetriNetUnfolderBase]: For 1446/1446 co-relation queries the response was YES. [2025-03-04 10:13:27,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21970 conditions, 10281 events. 7325/10281 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 57308 event pairs, 5929 based on Foata normal form. 0/10069 useless extension candidates. Maximal degree in co-relation 15703. Up to 9905 conditions per place. [2025-03-04 10:13:27,757 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 46 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-03-04 10:13:27,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 296 flow [2025-03-04 10:13:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-04 10:13:27,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-04 10:13:27,758 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 204 flow. Second operand 4 states and 104 transitions. [2025-03-04 10:13:27,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 296 flow [2025-03-04 10:13:27,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:27,760 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 195 flow [2025-03-04 10:13:27,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-03-04 10:13:27,761 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-04 10:13:27,761 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 195 flow [2025-03-04 10:13:27,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:27,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:27,761 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:13:27,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:13:27,761 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:13:27,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1237469583, now seen corresponding path program 1 times [2025-03-04 10:13:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040351417] [2025-03-04 10:13:27,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:27,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:13:27,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:13:27,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:27,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:27,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:27,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040351417] [2025-03-04 10:13:27,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040351417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:27,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:27,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:27,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601699601] [2025-03-04 10:13:27,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:27,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:27,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:27,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:27,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:27,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:13:27,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:13:27,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:27,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:13:27,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:28,586 INFO L124 PetriNetUnfolderBase]: 10490/14942 cut-off events. [2025-03-04 10:13:28,586 INFO L125 PetriNetUnfolderBase]: For 2435/2435 co-relation queries the response was YES. [2025-03-04 10:13:28,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31844 conditions, 14942 events. 10490/14942 cut-off events. For 2435/2435 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 87892 event pairs, 4096 based on Foata normal form. 4/14752 useless extension candidates. Maximal degree in co-relation 23677. Up to 7677 conditions per place. [2025-03-04 10:13:28,645 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 69 selfloop transitions, 3 changer transitions 1/82 dead transitions. [2025-03-04 10:13:28,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 400 flow [2025-03-04 10:13:28,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-04 10:13:28,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2025-03-04 10:13:28,646 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 195 flow. Second operand 3 states and 116 transitions. [2025-03-04 10:13:28,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 400 flow [2025-03-04 10:13:28,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:28,649 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 213 flow [2025-03-04 10:13:28,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-03-04 10:13:28,649 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-04 10:13:28,649 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 213 flow [2025-03-04 10:13:28,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:13:28,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:28,649 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] [2025-03-04 10:13:28,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:13:28,650 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:13:28,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash -400618239, now seen corresponding path program 1 times [2025-03-04 10:13:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:28,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416548105] [2025-03-04 10:13:28,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:28,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:13:28,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:13:28,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:28,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:28,704 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:13:28,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:28,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416548105] [2025-03-04 10:13:28,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416548105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:28,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:28,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:28,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528191640] [2025-03-04 10:13:28,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:28,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:28,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:28,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:28,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:28,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:13:28,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:28,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:28,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:13:28,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:29,467 INFO L124 PetriNetUnfolderBase]: 13124/18878 cut-off events. [2025-03-04 10:13:29,467 INFO L125 PetriNetUnfolderBase]: For 6982/6982 co-relation queries the response was YES. [2025-03-04 10:13:29,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42371 conditions, 18878 events. 13124/18878 cut-off events. For 6982/6982 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 116680 event pairs, 6345 based on Foata normal form. 248/19020 useless extension candidates. Maximal degree in co-relation 32493. Up to 9225 conditions per place. [2025-03-04 10:13:29,544 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 75 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-03-04 10:13:29,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 438 flow [2025-03-04 10:13:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:29,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-03-04 10:13:29,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-03-04 10:13:29,545 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 213 flow. Second operand 3 states and 117 transitions. [2025-03-04 10:13:29,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 438 flow [2025-03-04 10:13:29,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 86 transitions, 434 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:29,550 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 224 flow [2025-03-04 10:13:29,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-03-04 10:13:29,550 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-04 10:13:29,550 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 224 flow [2025-03-04 10:13:29,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:29,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:29,550 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] [2025-03-04 10:13:29,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:13:29,551 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:13:29,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash 204797277, now seen corresponding path program 1 times [2025-03-04 10:13:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:29,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792870310] [2025-03-04 10:13:29,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:29,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:29,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:13:29,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:13:29,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:29,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792870310] [2025-03-04 10:13:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792870310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701316168] [2025-03-04 10:13:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:29,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:29,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:29,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:29,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-04 10:13:29,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:29,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:29,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-04 10:13:29,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:30,542 INFO L124 PetriNetUnfolderBase]: 15698/22709 cut-off events. [2025-03-04 10:13:30,542 INFO L125 PetriNetUnfolderBase]: For 10300/10300 co-relation queries the response was YES. [2025-03-04 10:13:30,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51850 conditions, 22709 events. 15698/22709 cut-off events. For 10300/10300 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 142799 event pairs, 7548 based on Foata normal form. 477/23108 useless extension candidates. Maximal degree in co-relation 41564. Up to 11266 conditions per place. [2025-03-04 10:13:30,640 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 79 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-03-04 10:13:30,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 90 transitions, 472 flow [2025-03-04 10:13:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-03-04 10:13:30,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.601010101010101 [2025-03-04 10:13:30,641 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 224 flow. Second operand 3 states and 119 transitions. [2025-03-04 10:13:30,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 90 transitions, 472 flow [2025-03-04 10:13:30,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 90 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:30,646 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 236 flow [2025-03-04 10:13:30,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-03-04 10:13:30,646 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-04 10:13:30,646 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 236 flow [2025-03-04 10:13:30,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:30,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:30,646 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:13:30,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:13:30,647 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:13:30,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1157281600, now seen corresponding path program 1 times [2025-03-04 10:13:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:30,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787023928] [2025-03-04 10:13:30,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:30,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:30,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:13:30,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:13:30,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:30,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:30,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:30,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787023928] [2025-03-04 10:13:30,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787023928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:30,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:30,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:13:30,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606036823] [2025-03-04 10:13:30,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:30,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:13:30,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:30,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:13:30,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:13:30,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-04 10:13:30,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:30,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:30,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-04 10:13:30,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:32,505 INFO L124 PetriNetUnfolderBase]: 23887/33928 cut-off events. [2025-03-04 10:13:32,505 INFO L125 PetriNetUnfolderBase]: For 17549/17549 co-relation queries the response was YES. [2025-03-04 10:13:32,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81460 conditions, 33928 events. 23887/33928 cut-off events. For 17549/17549 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 214322 event pairs, 2658 based on Foata normal form. 1169/33397 useless extension candidates. Maximal degree in co-relation 66568. Up to 16376 conditions per place. [2025-03-04 10:13:32,707 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 159 selfloop transitions, 14 changer transitions 8/189 dead transitions. [2025-03-04 10:13:32,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 189 transitions, 968 flow [2025-03-04 10:13:32,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:13:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:13:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 313 transitions. [2025-03-04 10:13:32,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5269360269360269 [2025-03-04 10:13:32,709 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 236 flow. Second operand 9 states and 313 transitions. [2025-03-04 10:13:32,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 189 transitions, 968 flow [2025-03-04 10:13:32,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 189 transitions, 965 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:32,718 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 354 flow [2025-03-04 10:13:32,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=354, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2025-03-04 10:13:32,719 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 17 predicate places. [2025-03-04 10:13:32,719 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 354 flow [2025-03-04 10:13:32,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:32,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:32,719 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:13:32,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:13:32,719 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:13:32,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1029131516, now seen corresponding path program 2 times [2025-03-04 10:13:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283913286] [2025-03-04 10:13:32,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:32,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:13:32,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:13:32,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:32,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:32,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:32,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283913286] [2025-03-04 10:13:32,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283913286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:32,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:32,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:13:32,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907959438] [2025-03-04 10:13:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:32,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:13:32,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:32,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:13:32,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:13:32,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-04 10:13:32,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:32,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:32,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-04 10:13:32,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:34,820 INFO L124 PetriNetUnfolderBase]: 24931/36520 cut-off events. [2025-03-04 10:13:34,820 INFO L125 PetriNetUnfolderBase]: For 49788/49788 co-relation queries the response was YES. [2025-03-04 10:13:34,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105909 conditions, 36520 events. 24931/36520 cut-off events. For 49788/49788 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 248076 event pairs, 3000 based on Foata normal form. 304/36798 useless extension candidates. Maximal degree in co-relation 84154. Up to 19586 conditions per place. [2025-03-04 10:13:35,073 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 146 selfloop transitions, 10 changer transitions 10/174 dead transitions. [2025-03-04 10:13:35,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 174 transitions, 1087 flow [2025-03-04 10:13:35,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:13:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:13:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2025-03-04 10:13:35,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5631313131313131 [2025-03-04 10:13:35,074 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 354 flow. Second operand 6 states and 223 transitions. [2025-03-04 10:13:35,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 174 transitions, 1087 flow [2025-03-04 10:13:35,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 174 transitions, 1087 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:13:35,194 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 399 flow [2025-03-04 10:13:35,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2025-03-04 10:13:35,195 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 25 predicate places. [2025-03-04 10:13:35,195 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 399 flow [2025-03-04 10:13:35,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:35,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:35,195 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:13:35,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:13:35,196 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:13:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1706765242, now seen corresponding path program 3 times [2025-03-04 10:13:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243717368] [2025-03-04 10:13:35,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:13:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:35,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:13:35,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:13:35,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:13:35,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:35,427 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:13:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:35,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243717368] [2025-03-04 10:13:35,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243717368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:35,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:35,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:13:35,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256157166] [2025-03-04 10:13:35,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:35,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:13:35,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:35,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:13:35,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:13:35,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-04 10:13:35,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 399 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:35,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:35,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-04 10:13:35,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:40,085 INFO L124 PetriNetUnfolderBase]: 42692/61536 cut-off events. [2025-03-04 10:13:40,085 INFO L125 PetriNetUnfolderBase]: For 107844/107848 co-relation queries the response was YES. [2025-03-04 10:13:40,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193518 conditions, 61536 events. 42692/61536 cut-off events. For 107844/107848 co-relation queries the response was YES. Maximal size of possible extension queue 1976. Compared 432333 event pairs, 5401 based on Foata normal form. 1343/62837 useless extension candidates. Maximal degree in co-relation 158048. Up to 20286 conditions per place. [2025-03-04 10:13:40,524 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 245 selfloop transitions, 58 changer transitions 2/313 dead transitions. [2025-03-04 10:13:40,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 313 transitions, 2068 flow [2025-03-04 10:13:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:13:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:13:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 441 transitions. [2025-03-04 10:13:40,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5568181818181818 [2025-03-04 10:13:40,526 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 399 flow. Second operand 12 states and 441 transitions. [2025-03-04 10:13:40,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 313 transitions, 2068 flow [2025-03-04 10:13:40,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 313 transitions, 2041 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:40,969 INFO L231 Difference]: Finished difference. Result has 111 places, 127 transitions, 947 flow [2025-03-04 10:13:40,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=947, PETRI_PLACES=111, PETRI_TRANSITIONS=127} [2025-03-04 10:13:40,970 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2025-03-04 10:13:40,970 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 127 transitions, 947 flow [2025-03-04 10:13:40,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:40,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:40,970 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:13:40,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:13:40,970 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:13:40,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash 559689140, now seen corresponding path program 4 times [2025-03-04 10:13:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:40,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033421506] [2025-03-04 10:13:40,971 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:13:40,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:40,978 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:13:40,987 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:13:40,988 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:13:40,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:41,223 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:13:41,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:41,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033421506] [2025-03-04 10:13:41,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033421506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:41,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:41,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:13:41,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179320928] [2025-03-04 10:13:41,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:41,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:13:41,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:41,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:13:41,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:13:41,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-04 10:13:41,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 127 transitions, 947 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:41,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:41,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-04 10:13:41,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:52,067 INFO L124 PetriNetUnfolderBase]: 83023/118404 cut-off events. [2025-03-04 10:13:52,067 INFO L125 PetriNetUnfolderBase]: For 561139/564247 co-relation queries the response was YES. [2025-03-04 10:13:52,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475900 conditions, 118404 events. 83023/118404 cut-off events. For 561139/564247 co-relation queries the response was YES. Maximal size of possible extension queue 3736. Compared 878938 event pairs, 11169 based on Foata normal form. 2492/114540 useless extension candidates. Maximal degree in co-relation 389935. Up to 45019 conditions per place. [2025-03-04 10:13:53,062 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 492 selfloop transitions, 77 changer transitions 45/627 dead transitions. [2025-03-04 10:13:53,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 627 transitions, 6262 flow [2025-03-04 10:13:53,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:13:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:13:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 453 transitions. [2025-03-04 10:13:53,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.527972027972028 [2025-03-04 10:13:53,064 INFO L175 Difference]: Start difference. First operand has 111 places, 127 transitions, 947 flow. Second operand 13 states and 453 transitions. [2025-03-04 10:13:53,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 627 transitions, 6262 flow [2025-03-04 10:14:00,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 627 transitions, 6066 flow, removed 98 selfloop flow, removed 0 redundant places. [2025-03-04 10:14:00,928 INFO L231 Difference]: Finished difference. Result has 133 places, 209 transitions, 1948 flow [2025-03-04 10:14:00,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1948, PETRI_PLACES=133, PETRI_TRANSITIONS=209} [2025-03-04 10:14:00,929 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 65 predicate places. [2025-03-04 10:14:00,929 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 209 transitions, 1948 flow [2025-03-04 10:14:00,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:00,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:00,929 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:14:00,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:14:00,929 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:14:00,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:00,930 INFO L85 PathProgramCache]: Analyzing trace with hash 548788756, now seen corresponding path program 5 times [2025-03-04 10:14:00,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:00,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695376440] [2025-03-04 10:14:00,930 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:14:00,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:00,938 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:14:00,950 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:14:00,950 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:00,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:01,225 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:14:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695376440] [2025-03-04 10:14:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695376440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:01,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:14:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346708032] [2025-03-04 10:14:01,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:01,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:01,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:14:01,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-04 10:14:01,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 209 transitions, 1948 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:01,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:01,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-04 10:14:01,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand