./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7888761977ccc49b1a75199021e374591654c6a4364e63bfc6c86e1c7bb7d64b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:09:03,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:09:03,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:09:04,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:09:04,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:09:04,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:09:04,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:09:04,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:09:04,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:09:04,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:09:04,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:09:04,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:09:04,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:09:04,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:09:04,030 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:09:04,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:09:04,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:09:04,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:09:04,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:09:04,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:09:04,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:09:04,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:09:04,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:04,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:09:04,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:09:04,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:09:04,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:09:04,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:04,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:09:04,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:09:04,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:09:04,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:09:04,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:09:04,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:09:04,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:09:04,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:09:04,034 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7888761977ccc49b1a75199021e374591654c6a4364e63bfc6c86e1c7bb7d64b [2025-01-10 01:09:04,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:09:04,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:09:04,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:09:04,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:09:04,278 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:09:04,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c [2025-01-10 01:09:05,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1163a8b63/aacca19daa1543449f7435bc10b7f6e4/FLAGd231c577f [2025-01-10 01:09:05,868 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:09:05,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c [2025-01-10 01:09:05,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1163a8b63/aacca19daa1543449f7435bc10b7f6e4/FLAGd231c577f [2025-01-10 01:09:06,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1163a8b63/aacca19daa1543449f7435bc10b7f6e4 [2025-01-10 01:09:06,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:09:06,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:09:06,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:09:06,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:09:06,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:09:06,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473046f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06, skipping insertion in model container [2025-01-10 01:09:06,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:09:06,344 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:09:06,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:09:06,362 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:09:06,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:09:06,407 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:09:06,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06 WrapperNode [2025-01-10 01:09:06,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:09:06,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:09:06,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:09:06,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:09:06,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,447 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 280 [2025-01-10 01:09:06,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:09:06,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:09:06,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:09:06,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:09:06,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,486 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:09:06,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,501 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:09:06,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:09:06,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:09:06,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:09:06,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2025-01-10 01:09:06,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:06,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:06,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:09:06,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:09:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:09:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:09:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:09:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:09:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:09:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:09:06,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:09:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:09:06,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:09:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:09:06,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:09:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:09:06,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:09:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:09:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:09:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:09:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:09:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:09:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:09:06,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:09:06,571 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:09:06,661 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:09:06,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:09:07,035 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:09:07,035 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:09:07,309 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:09:07,310 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:09:07,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:07 BoogieIcfgContainer [2025-01-10 01:09:07,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:09:07,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:09:07,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:09:07,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:09:07,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:09:06" (1/3) ... [2025-01-10 01:09:07,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423f0059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:07, skipping insertion in model container [2025-01-10 01:09:07,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (2/3) ... [2025-01-10 01:09:07,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423f0059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:07, skipping insertion in model container [2025-01-10 01:09:07,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:07" (3/3) ... [2025-01-10 01:09:07,320 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult3.wvr.c [2025-01-10 01:09:07,333 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:09:07,334 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult3.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-01-10 01:09:07,334 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:09:07,393 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 01:09:07,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-01-10 01:09:07,442 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-01-10 01:09:07,444 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:09:07,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 154 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-01-10 01:09:07,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-01-10 01:09:07,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-01-10 01:09:07,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:09:07,469 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;@4f026479, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:09:07,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-10 01:09:07,472 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:09:07,472 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:09:07,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:09:07,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:07,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:09:07,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:07,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash 815449, now seen corresponding path program 1 times [2025-01-10 01:09:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27105464] [2025-01-10 01:09:07,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:07,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:09:07,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:09:07,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:07,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:07,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:07,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27105464] [2025-01-10 01:09:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27105464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:07,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:09:07,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797484441] [2025-01-10 01:09:07,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:07,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:07,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:07,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:07,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2025-01-10 01:09:07,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 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-01-10 01:09:07,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:07,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2025-01-10 01:09:07,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:09,064 INFO L124 PetriNetUnfolderBase]: 9651/13484 cut-off events. [2025-01-10 01:09:09,065 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2025-01-10 01:09:09,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26018 conditions, 13484 events. 9651/13484 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88031 event pairs, 6408 based on Foata normal form. 1/8042 useless extension candidates. Maximal degree in co-relation 24428. Up to 11896 conditions per place. [2025-01-10 01:09:09,166 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-01-10 01:09:09,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow [2025-01-10 01:09:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-01-10 01:09:09,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2025-01-10 01:09:09,175 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions. [2025-01-10 01:09:09,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow [2025-01-10 01:09:09,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:09:09,189 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-01-10 01:09:09,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-01-10 01:09:09,192 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-01-10 01:09:09,192 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-01-10 01:09:09,192 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-01-10 01:09:09,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:09,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:09:09,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:09:09,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 815450, now seen corresponding path program 1 times [2025-01-10 01:09:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:09,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667629873] [2025-01-10 01:09:09,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:09,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:09:09,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:09:09,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:09,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:09,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667629873] [2025-01-10 01:09:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667629873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:09,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:09,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:09,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423929614] [2025-01-10 01:09:09,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:09,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:09,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:09,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:09,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:09,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2025-01-10 01:09:09,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 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-01-10 01:09:09,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:09,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2025-01-10 01:09:09,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:10,336 INFO L124 PetriNetUnfolderBase]: 9652/13487 cut-off events. [2025-01-10 01:09:10,337 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-10 01:09:10,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25621 conditions, 13487 events. 9652/13487 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88033 event pairs, 6408 based on Foata normal form. 0/8042 useless extension candidates. Maximal degree in co-relation 25592. Up to 11905 conditions per place. [2025-01-10 01:09:10,434 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 39 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-01-10 01:09:10,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 218 flow [2025-01-10 01:09:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-01-10 01:09:10,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-01-10 01:09:10,437 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 140 transitions. [2025-01-10 01:09:10,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 218 flow [2025-01-10 01:09:10,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:10,440 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2025-01-10 01:09:10,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2025-01-10 01:09:10,442 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-01-10 01:09:10,442 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2025-01-10 01:09:10,443 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-01-10 01:09:10,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:10,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:09:10,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:09:10,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:10,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:10,445 INFO L85 PathProgramCache]: Analyzing trace with hash 25279748, now seen corresponding path program 1 times [2025-01-10 01:09:10,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:10,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135380819] [2025-01-10 01:09:10,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:10,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:10,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:09:10,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:09:10,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:10,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135380819] [2025-01-10 01:09:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135380819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:10,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:10,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:10,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554471439] [2025-01-10 01:09:10,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:10,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:10,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:10,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:10,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:10,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2025-01-10 01:09:10,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-01-10 01:09:10,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:10,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2025-01-10 01:09:10,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:11,538 INFO L124 PetriNetUnfolderBase]: 9653/13490 cut-off events. [2025-01-10 01:09:11,538 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-10 01:09:11,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25638 conditions, 13490 events. 9653/13490 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88010 event pairs, 6408 based on Foata normal form. 0/8044 useless extension candidates. Maximal degree in co-relation 25613. Up to 11904 conditions per place. [2025-01-10 01:09:11,606 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-01-10 01:09:11,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 247 flow [2025-01-10 01:09:11,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2025-01-10 01:09:11,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060606060606061 [2025-01-10 01:09:11,608 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 167 transitions. [2025-01-10 01:09:11,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 247 flow [2025-01-10 01:09:11,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:11,609 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2025-01-10 01:09:11,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-01-10 01:09:11,610 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-01-10 01:09:11,610 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2025-01-10 01:09:11,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-01-10 01:09:11,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:11,610 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:09:11,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:09:11,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:11,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:11,611 INFO L85 PathProgramCache]: Analyzing trace with hash 783673919, now seen corresponding path program 1 times [2025-01-10 01:09:11,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:11,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318740638] [2025-01-10 01:09:11,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:11,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:11,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:11,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:11,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:11,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318740638] [2025-01-10 01:09:11,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318740638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687142447] [2025-01-10 01:09:11,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:11,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:11,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:11,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:11,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:09:11,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:11,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:11,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:11,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:11,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:09:11,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:11,908 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-01-10 01:09:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:12,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687142447] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:12,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:12,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:09:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118049815] [2025-01-10 01:09:12,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:12,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:09:12,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:12,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:09:12,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:09:12,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2025-01-10 01:09:12,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 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-01-10 01:09:12,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:12,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2025-01-10 01:09:12,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:12,943 INFO L124 PetriNetUnfolderBase]: 9653/13489 cut-off events. [2025-01-10 01:09:12,944 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 01:09:12,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25651 conditions, 13489 events. 9653/13489 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88033 event pairs, 6408 based on Foata normal form. 0/8046 useless extension candidates. Maximal degree in co-relation 25623. Up to 11904 conditions per place. [2025-01-10 01:09:13,012 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 38 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2025-01-10 01:09:13,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 269 flow [2025-01-10 01:09:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:09:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:09:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2025-01-10 01:09:13,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-01-10 01:09:13,014 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 6 states and 187 transitions. [2025-01-10 01:09:13,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 269 flow [2025-01-10 01:09:13,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:13,015 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 192 flow [2025-01-10 01:09:13,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-01-10 01:09:13,016 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-01-10 01:09:13,016 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 192 flow [2025-01-10 01:09:13,016 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-01-10 01:09:13,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:13,016 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:09:13,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:09:13,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:13,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:13,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:13,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1475940319, now seen corresponding path program 1 times [2025-01-10 01:09:13,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:13,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318211652] [2025-01-10 01:09:13,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:13,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:13,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:13,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:13,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:13,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318211652] [2025-01-10 01:09:13,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318211652] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092131589] [2025-01-10 01:09:13,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:13,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:13,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:13,410 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:13,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:09:13,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:13,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:13,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:13,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:13,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:09:13,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:13,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:09:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:13,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092131589] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:13,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:09:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371846346] [2025-01-10 01:09:13,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:13,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:09:13,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:13,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:09:13,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:09:13,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2025-01-10 01:09:13,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 192 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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-01-10 01:09:13,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:13,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2025-01-10 01:09:13,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:14,846 INFO L124 PetriNetUnfolderBase]: 9655/13494 cut-off events. [2025-01-10 01:09:14,847 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 01:09:14,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25677 conditions, 13494 events. 9655/13494 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88052 event pairs, 6408 based on Foata normal form. 0/8051 useless extension candidates. Maximal degree in co-relation 25631. Up to 11897 conditions per place. [2025-01-10 01:09:14,943 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 32 selfloop transitions, 18 changer transitions 0/67 dead transitions. [2025-01-10 01:09:14,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 321 flow [2025-01-10 01:09:14,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:09:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:09:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 268 transitions. [2025-01-10 01:09:14,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4511784511784512 [2025-01-10 01:09:14,946 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 192 flow. Second operand 9 states and 268 transitions. [2025-01-10 01:09:14,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 321 flow [2025-01-10 01:09:14,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 274 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 01:09:14,950 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 210 flow [2025-01-10 01:09:14,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2025-01-10 01:09:14,952 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-01-10 01:09:14,953 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 210 flow [2025-01-10 01:09:14,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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-01-10 01:09:14,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:14,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:14,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:09:15,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:15,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:15,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:15,155 INFO L85 PathProgramCache]: Analyzing trace with hash -929879747, now seen corresponding path program 1 times [2025-01-10 01:09:15,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:15,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449498598] [2025-01-10 01:09:15,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:15,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:15,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:09:15,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:09:15,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:15,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:15,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-01-10 01:09:15,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449498598] [2025-01-10 01:09:15,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449498598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:15,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:15,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:15,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362932717] [2025-01-10 01:09:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:15,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:15,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:15,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:15,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:15,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-01-10 01:09:15,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-01-10 01:09:15,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:15,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-01-10 01:09:15,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:16,165 INFO L124 PetriNetUnfolderBase]: 10699/14788 cut-off events. [2025-01-10 01:09:16,165 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:09:16,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28443 conditions, 14788 events. 10699/14788 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 96486 event pairs, 7188 based on Foata normal form. 310/9081 useless extension candidates. Maximal degree in co-relation 25266. Up to 11911 conditions per place. [2025-01-10 01:09:16,245 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 78 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2025-01-10 01:09:16,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 488 flow [2025-01-10 01:09:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2025-01-10 01:09:16,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2025-01-10 01:09:16,247 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 210 flow. Second operand 5 states and 207 transitions. [2025-01-10 01:09:16,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 488 flow [2025-01-10 01:09:16,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 435 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-01-10 01:09:16,251 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 216 flow [2025-01-10 01:09:16,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2025-01-10 01:09:16,253 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-01-10 01:09:16,253 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 216 flow [2025-01-10 01:09:16,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-01-10 01:09:16,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:16,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:16,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:09:16,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:16,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1478854792, now seen corresponding path program 1 times [2025-01-10 01:09:16,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:16,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139265553] [2025-01-10 01:09:16,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:16,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:16,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:16,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:16,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:16,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:16,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139265553] [2025-01-10 01:09:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139265553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:16,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:16,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:16,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573719968] [2025-01-10 01:09:16,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:16,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:16,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:16,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:16,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2025-01-10 01:09:16,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-01-10 01:09:16,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:16,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2025-01-10 01:09:16,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:16,828 INFO L124 PetriNetUnfolderBase]: 7338/10918 cut-off events. [2025-01-10 01:09:16,828 INFO L125 PetriNetUnfolderBase]: For 1020/1020 co-relation queries the response was YES. [2025-01-10 01:09:16,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22431 conditions, 10918 events. 7338/10918 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 75788 event pairs, 5000 based on Foata normal form. 0/7312 useless extension candidates. Maximal degree in co-relation 19294. Up to 9259 conditions per place. [2025-01-10 01:09:16,895 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 42 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2025-01-10 01:09:16,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 67 transitions, 308 flow [2025-01-10 01:09:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2025-01-10 01:09:16,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2025-01-10 01:09:16,896 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 216 flow. Second operand 5 states and 158 transitions. [2025-01-10 01:09:16,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 67 transitions, 308 flow [2025-01-10 01:09:16,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:16,903 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 219 flow [2025-01-10 01:09:16,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2025-01-10 01:09:16,908 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-01-10 01:09:16,909 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 219 flow [2025-01-10 01:09:16,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-01-10 01:09:16,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:16,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:16,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:09:16,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:16,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1399699827, now seen corresponding path program 1 times [2025-01-10 01:09:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:16,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344454497] [2025-01-10 01:09:16,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:16,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:16,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:16,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:16,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:16,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:16,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344454497] [2025-01-10 01:09:16,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344454497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:16,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:16,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24695378] [2025-01-10 01:09:16,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:16,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:16,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:16,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:16,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2025-01-10 01:09:16,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-01-10 01:09:16,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:16,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2025-01-10 01:09:16,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:17,303 INFO L124 PetriNetUnfolderBase]: 4931/7563 cut-off events. [2025-01-10 01:09:17,303 INFO L125 PetriNetUnfolderBase]: For 715/715 co-relation queries the response was YES. [2025-01-10 01:09:17,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15458 conditions, 7563 events. 4931/7563 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 51749 event pairs, 3374 based on Foata normal form. 0/5512 useless extension candidates. Maximal degree in co-relation 13232. Up to 6266 conditions per place. [2025-01-10 01:09:17,347 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 43 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2025-01-10 01:09:17,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 311 flow [2025-01-10 01:09:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-01-10 01:09:17,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 01:09:17,348 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 219 flow. Second operand 4 states and 132 transitions. [2025-01-10 01:09:17,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 311 flow [2025-01-10 01:09:17,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:09:17,351 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 213 flow [2025-01-10 01:09:17,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2025-01-10 01:09:17,354 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-01-10 01:09:17,354 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 213 flow [2025-01-10 01:09:17,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-01-10 01:09:17,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:17,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:17,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:09:17,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:17,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1399699826, now seen corresponding path program 1 times [2025-01-10 01:09:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:17,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799269094] [2025-01-10 01:09:17,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:17,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:17,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:17,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:17,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:17,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799269094] [2025-01-10 01:09:17,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799269094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:17,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:17,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110559197] [2025-01-10 01:09:17,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:17,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:17,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:17,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:17,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:17,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-01-10 01:09:17,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-01-10 01:09:17,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:17,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-01-10 01:09:17,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:17,856 INFO L124 PetriNetUnfolderBase]: 5763/8899 cut-off events. [2025-01-10 01:09:17,856 INFO L125 PetriNetUnfolderBase]: For 863/863 co-relation queries the response was YES. [2025-01-10 01:09:17,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18413 conditions, 8899 events. 5763/8899 cut-off events. For 863/863 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 62976 event pairs, 4040 based on Foata normal form. 197/6680 useless extension candidates. Maximal degree in co-relation 13126. Up to 6282 conditions per place. [2025-01-10 01:09:17,900 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 63 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2025-01-10 01:09:17,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 87 transitions, 413 flow [2025-01-10 01:09:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2025-01-10 01:09:17,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6325757575757576 [2025-01-10 01:09:17,901 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 213 flow. Second operand 4 states and 167 transitions. [2025-01-10 01:09:17,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 87 transitions, 413 flow [2025-01-10 01:09:17,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:17,903 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 231 flow [2025-01-10 01:09:17,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2025-01-10 01:09:17,904 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-01-10 01:09:17,904 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 231 flow [2025-01-10 01:09:17,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-01-10 01:09:17,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:17,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:17,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:09:17,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:17,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:17,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1478854791, now seen corresponding path program 1 times [2025-01-10 01:09:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:17,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923255743] [2025-01-10 01:09:17,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:17,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:17,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:17,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:17,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:17,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:18,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:18,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923255743] [2025-01-10 01:09:18,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923255743] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:18,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197351105] [2025-01-10 01:09:18,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:18,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:18,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:18,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:18,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:09:18,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:18,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:18,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:18,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:18,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:09:18,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:18,090 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-01-10 01:09:18,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:09:18,127 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-01-10 01:09:18,137 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:09:18,138 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-01-10 01:09:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:18,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:09:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197351105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:09:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-01-10 01:09:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038472550] [2025-01-10 01:09:18,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:18,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:18,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:18,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:18,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:09:18,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2025-01-10 01:09:18,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-01-10 01:09:18,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:18,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2025-01-10 01:09:18,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:18,451 INFO L124 PetriNetUnfolderBase]: 3675/5891 cut-off events. [2025-01-10 01:09:18,451 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2025-01-10 01:09:18,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12836 conditions, 5891 events. 3675/5891 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 41245 event pairs, 2627 based on Foata normal form. 0/4746 useless extension candidates. Maximal degree in co-relation 8369. Up to 4883 conditions per place. [2025-01-10 01:09:18,479 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 42 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-01-10 01:09:18,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 315 flow [2025-01-10 01:09:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-01-10 01:09:18,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2025-01-10 01:09:18,480 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 231 flow. Second operand 4 states and 130 transitions. [2025-01-10 01:09:18,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 315 flow [2025-01-10 01:09:18,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:18,482 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 226 flow [2025-01-10 01:09:18,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-01-10 01:09:18,483 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-01-10 01:09:18,483 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 226 flow [2025-01-10 01:09:18,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-01-10 01:09:18,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:18,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:18,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:09:18,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:18,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:18,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2000285675, now seen corresponding path program 1 times [2025-01-10 01:09:18,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:18,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554626123] [2025-01-10 01:09:18,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:18,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:18,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:09:18,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:09:18,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:18,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:18,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554626123] [2025-01-10 01:09:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554626123] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932621461] [2025-01-10 01:09:18,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:18,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:18,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:18,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:18,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:09:18,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:09:18,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:09:18,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:18,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:18,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:09:18,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:18,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:09:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932621461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:18,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:09:18,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:09:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330056800] [2025-01-10 01:09:18,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:18,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:18,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:18,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:09:18,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-01-10 01:09:18,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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-01-10 01:09:18,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:18,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-01-10 01:09:18,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:19,146 INFO L124 PetriNetUnfolderBase]: 2432/4203 cut-off events. [2025-01-10 01:09:19,147 INFO L125 PetriNetUnfolderBase]: For 956/956 co-relation queries the response was YES. [2025-01-10 01:09:19,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8679 conditions, 4203 events. 2432/4203 cut-off events. For 956/956 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 29792 event pairs, 1773 based on Foata normal form. 0/3826 useless extension candidates. Maximal degree in co-relation 6725. Up to 3294 conditions per place. [2025-01-10 01:09:19,167 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 37 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-01-10 01:09:19,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 306 flow [2025-01-10 01:09:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-01-10 01:09:19,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-01-10 01:09:19,169 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 226 flow. Second operand 4 states and 136 transitions. [2025-01-10 01:09:19,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 306 flow [2025-01-10 01:09:19,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:19,171 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 227 flow [2025-01-10 01:09:19,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-01-10 01:09:19,171 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-01-10 01:09:19,171 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 227 flow [2025-01-10 01:09:19,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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-01-10 01:09:19,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:19,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:19,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:09:19,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:09:19,373 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:19,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:19,373 INFO L85 PathProgramCache]: Analyzing trace with hash 505653076, now seen corresponding path program 1 times [2025-01-10 01:09:19,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:19,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236258598] [2025-01-10 01:09:19,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:19,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:19,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:09:19,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:09:19,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:19,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:19,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:19,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236258598] [2025-01-10 01:09:19,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236258598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:19,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:19,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:19,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388702035] [2025-01-10 01:09:19,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:19,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:19,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:19,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:19,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-01-10 01:09:19,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-01-10 01:09:19,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:19,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-01-10 01:09:19,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:19,692 INFO L124 PetriNetUnfolderBase]: 3680/6033 cut-off events. [2025-01-10 01:09:19,692 INFO L125 PetriNetUnfolderBase]: For 1502/1502 co-relation queries the response was YES. [2025-01-10 01:09:19,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12694 conditions, 6033 events. 3680/6033 cut-off events. For 1502/1502 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 40742 event pairs, 1008 based on Foata normal form. 4/5681 useless extension candidates. Maximal degree in co-relation 10215. Up to 2879 conditions per place. [2025-01-10 01:09:19,716 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 56 selfloop transitions, 3 changer transitions 2/78 dead transitions. [2025-01-10 01:09:19,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 396 flow [2025-01-10 01:09:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-01-10 01:09:19,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-01-10 01:09:19,717 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 227 flow. Second operand 3 states and 126 transitions. [2025-01-10 01:09:19,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 396 flow [2025-01-10 01:09:19,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:19,719 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 226 flow [2025-01-10 01:09:19,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-01-10 01:09:19,719 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-01-10 01:09:19,720 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 226 flow [2025-01-10 01:09:19,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-01-10 01:09:19,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:19,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:19,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:09:19,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:19,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1756728869, now seen corresponding path program 1 times [2025-01-10 01:09:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318240550] [2025-01-10 01:09:19,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:19,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:09:19,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:09:19,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:19,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:19,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318240550] [2025-01-10 01:09:19,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318240550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:19,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:19,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:19,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414156022] [2025-01-10 01:09:19,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:19,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:19,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:19,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:19,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:19,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-01-10 01:09:19,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-01-10 01:09:19,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:19,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-01-10 01:09:19,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:20,086 INFO L124 PetriNetUnfolderBase]: 3845/6172 cut-off events. [2025-01-10 01:09:20,086 INFO L125 PetriNetUnfolderBase]: For 3335/3335 co-relation queries the response was YES. [2025-01-10 01:09:20,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14166 conditions, 6172 events. 3845/6172 cut-off events. For 3335/3335 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 41760 event pairs, 1389 based on Foata normal form. 146/5947 useless extension candidates. Maximal degree in co-relation 12007. Up to 2974 conditions per place. [2025-01-10 01:09:20,110 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 65 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-01-10 01:09:20,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 426 flow [2025-01-10 01:09:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-01-10 01:09:20,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2025-01-10 01:09:20,111 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 226 flow. Second operand 3 states and 130 transitions. [2025-01-10 01:09:20,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 426 flow [2025-01-10 01:09:20,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 84 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:20,114 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 237 flow [2025-01-10 01:09:20,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-01-10 01:09:20,114 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-01-10 01:09:20,114 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 237 flow [2025-01-10 01:09:20,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-01-10 01:09:20,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:20,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:20,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:09:20,115 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:20,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1356659471, now seen corresponding path program 1 times [2025-01-10 01:09:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:20,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552738850] [2025-01-10 01:09:20,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:20,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:20,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:09:20,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:09:20,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:20,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:20,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:20,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552738850] [2025-01-10 01:09:20,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552738850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:20,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:20,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:20,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998428504] [2025-01-10 01:09:20,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:20,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:20,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:20,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:20,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:20,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-01-10 01:09:20,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-01-10 01:09:20,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:20,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-01-10 01:09:20,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:20,501 INFO L124 PetriNetUnfolderBase]: 4172/6927 cut-off events. [2025-01-10 01:09:20,501 INFO L125 PetriNetUnfolderBase]: For 4717/4767 co-relation queries the response was YES. [2025-01-10 01:09:20,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16154 conditions, 6927 events. 4172/6927 cut-off events. For 4717/4767 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 49328 event pairs, 1683 based on Foata normal form. 96/6762 useless extension candidates. Maximal degree in co-relation 13932. Up to 3185 conditions per place. [2025-01-10 01:09:20,530 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 65 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-01-10 01:09:20,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 442 flow [2025-01-10 01:09:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-01-10 01:09:20,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-01-10 01:09:20,531 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 237 flow. Second operand 3 states and 128 transitions. [2025-01-10 01:09:20,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 442 flow [2025-01-10 01:09:20,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:20,534 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 249 flow [2025-01-10 01:09:20,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2025-01-10 01:09:20,535 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-01-10 01:09:20,535 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 249 flow [2025-01-10 01:09:20,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-01-10 01:09:20,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:20,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:20,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:09:20,535 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:20,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2003500006, now seen corresponding path program 1 times [2025-01-10 01:09:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:20,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715257896] [2025-01-10 01:09:20,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:20,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:20,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:09:20,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:09:20,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:20,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:20,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:20,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715257896] [2025-01-10 01:09:20,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715257896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:20,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:20,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:20,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915678396] [2025-01-10 01:09:20,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:20,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:20,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:20,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:20,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-01-10 01:09:20,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 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-01-10 01:09:20,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:20,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-01-10 01:09:20,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:21,622 INFO L124 PetriNetUnfolderBase]: 10172/15412 cut-off events. [2025-01-10 01:09:21,622 INFO L125 PetriNetUnfolderBase]: For 10612/10692 co-relation queries the response was YES. [2025-01-10 01:09:21,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37965 conditions, 15412 events. 10172/15412 cut-off events. For 10612/10692 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 104983 event pairs, 813 based on Foata normal form. 354/14924 useless extension candidates. Maximal degree in co-relation 32266. Up to 7997 conditions per place. [2025-01-10 01:09:21,686 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 128 selfloop transitions, 15 changer transitions 3/158 dead transitions. [2025-01-10 01:09:21,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 158 transitions, 827 flow [2025-01-10 01:09:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:09:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:09:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 293 transitions. [2025-01-10 01:09:21,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5549242424242424 [2025-01-10 01:09:21,687 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 249 flow. Second operand 8 states and 293 transitions. [2025-01-10 01:09:21,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 158 transitions, 827 flow [2025-01-10 01:09:21,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 158 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:21,691 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 362 flow [2025-01-10 01:09:21,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=362, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2025-01-10 01:09:21,692 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 17 predicate places. [2025-01-10 01:09:21,692 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 362 flow [2025-01-10 01:09:21,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 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-01-10 01:09:21,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:21,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:21,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:09:21,692 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash -531101246, now seen corresponding path program 2 times [2025-01-10 01:09:21,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:21,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082398648] [2025-01-10 01:09:21,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:21,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 01:09:21,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 38 statements. [2025-01-10 01:09:21,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:09:21,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:09:21,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082398648] [2025-01-10 01:09:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082398648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:21,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:21,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:09:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110223643] [2025-01-10 01:09:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:21,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:21,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:21,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:21,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:22,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-01-10 01:09:22,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 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-01-10 01:09:22,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:22,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-01-10 01:09:22,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:24,311 INFO L124 PetriNetUnfolderBase]: 22991/33840 cut-off events. [2025-01-10 01:09:24,312 INFO L125 PetriNetUnfolderBase]: For 45554/47550 co-relation queries the response was YES. [2025-01-10 01:09:24,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99264 conditions, 33840 events. 22991/33840 cut-off events. For 45554/47550 co-relation queries the response was YES. Maximal size of possible extension queue 1587. Compared 247522 event pairs, 5147 based on Foata normal form. 691/32046 useless extension candidates. Maximal degree in co-relation 91172. Up to 11900 conditions per place. [2025-01-10 01:09:24,556 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 142 selfloop transitions, 21 changer transitions 0/183 dead transitions. [2025-01-10 01:09:24,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 183 transitions, 1222 flow [2025-01-10 01:09:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:09:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:09:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2025-01-10 01:09:24,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2025-01-10 01:09:24,557 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 362 flow. Second operand 6 states and 236 transitions. [2025-01-10 01:09:24,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 183 transitions, 1222 flow [2025-01-10 01:09:24,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 183 transitions, 1222 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:09:24,620 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 617 flow [2025-01-10 01:09:24,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=617, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2025-01-10 01:09:24,620 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2025-01-10 01:09:24,621 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 617 flow [2025-01-10 01:09:24,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 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-01-10 01:09:24,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:24,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:24,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:09:24,621 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:24,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:24,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1265345228, now seen corresponding path program 3 times [2025-01-10 01:09:24,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:24,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766590661] [2025-01-10 01:09:24,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:09:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:24,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-01-10 01:09:24,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 38 statements. [2025-01-10 01:09:24,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:09:24,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:24,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:24,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766590661] [2025-01-10 01:09:24,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766590661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:24,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:24,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:24,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529398509] [2025-01-10 01:09:24,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:24,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:24,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:24,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:24,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:24,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2025-01-10 01:09:24,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-01-10 01:09:24,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:24,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2025-01-10 01:09:24,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:29,917 INFO L124 PetriNetUnfolderBase]: 45287/64453 cut-off events. [2025-01-10 01:09:29,917 INFO L125 PetriNetUnfolderBase]: For 199487/201548 co-relation queries the response was YES. [2025-01-10 01:09:30,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232056 conditions, 64453 events. 45287/64453 cut-off events. For 199487/201548 co-relation queries the response was YES. Maximal size of possible extension queue 2796. Compared 463513 event pairs, 4078 based on Foata normal form. 2154/65823 useless extension candidates. Maximal degree in co-relation 221967. Up to 24181 conditions per place. [2025-01-10 01:09:30,390 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 199 selfloop transitions, 33 changer transitions 3/249 dead transitions. [2025-01-10 01:09:30,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 249 transitions, 2091 flow [2025-01-10 01:09:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:09:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:09:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions. [2025-01-10 01:09:30,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5735930735930735 [2025-01-10 01:09:30,391 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 617 flow. Second operand 7 states and 265 transitions. [2025-01-10 01:09:30,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 249 transitions, 2091 flow [2025-01-10 01:09:31,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 249 transitions, 2031 flow, removed 30 selfloop flow, removed 0 redundant places. [2025-01-10 01:09:31,360 INFO L231 Difference]: Finished difference. Result has 104 places, 123 transitions, 928 flow [2025-01-10 01:09:31,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=928, PETRI_PLACES=104, PETRI_TRANSITIONS=123} [2025-01-10 01:09:31,360 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2025-01-10 01:09:31,360 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 123 transitions, 928 flow [2025-01-10 01:09:31,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-01-10 01:09:31,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:31,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:31,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:09:31,361 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:31,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:31,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1576173614, now seen corresponding path program 4 times [2025-01-10 01:09:31,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:31,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378088997] [2025-01-10 01:09:31,363 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:09:31,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:31,371 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-10 01:09:31,383 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:09:31,384 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:09:31,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:31,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:31,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378088997] [2025-01-10 01:09:31,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378088997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:31,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:31,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:31,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115111042] [2025-01-10 01:09:31,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:31,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:31,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:31,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:31,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:31,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-01-10 01:09:31,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 123 transitions, 928 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 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-01-10 01:09:31,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:31,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-01-10 01:09:31,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:37,602 INFO L124 PetriNetUnfolderBase]: 41956/62927 cut-off events. [2025-01-10 01:09:37,603 INFO L125 PetriNetUnfolderBase]: For 246158/249091 co-relation queries the response was YES. [2025-01-10 01:09:37,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250046 conditions, 62927 events. 41956/62927 cut-off events. For 246158/249091 co-relation queries the response was YES. Maximal size of possible extension queue 2944. Compared 503856 event pairs, 6495 based on Foata normal form. 1429/62969 useless extension candidates. Maximal degree in co-relation 238759. Up to 20902 conditions per place. [2025-01-10 01:09:38,355 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 205 selfloop transitions, 55 changer transitions 1/278 dead transitions. [2025-01-10 01:09:38,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 278 transitions, 2467 flow [2025-01-10 01:09:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:09:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:09:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 332 transitions. [2025-01-10 01:09:38,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5589225589225589 [2025-01-10 01:09:38,357 INFO L175 Difference]: Start difference. First operand has 104 places, 123 transitions, 928 flow. Second operand 9 states and 332 transitions. [2025-01-10 01:09:38,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 278 transitions, 2467 flow [2025-01-10 01:09:40,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 278 transitions, 2452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:40,504 INFO L231 Difference]: Finished difference. Result has 117 places, 143 transitions, 1328 flow [2025-01-10 01:09:40,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1328, PETRI_PLACES=117, PETRI_TRANSITIONS=143} [2025-01-10 01:09:40,505 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 49 predicate places. [2025-01-10 01:09:40,505 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 143 transitions, 1328 flow [2025-01-10 01:09:40,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 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-01-10 01:09:40,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:40,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:40,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:09:40,505 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:40,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash 829566048, now seen corresponding path program 5 times [2025-01-10 01:09:40,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:40,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975433397] [2025-01-10 01:09:40,510 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:09:40,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:40,525 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-01-10 01:09:40,546 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:09:40,546 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:09:40,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:40,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:40,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975433397] [2025-01-10 01:09:40,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975433397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:40,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:40,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:40,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107332055] [2025-01-10 01:09:40,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:40,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:40,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:40,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:40,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2025-01-10 01:09:40,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 143 transitions, 1328 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-01-10 01:09:40,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:40,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2025-01-10 01:09:40,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:48,552 INFO L124 PetriNetUnfolderBase]: 54959/79102 cut-off events. [2025-01-10 01:09:48,552 INFO L125 PetriNetUnfolderBase]: For 404271/407513 co-relation queries the response was YES. [2025-01-10 01:09:49,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344167 conditions, 79102 events. 54959/79102 cut-off events. For 404271/407513 co-relation queries the response was YES. Maximal size of possible extension queue 3503. Compared 599878 event pairs, 10349 based on Foata normal form. 1935/79531 useless extension candidates. Maximal degree in co-relation 329737. Up to 59533 conditions per place. [2025-01-10 01:09:49,436 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 207 selfloop transitions, 52 changer transitions 9/282 dead transitions. [2025-01-10 01:09:49,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 282 transitions, 2924 flow [2025-01-10 01:09:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:09:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:09:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 319 transitions. [2025-01-10 01:09:49,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-01-10 01:09:49,437 INFO L175 Difference]: Start difference. First operand has 117 places, 143 transitions, 1328 flow. Second operand 9 states and 319 transitions. [2025-01-10 01:09:49,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 282 transitions, 2924 flow [2025-01-10 01:09:53,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 282 transitions, 2803 flow, removed 22 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:53,487 INFO L231 Difference]: Finished difference. Result has 129 places, 174 transitions, 1939 flow [2025-01-10 01:09:53,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1939, PETRI_PLACES=129, PETRI_TRANSITIONS=174} [2025-01-10 01:09:53,489 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2025-01-10 01:09:53,489 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 174 transitions, 1939 flow [2025-01-10 01:09:53,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-01-10 01:09:53,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:53,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:53,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:09:53,489 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:53,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1913447944, now seen corresponding path program 6 times [2025-01-10 01:09:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:53,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890642561] [2025-01-10 01:09:53,490 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:09:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:53,497 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 3 equivalence classes. [2025-01-10 01:09:53,523 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:09:53,523 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:09:53,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:53,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890642561] [2025-01-10 01:09:53,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890642561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:53,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:53,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828244828] [2025-01-10 01:09:53,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:53,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:53,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:53,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:53,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-01-10 01:09:53,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 174 transitions, 1939 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 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-01-10 01:09:53,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:53,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-01-10 01:09:53,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand