./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.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 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:10:40,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:10:40,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:10:40,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:10:40,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:10:40,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:10:40,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:10:40,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:10:40,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:10:40,334 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:10:40,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:10:40,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:10:40,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:10:40,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:10:40,336 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:10:40,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:10:40,336 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:10:40,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:10:40,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:40,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:10:40,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:10:40,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:10:40,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:10:40,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:10:40,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:10:40,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:10:40,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:10:40,338 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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-03-04 10:10:40,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:10:40,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:10:40,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:10:40,593 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:10:40,593 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:10:40,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-04 10:10:41,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05aff6180/a9e1330fbc4448de9bbb2b865fef68ea/FLAGed91fa541 [2025-03-04 10:10:42,115 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:10:42,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-04 10:10:42,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05aff6180/a9e1330fbc4448de9bbb2b865fef68ea/FLAGed91fa541 [2025-03-04 10:10:42,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05aff6180/a9e1330fbc4448de9bbb2b865fef68ea [2025-03-04 10:10:42,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:10:42,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:10:42,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:42,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:10:42,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:10:42,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7121df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42, skipping insertion in model container [2025-03-04 10:10:42,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:10:42,321 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:10:42,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:42,334 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:10:42,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:42,368 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:10:42,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42 WrapperNode [2025-03-04 10:10:42,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:42,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:42,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:10:42,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:10:42,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,405 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 327 [2025-03-04 10:10:42,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:42,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:10:42,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:10:42,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:10:42,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,429 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 10:10:42,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:10:42,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:10:42,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:10:42,442 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:10:42,443 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (1/1) ... [2025-03-04 10:10:42,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:42,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:42,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:10:42,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:10:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:10:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:10:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:10:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:10:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:10:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:10:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:10:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:10:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:10:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:10:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:10:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:10:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:10:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:10:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:10:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:10:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:10:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:10:42,515 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:10:42,618 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:10:42,619 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:10:43,020 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:10:43,020 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:10:43,340 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:10:43,340 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:10:43,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:43 BoogieIcfgContainer [2025-03-04 10:10:43,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:10:43,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:10:43,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:10:43,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:10:43,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:10:42" (1/3) ... [2025-03-04 10:10:43,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c52ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:43, skipping insertion in model container [2025-03-04 10:10:43,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:42" (2/3) ... [2025-03-04 10:10:43,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c52ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:43, skipping insertion in model container [2025-03-04 10:10:43,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:43" (3/3) ... [2025-03-04 10:10:43,351 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-03-04 10:10:43,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:10:43,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 72 locations, 1 initial locations, 6 loop locations, and 24 error locations. [2025-03-04 10:10:43,366 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:10:43,429 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:10:43,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 88 transitions, 197 flow [2025-03-04 10:10:43,486 INFO L124 PetriNetUnfolderBase]: 17/85 cut-off events. [2025-03-04 10:10:43,488 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:10:43,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 17/85 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 232 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. [2025-03-04 10:10:43,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 88 transitions, 197 flow [2025-03-04 10:10:43,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 84 transitions, 186 flow [2025-03-04 10:10:43,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:10:43,513 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;@9bb02f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:10:43,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-03-04 10:10:43,516 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:10:43,516 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:10:43,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:10:43,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:43,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:10:43,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:10:43,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash 916857, now seen corresponding path program 1 times [2025-03-04 10:10:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184033842] [2025-03-04 10:10:43,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:43,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:10:43,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:10:43,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:43,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:43,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:43,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184033842] [2025-03-04 10:10:43,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184033842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:43,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:43,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:10:43,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692456828] [2025-03-04 10:10:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:43,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:43,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:43,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:43,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-04 10:10:43,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:43,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:43,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-04 10:10:43,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:44,838 INFO L124 PetriNetUnfolderBase]: 7268/10570 cut-off events. [2025-03-04 10:10:44,839 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2025-03-04 10:10:44,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20386 conditions, 10570 events. 7268/10570 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 70079 event pairs, 5236 based on Foata normal form. 1/5686 useless extension candidates. Maximal degree in co-relation 19698. Up to 9450 conditions per place. [2025-03-04 10:10:44,916 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 54 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-03-04 10:10:44,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 282 flow [2025-03-04 10:10:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-03-04 10:10:44,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-03-04 10:10:44,930 INFO L175 Difference]: Start difference. First operand has 77 places, 84 transitions, 186 flow. Second operand 3 states and 135 transitions. [2025-03-04 10:10:44,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 282 flow [2025-03-04 10:10:44,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 270 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:10:44,942 INFO L231 Difference]: Finished difference. Result has 68 places, 76 transitions, 162 flow [2025-03-04 10:10:44,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=76} [2025-03-04 10:10:44,948 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2025-03-04 10:10:44,948 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 76 transitions, 162 flow [2025-03-04 10:10:44,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:44,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:44,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:10:44,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:10:44,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:10:44,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash 916858, now seen corresponding path program 1 times [2025-03-04 10:10:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:44,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988919646] [2025-03-04 10:10:44,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:44,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:10:44,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:10:44,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:44,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:45,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:45,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988919646] [2025-03-04 10:10:45,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988919646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:45,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:45,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:45,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524708232] [2025-03-04 10:10:45,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:45,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:45,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:45,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:45,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:45,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-04 10:10:45,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 76 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:45,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:45,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-04 10:10:45,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:45,993 INFO L124 PetriNetUnfolderBase]: 7271/10579 cut-off events. [2025-03-04 10:10:45,993 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-04 10:10:46,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20186 conditions, 10579 events. 7271/10579 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 70046 event pairs, 5236 based on Foata normal form. 0/5690 useless extension candidates. Maximal degree in co-relation 20136. Up to 9463 conditions per place. [2025-03-04 10:10:46,063 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 58 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2025-03-04 10:10:46,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 318 flow [2025-03-04 10:10:46,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2025-03-04 10:10:46,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2025-03-04 10:10:46,067 INFO L175 Difference]: Start difference. First operand has 68 places, 76 transitions, 162 flow. Second operand 4 states and 167 transitions. [2025-03-04 10:10:46,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 318 flow [2025-03-04 10:10:46,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:46,070 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 240 flow [2025-03-04 10:10:46,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2025-03-04 10:10:46,072 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2025-03-04 10:10:46,072 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 240 flow [2025-03-04 10:10:46,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:46,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:46,073 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:10:46,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:10:46,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:10:46,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash 881129432, now seen corresponding path program 1 times [2025-03-04 10:10:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:46,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344337227] [2025-03-04 10:10:46,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:46,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:10:46,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:10:46,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:46,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:46,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:46,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344337227] [2025-03-04 10:10:46,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344337227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:46,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932002185] [2025-03-04 10:10:46,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:46,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:46,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:46,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:46,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:10:46,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:10:46,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:10:46,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:46,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:46,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:10:46,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:46,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:10:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:46,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:46,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932002185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:46,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:46,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:10:46,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806876589] [2025-03-04 10:10:46,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:46,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:10:46,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:46,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:10:46,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:10:46,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-04 10:10:46,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 240 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:46,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:46,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-04 10:10:46,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:47,833 INFO L124 PetriNetUnfolderBase]: 7271/10576 cut-off events. [2025-03-04 10:10:47,833 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 10:10:47,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20208 conditions, 10576 events. 7271/10576 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 69977 event pairs, 5236 based on Foata normal form. 0/5693 useless extension candidates. Maximal degree in co-relation 20150. Up to 9451 conditions per place. [2025-03-04 10:10:47,937 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 48 selfloop transitions, 17 changer transitions 0/82 dead transitions. [2025-03-04 10:10:47,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 82 transitions, 358 flow [2025-03-04 10:10:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2025-03-04 10:10:47,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-04 10:10:47,940 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 240 flow. Second operand 6 states and 212 transitions. [2025-03-04 10:10:47,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 82 transitions, 358 flow [2025-03-04 10:10:47,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 82 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:10:47,942 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 262 flow [2025-03-04 10:10:47,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2025-03-04 10:10:47,943 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-03-04 10:10:47,943 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 262 flow [2025-03-04 10:10:47,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:47,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:47,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:47,951 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:10:48,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:48,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:10:48,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash -429040348, now seen corresponding path program 1 times [2025-03-04 10:10:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:48,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206891768] [2025-03-04 10:10:48,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:48,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:48,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:10:48,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:10:48,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:48,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:48,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:48,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206891768] [2025-03-04 10:10:48,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206891768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:48,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:48,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:10:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813640116] [2025-03-04 10:10:48,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:48,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:48,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:48,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:48,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:48,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-04 10:10:48,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:48,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:48,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-04 10:10:48,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:48,985 INFO L124 PetriNetUnfolderBase]: 12118/17662 cut-off events. [2025-03-04 10:10:48,985 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-03-04 10:10:49,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33762 conditions, 17662 events. 12118/17662 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 122635 event pairs, 4256 based on Foata normal form. 356/10114 useless extension candidates. Maximal degree in co-relation 33688. Up to 9751 conditions per place. [2025-03-04 10:10:49,063 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 99 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-03-04 10:10:49,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 544 flow [2025-03-04 10:10:49,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-04 10:10:49,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-03-04 10:10:49,065 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 262 flow. Second operand 3 states and 180 transitions. [2025-03-04 10:10:49,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 544 flow [2025-03-04 10:10:49,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 119 transitions, 494 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-04 10:10:49,068 INFO L231 Difference]: Finished difference. Result has 71 places, 84 transitions, 241 flow [2025-03-04 10:10:49,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2025-03-04 10:10:49,068 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -6 predicate places. [2025-03-04 10:10:49,068 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 84 transitions, 241 flow [2025-03-04 10:10:49,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:49,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:49,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:49,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:10:49,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:10:49,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash -415346918, now seen corresponding path program 1 times [2025-03-04 10:10:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:49,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436574784] [2025-03-04 10:10:49,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:49,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:10:49,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:10:49,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:49,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436574784] [2025-03-04 10:10:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436574784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:49,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:49,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:49,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589030316] [2025-03-04 10:10:49,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:49,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:49,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:49,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:49,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 88 [2025-03-04 10:10:49,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 84 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:49,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:49,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 88 [2025-03-04 10:10:49,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:50,113 INFO L124 PetriNetUnfolderBase]: 15264/21886 cut-off events. [2025-03-04 10:10:50,114 INFO L125 PetriNetUnfolderBase]: For 1277/1301 co-relation queries the response was YES. [2025-03-04 10:10:50,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45024 conditions, 21886 events. 15264/21886 cut-off events. For 1277/1301 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 138929 event pairs, 5655 based on Foata normal form. 0/14457 useless extension candidates. Maximal degree in co-relation 10198. Up to 10528 conditions per place. [2025-03-04 10:10:50,224 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 100 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2025-03-04 10:10:50,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 116 transitions, 521 flow [2025-03-04 10:10:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-03-04 10:10:50,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-04 10:10:50,226 INFO L175 Difference]: Start difference. First operand has 71 places, 84 transitions, 241 flow. Second operand 3 states and 160 transitions. [2025-03-04 10:10:50,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 116 transitions, 521 flow [2025-03-04 10:10:50,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 116 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:50,229 INFO L231 Difference]: Finished difference. Result has 74 places, 85 transitions, 260 flow [2025-03-04 10:10:50,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=74, PETRI_TRANSITIONS=85} [2025-03-04 10:10:50,233 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-03-04 10:10:50,233 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 85 transitions, 260 flow [2025-03-04 10:10:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:50,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:50,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:50,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:10:50,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:10:50,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -626543915, now seen corresponding path program 1 times [2025-03-04 10:10:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:50,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471978638] [2025-03-04 10:10:50,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:50,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:10:50,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:10:50,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:50,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:50,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:50,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471978638] [2025-03-04 10:10:50,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471978638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:50,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:50,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:50,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851594885] [2025-03-04 10:10:50,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:50,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:50,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:50,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:50,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:50,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-04 10:10:50,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 85 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:50,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:50,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-04 10:10:50,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:51,701 INFO L124 PetriNetUnfolderBase]: 19162/28513 cut-off events. [2025-03-04 10:10:51,701 INFO L125 PetriNetUnfolderBase]: For 4805/4969 co-relation queries the response was YES. [2025-03-04 10:10:51,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60773 conditions, 28513 events. 19162/28513 cut-off events. For 4805/4969 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 195575 event pairs, 7868 based on Foata normal form. 477/19449 useless extension candidates. Maximal degree in co-relation 17559. Up to 12927 conditions per place. [2025-03-04 10:10:51,811 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 105 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2025-03-04 10:10:51,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 125 transitions, 582 flow [2025-03-04 10:10:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-04 10:10:51,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-03-04 10:10:51,813 INFO L175 Difference]: Start difference. First operand has 74 places, 85 transitions, 260 flow. Second operand 3 states and 180 transitions. [2025-03-04 10:10:51,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 125 transitions, 582 flow [2025-03-04 10:10:51,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:51,819 INFO L231 Difference]: Finished difference. Result has 75 places, 86 transitions, 268 flow [2025-03-04 10:10:51,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=75, PETRI_TRANSITIONS=86} [2025-03-04 10:10:51,820 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -2 predicate places. [2025-03-04 10:10:51,820 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 86 transitions, 268 flow [2025-03-04 10:10:51,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:51,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:51,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:51,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:10:51,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:10:51,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:51,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2051977122, now seen corresponding path program 1 times [2025-03-04 10:10:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:51,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187691932] [2025-03-04 10:10:51,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:51,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:10:51,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:10:51,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:51,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:51,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:51,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187691932] [2025-03-04 10:10:51,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187691932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:51,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:51,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:51,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689675678] [2025-03-04 10:10:51,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:51,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:51,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:51,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:51,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:51,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-04 10:10:51,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 86 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:51,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:51,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-04 10:10:51,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:53,508 INFO L124 PetriNetUnfolderBase]: 23770/34271 cut-off events. [2025-03-04 10:10:53,509 INFO L125 PetriNetUnfolderBase]: For 4423/4837 co-relation queries the response was YES. [2025-03-04 10:10:53,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73063 conditions, 34271 events. 23770/34271 cut-off events. For 4423/4837 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 225479 event pairs, 11883 based on Foata normal form. 0/23391 useless extension candidates. Maximal degree in co-relation 25449. Up to 20204 conditions per place. [2025-03-04 10:10:53,668 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 102 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-03-04 10:10:53,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 121 transitions, 571 flow [2025-03-04 10:10:53,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-03-04 10:10:53,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-04 10:10:53,669 INFO L175 Difference]: Start difference. First operand has 75 places, 86 transitions, 268 flow. Second operand 3 states and 168 transitions. [2025-03-04 10:10:53,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 121 transitions, 571 flow [2025-03-04 10:10:53,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:53,674 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 284 flow [2025-03-04 10:10:53,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2025-03-04 10:10:53,674 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 1 predicate places. [2025-03-04 10:10:53,674 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 284 flow [2025-03-04 10:10:53,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:53,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:53,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:53,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:10:53,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:10:53,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2018106754, now seen corresponding path program 1 times [2025-03-04 10:10:53,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:53,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284318659] [2025-03-04 10:10:53,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:53,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:53,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:10:53,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:10:53,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:53,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:53,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:53,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284318659] [2025-03-04 10:10:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284318659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:53,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:53,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329113814] [2025-03-04 10:10:53,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:53,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:53,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:53,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:53,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-04 10:10:53,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:53,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:53,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-04 10:10:53,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:55,461 INFO L124 PetriNetUnfolderBase]: 21339/31723 cut-off events. [2025-03-04 10:10:55,462 INFO L125 PetriNetUnfolderBase]: For 8873/9575 co-relation queries the response was YES. [2025-03-04 10:10:55,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70189 conditions, 31723 events. 21339/31723 cut-off events. For 8873/9575 co-relation queries the response was YES. Maximal size of possible extension queue 1387. Compared 214367 event pairs, 16426 based on Foata normal form. 112/21807 useless extension candidates. Maximal degree in co-relation 42125. Up to 26821 conditions per place. [2025-03-04 10:10:55,620 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 97 selfloop transitions, 7 changer transitions 0/123 dead transitions. [2025-03-04 10:10:55,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 123 transitions, 598 flow [2025-03-04 10:10:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2025-03-04 10:10:55,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-03-04 10:10:55,622 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 284 flow. Second operand 5 states and 234 transitions. [2025-03-04 10:10:55,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 123 transitions, 598 flow [2025-03-04 10:10:55,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 123 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:55,633 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 332 flow [2025-03-04 10:10:55,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2025-03-04 10:10:55,633 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-03-04 10:10:55,633 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 332 flow [2025-03-04 10:10:55,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:55,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:55,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:55,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:10:55,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:10:55,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1863202088, now seen corresponding path program 1 times [2025-03-04 10:10:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:55,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726409224] [2025-03-04 10:10:55,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:55,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:10:55,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:10:55,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:55,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:55,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726409224] [2025-03-04 10:10:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726409224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:55,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:55,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197318515] [2025-03-04 10:10:55,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:55,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:55,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:55,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:55,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-04 10:10:55,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:55,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:55,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-04 10:10:55,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:58,379 INFO L124 PetriNetUnfolderBase]: 37219/53375 cut-off events. [2025-03-04 10:10:58,379 INFO L125 PetriNetUnfolderBase]: For 12566/13750 co-relation queries the response was YES. [2025-03-04 10:10:58,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119841 conditions, 53375 events. 37219/53375 cut-off events. For 12566/13750 co-relation queries the response was YES. Maximal size of possible extension queue 2220. Compared 357265 event pairs, 21948 based on Foata normal form. 0/36568 useless extension candidates. Maximal degree in co-relation 117461. Up to 24971 conditions per place. [2025-03-04 10:10:58,671 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 106 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2025-03-04 10:10:58,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 127 transitions, 663 flow [2025-03-04 10:10:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-03-04 10:10:58,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-04 10:10:58,672 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 332 flow. Second operand 3 states and 168 transitions. [2025-03-04 10:10:58,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 127 transitions, 663 flow [2025-03-04 10:10:58,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 127 transitions, 659 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:58,683 INFO L231 Difference]: Finished difference. Result has 85 places, 91 transitions, 354 flow [2025-03-04 10:10:58,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2025-03-04 10:10:58,684 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-03-04 10:10:58,684 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 354 flow [2025-03-04 10:10:58,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:58,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:58,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:58,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:10:58,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:10:58,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash 590757724, now seen corresponding path program 1 times [2025-03-04 10:10:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:58,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365295137] [2025-03-04 10:10:58,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:58,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:10:58,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:10:58,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:58,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:58,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365295137] [2025-03-04 10:10:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365295137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:58,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546268754] [2025-03-04 10:10:58,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:58,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:58,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:58,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:58,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-04 10:10:58,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 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:10:58,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:58,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-04 10:10:58,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:01,134 INFO L124 PetriNetUnfolderBase]: 24142/36406 cut-off events. [2025-03-04 10:11:01,134 INFO L125 PetriNetUnfolderBase]: For 14368/15852 co-relation queries the response was YES. [2025-03-04 10:11:01,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82500 conditions, 36406 events. 24142/36406 cut-off events. For 14368/15852 co-relation queries the response was YES. Maximal size of possible extension queue 1359. Compared 255415 event pairs, 19281 based on Foata normal form. 0/27004 useless extension candidates. Maximal degree in co-relation 80312. Up to 32003 conditions per place. [2025-03-04 10:11:01,316 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 61 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-03-04 10:11:01,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 87 transitions, 474 flow [2025-03-04 10:11:01,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-03-04 10:11:01,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 10:11:01,318 INFO L175 Difference]: Start difference. First operand has 85 places, 91 transitions, 354 flow. Second operand 5 states and 176 transitions. [2025-03-04 10:11:01,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 87 transitions, 474 flow [2025-03-04 10:11:01,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 87 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:01,327 INFO L231 Difference]: Finished difference. Result has 83 places, 87 transitions, 342 flow [2025-03-04 10:11:01,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=83, PETRI_TRANSITIONS=87} [2025-03-04 10:11:01,327 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-03-04 10:11:01,328 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 342 flow [2025-03-04 10:11:01,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 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:11:01,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:01,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:01,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:11:01,328 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:11:01,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:01,328 INFO L85 PathProgramCache]: Analyzing trace with hash 590757725, now seen corresponding path program 1 times [2025-03-04 10:11:01,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:01,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405960262] [2025-03-04 10:11:01,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:01,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:11:01,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:11:01,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:01,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:01,622 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:11:01,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:01,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405960262] [2025-03-04 10:11:01,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405960262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:01,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096566828] [2025-03-04 10:11:01,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:01,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:01,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:01,625 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:11:01,627 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:11:01,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:11:01,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:11:01,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:01,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:01,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:11:01,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:01,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:11:01,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:11:01,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 10:11:01,781 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:11:01,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 10:11:01,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:11:01,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 10:11:01,812 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:11:01,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:11:01,858 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:11:01,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:01,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096566828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:01,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:11:01,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2025-03-04 10:11:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509058165] [2025-03-04 10:11:01,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:01,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:01,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:01,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:11:01,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-04 10:11:01,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:01,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:01,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-04 10:11:01,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:03,315 INFO L124 PetriNetUnfolderBase]: 18925/28905 cut-off events. [2025-03-04 10:11:03,315 INFO L125 PetriNetUnfolderBase]: For 9084/10332 co-relation queries the response was YES. [2025-03-04 10:11:03,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63260 conditions, 28905 events. 18925/28905 cut-off events. For 9084/10332 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 197568 event pairs, 14916 based on Foata normal form. 1455/22669 useless extension candidates. Maximal degree in co-relation 61066. Up to 25022 conditions per place. [2025-03-04 10:11:03,502 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 60 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2025-03-04 10:11:03,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 454 flow [2025-03-04 10:11:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-03-04 10:11:03,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2025-03-04 10:11:03,504 INFO L175 Difference]: Start difference. First operand has 83 places, 87 transitions, 342 flow. Second operand 4 states and 148 transitions. [2025-03-04 10:11:03,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 454 flow [2025-03-04 10:11:03,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 445 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:03,510 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 325 flow [2025-03-04 10:11:03,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2025-03-04 10:11:03,511 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-03-04 10:11:03,511 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 325 flow [2025-03-04 10:11:03,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:03,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:03,511 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:03,517 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:11:03,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:11:03,712 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:11:03,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -961475452, now seen corresponding path program 1 times [2025-03-04 10:11:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078756238] [2025-03-04 10:11:03,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:03,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:03,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:11:03,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:03,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:03,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:11:03,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:03,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078756238] [2025-03-04 10:11:03,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078756238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:03,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:03,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:03,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044594494] [2025-03-04 10:11:03,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:03,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:03,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:03,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:03,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-04 10:11:03,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:03,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:03,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-04 10:11:03,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:06,289 INFO L124 PetriNetUnfolderBase]: 24421/36146 cut-off events. [2025-03-04 10:11:06,290 INFO L125 PetriNetUnfolderBase]: For 13336/15617 co-relation queries the response was YES. [2025-03-04 10:11:06,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81544 conditions, 36146 events. 24421/36146 cut-off events. For 13336/15617 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 232683 event pairs, 8589 based on Foata normal form. 732/28089 useless extension candidates. Maximal degree in co-relation 79391. Up to 23607 conditions per place. [2025-03-04 10:11:06,551 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 92 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-03-04 10:11:06,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 114 transitions, 606 flow [2025-03-04 10:11:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-03-04 10:11:06,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-03-04 10:11:06,552 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 325 flow. Second operand 3 states and 162 transitions. [2025-03-04 10:11:06,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 114 transitions, 606 flow [2025-03-04 10:11:06,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 114 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:06,560 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 339 flow [2025-03-04 10:11:06,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2025-03-04 10:11:06,561 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-03-04 10:11:06,561 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 339 flow [2025-03-04 10:11:06,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:06,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:06,561 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:06,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:11:06,561 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:11:06,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash -39663669, now seen corresponding path program 1 times [2025-03-04 10:11:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:06,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705175648] [2025-03-04 10:11:06,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:06,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:06,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:11:06,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:11:06,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:06,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:11:06,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705175648] [2025-03-04 10:11:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705175648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:06,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:06,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:06,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980955278] [2025-03-04 10:11:06,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:06,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:06,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:06,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:06,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:06,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-04 10:11:06,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:06,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:06,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-04 10:11:06,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:08,915 INFO L124 PetriNetUnfolderBase]: 31285/47144 cut-off events. [2025-03-04 10:11:08,915 INFO L125 PetriNetUnfolderBase]: For 19619/22356 co-relation queries the response was YES. [2025-03-04 10:11:09,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107799 conditions, 47144 events. 31285/47144 cut-off events. For 19619/22356 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 322377 event pairs, 24949 based on Foata normal form. 340/36147 useless extension candidates. Maximal degree in co-relation 103579. Up to 32654 conditions per place. [2025-03-04 10:11:09,241 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 85 selfloop transitions, 12 changer transitions 0/117 dead transitions. [2025-03-04 10:11:09,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 638 flow [2025-03-04 10:11:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2025-03-04 10:11:09,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2025-03-04 10:11:09,242 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 339 flow. Second operand 5 states and 226 transitions. [2025-03-04 10:11:09,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 638 flow [2025-03-04 10:11:09,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:09,254 INFO L231 Difference]: Finished difference. Result has 84 places, 84 transitions, 375 flow [2025-03-04 10:11:09,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=375, PETRI_PLACES=84, PETRI_TRANSITIONS=84} [2025-03-04 10:11:09,255 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-04 10:11:09,255 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 375 flow [2025-03-04 10:11:09,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:09,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:09,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:09,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:11:09,255 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:11:09,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash 505380538, now seen corresponding path program 1 times [2025-03-04 10:11:09,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:09,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374052478] [2025-03-04 10:11:09,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:09,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:09,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:11:09,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:11:09,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:09,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:09,311 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:11:09,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:09,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374052478] [2025-03-04 10:11:09,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374052478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:09,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:09,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:09,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415064688] [2025-03-04 10:11:09,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:09,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:09,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:09,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:09,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:09,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-04 10:11:09,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:09,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:09,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-04 10:11:09,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:11,757 INFO L124 PetriNetUnfolderBase]: 31285/47132 cut-off events. [2025-03-04 10:11:11,758 INFO L125 PetriNetUnfolderBase]: For 20395/23132 co-relation queries the response was YES. [2025-03-04 10:11:11,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108904 conditions, 47132 events. 31285/47132 cut-off events. For 20395/23132 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 317693 event pairs, 11045 based on Foata normal form. 6/35802 useless extension candidates. Maximal degree in co-relation 104679. Up to 36616 conditions per place. [2025-03-04 10:11:12,098 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 71 selfloop transitions, 2 changer transitions 9/102 dead transitions. [2025-03-04 10:11:12,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 102 transitions, 586 flow [2025-03-04 10:11:12,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-03-04 10:11:12,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2025-03-04 10:11:12,100 INFO L175 Difference]: Start difference. First operand has 84 places, 84 transitions, 375 flow. Second operand 3 states and 148 transitions. [2025-03-04 10:11:12,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 102 transitions, 586 flow [2025-03-04 10:11:12,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 102 transitions, 570 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:12,114 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 327 flow [2025-03-04 10:11:12,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2025-03-04 10:11:12,114 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-03-04 10:11:12,115 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 327 flow [2025-03-04 10:11:12,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:12,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:12,115 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:12,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:11:12,115 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:11:12,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1268346332, now seen corresponding path program 1 times [2025-03-04 10:11:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052764867] [2025-03-04 10:11:12,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:12,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:11:12,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:12,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:12,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:11:12,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052764867] [2025-03-04 10:11:12,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052764867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65194079] [2025-03-04 10:11:12,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:12,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:12,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:12,323 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:11:12,325 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:11:12,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:11:12,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:12,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:12,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:12,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:11:12,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:11:12,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:12,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65194079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:12,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:11:12,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 10:11:12,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101104676] [2025-03-04 10:11:12,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:12,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:12,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:12,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:12,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:11:12,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-04 10:11:12,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 327 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:12,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:12,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-04 10:11:12,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:15,041 INFO L124 PetriNetUnfolderBase]: 27130/41448 cut-off events. [2025-03-04 10:11:15,041 INFO L125 PetriNetUnfolderBase]: For 20746/23183 co-relation queries the response was YES. [2025-03-04 10:11:15,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95428 conditions, 41448 events. 27130/41448 cut-off events. For 20746/23183 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 286850 event pairs, 21455 based on Foata normal form. 0/32146 useless extension candidates. Maximal degree in co-relation 95384. Up to 36228 conditions per place. [2025-03-04 10:11:15,258 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 52 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2025-03-04 10:11:15,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 78 transitions, 435 flow [2025-03-04 10:11:15,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2025-03-04 10:11:15,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2025-03-04 10:11:15,259 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 327 flow. Second operand 4 states and 156 transitions. [2025-03-04 10:11:15,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 78 transitions, 435 flow [2025-03-04 10:11:15,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 78 transitions, 423 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:15,270 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 319 flow [2025-03-04 10:11:15,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2025-03-04 10:11:15,270 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-04 10:11:15,270 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 319 flow [2025-03-04 10:11:15,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:15,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:15,271 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:15,276 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:11:15,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:15,471 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:11:15,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:15,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1023038921, now seen corresponding path program 1 times [2025-03-04 10:11:15,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:15,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833893248] [2025-03-04 10:11:15,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:15,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:11:15,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:15,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:15,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:15,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:15,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833893248] [2025-03-04 10:11:15,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833893248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:15,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:15,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:15,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819280627] [2025-03-04 10:11:15,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:15,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:15,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:15,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:15,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:15,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 88 [2025-03-04 10:11:15,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:15,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:15,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 88 [2025-03-04 10:11:15,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:17,804 INFO L124 PetriNetUnfolderBase]: 29449/42288 cut-off events. [2025-03-04 10:11:17,804 INFO L125 PetriNetUnfolderBase]: For 20714/23073 co-relation queries the response was YES. [2025-03-04 10:11:17,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100516 conditions, 42288 events. 29449/42288 cut-off events. For 20714/23073 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 249803 event pairs, 15757 based on Foata normal form. 474/35675 useless extension candidates. Maximal degree in co-relation 100472. Up to 26799 conditions per place. [2025-03-04 10:11:17,983 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 84 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-03-04 10:11:17,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 103 transitions, 574 flow [2025-03-04 10:11:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-03-04 10:11:17,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-04 10:11:17,985 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 319 flow. Second operand 3 states and 144 transitions. [2025-03-04 10:11:17,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 103 transitions, 574 flow [2025-03-04 10:11:17,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 103 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:17,991 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 337 flow [2025-03-04 10:11:17,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=337, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2025-03-04 10:11:17,992 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-03-04 10:11:17,992 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 337 flow [2025-03-04 10:11:17,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:17,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:17,992 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:17,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:11:17,992 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:11:17,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 576269793, now seen corresponding path program 1 times [2025-03-04 10:11:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:17,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621317154] [2025-03-04 10:11:17,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:17,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:17,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:11:18,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:18,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:18,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:18,046 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:11:18,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:18,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621317154] [2025-03-04 10:11:18,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621317154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:18,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:18,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181030552] [2025-03-04 10:11:18,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:18,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:18,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:18,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:18,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:18,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-04 10:11:18,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 337 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:18,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:18,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-04 10:11:18,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:20,195 INFO L124 PetriNetUnfolderBase]: 20049/30508 cut-off events. [2025-03-04 10:11:20,195 INFO L125 PetriNetUnfolderBase]: For 22726/24841 co-relation queries the response was YES. [2025-03-04 10:11:20,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72189 conditions, 30508 events. 20049/30508 cut-off events. For 22726/24841 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 195446 event pairs, 16312 based on Foata normal form. 1518/25845 useless extension candidates. Maximal degree in co-relation 72146. Up to 27054 conditions per place. [2025-03-04 10:11:20,291 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 53 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-04 10:11:20,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 77 transitions, 441 flow [2025-03-04 10:11:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-03-04 10:11:20,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2025-03-04 10:11:20,292 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 337 flow. Second operand 4 states and 142 transitions. [2025-03-04 10:11:20,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 77 transitions, 441 flow [2025-03-04 10:11:20,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:20,299 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 325 flow [2025-03-04 10:11:20,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2025-03-04 10:11:20,300 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-03-04 10:11:20,300 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 325 flow [2025-03-04 10:11:20,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:20,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:20,300 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:20,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:11:20,301 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:11:20,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:20,301 INFO L85 PathProgramCache]: Analyzing trace with hash 323458962, now seen corresponding path program 1 times [2025-03-04 10:11:20,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:20,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129628528] [2025-03-04 10:11:20,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:20,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:20,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:11:20,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:11:20,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:20,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:20,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129628528] [2025-03-04 10:11:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129628528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:20,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:20,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279594606] [2025-03-04 10:11:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:20,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:20,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:20,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:20,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 88 [2025-03-04 10:11:20,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:20,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:20,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 88 [2025-03-04 10:11:20,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:22,668 INFO L124 PetriNetUnfolderBase]: 30537/44719 cut-off events. [2025-03-04 10:11:22,668 INFO L125 PetriNetUnfolderBase]: For 24594/27628 co-relation queries the response was YES. [2025-03-04 10:11:22,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106492 conditions, 44719 events. 30537/44719 cut-off events. For 24594/27628 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 269364 event pairs, 19837 based on Foata normal form. 680/37628 useless extension candidates. Maximal degree in co-relation 106448. Up to 33291 conditions per place. [2025-03-04 10:11:22,895 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 83 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2025-03-04 10:11:22,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 101 transitions, 572 flow [2025-03-04 10:11:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2025-03-04 10:11:22,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-03-04 10:11:22,896 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 325 flow. Second operand 3 states and 142 transitions. [2025-03-04 10:11:22,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 101 transitions, 572 flow [2025-03-04 10:11:22,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 101 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:22,904 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 347 flow [2025-03-04 10:11:22,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-03-04 10:11:22,905 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-04 10:11:22,905 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 347 flow [2025-03-04 10:11:22,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:22,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:22,905 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:22,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:11:22,905 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 10:11:22,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 765347022, now seen corresponding path program 1 times [2025-03-04 10:11:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:22,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991633942] [2025-03-04 10:11:22,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:22,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:11:22,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:11:22,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:22,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat