./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/test-context1.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/test-context1.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 d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:13:28,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:13:28,297 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:13:28,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:13:28,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:13:28,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:13:28,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:13:28,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:13:28,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:13:28,335 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:13:28,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:13:28,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:13:28,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:13:28,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:13:28,336 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:13:28,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:13:28,336 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:13:28,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:13:28,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:13:28,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:13:28,337 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:13:28,337 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:13:28,337 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:13:28,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:13:28,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:13:28,337 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:13:28,337 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:13:28,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:13:28,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:13:28,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:13:28,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:28,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:28,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:28,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:28,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:13:28,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:28,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:28,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:28,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:28,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:13:28,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:13:28,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:13:28,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:13:28,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:13:28,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:13:28,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:13:28,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:13:28,340 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 -> d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e [2025-01-10 01:13:28,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:13:28,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:13:28,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:13:28,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:13:28,603 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:13:28,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-context1.wvr.c [2025-01-10 01:13:29,787 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10403f9de/44ef55ed0e49479e99adb90949213238/FLAG84a71dc01 [2025-01-10 01:13:30,031 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:13:30,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-context1.wvr.c [2025-01-10 01:13:30,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10403f9de/44ef55ed0e49479e99adb90949213238/FLAG84a71dc01 [2025-01-10 01:13:30,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10403f9de/44ef55ed0e49479e99adb90949213238 [2025-01-10 01:13:30,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:13:30,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:13:30,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:30,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:13:30,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:13:30,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0c952f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30, skipping insertion in model container [2025-01-10 01:13:30,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:13:30,216 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:13:30,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:30,227 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:13:30,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:30,249 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:13:30,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30 WrapperNode [2025-01-10 01:13:30,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:30,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:30,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:13:30,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:13:30,255 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:13:30" (1/1) ... [2025-01-10 01:13:30,260 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:13:30" (1/1) ... [2025-01-10 01:13:30,272 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 124 [2025-01-10 01:13:30,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:30,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:13:30,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:13:30,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:13:30,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,287 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:13:30,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:13:30,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:13:30,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:13:30,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:13:30,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (1/1) ... [2025-01-10 01:13:30,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:30,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:30,326 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:13:30,331 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:13:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:13:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:13:30,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:13:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:13:30,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:13:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:13:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:13:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:13:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:13:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:13:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:13:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:13:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:13:30,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:13:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:13:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:13:30,349 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:13:30,423 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:13:30,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:13:30,581 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:13:30,582 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:13:30,685 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:13:30,685 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:13:30,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:30 BoogieIcfgContainer [2025-01-10 01:13:30,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:13:30,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:13:30,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:13:30,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:13:30,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:13:30" (1/3) ... [2025-01-10 01:13:30,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438fb8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:30, skipping insertion in model container [2025-01-10 01:13:30,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:30" (2/3) ... [2025-01-10 01:13:30,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438fb8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:30, skipping insertion in model container [2025-01-10 01:13:30,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:30" (3/3) ... [2025-01-10 01:13:30,692 INFO L128 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2025-01-10 01:13:30,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:13:30,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-context1.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-01-10 01:13:30,703 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:13:30,745 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:13:30,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 88 flow [2025-01-10 01:13:30,783 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-01-10 01:13:30,784 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:13:30,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 5/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-01-10 01:13:30,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 88 flow [2025-01-10 01:13:30,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 34 transitions, 80 flow [2025-01-10 01:13:30,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:13:30,801 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;@1205bf8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:13:30,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-10 01:13:30,804 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:13:30,804 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:13:30,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:13:30,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:30,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:30,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:30,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:30,809 INFO L85 PathProgramCache]: Analyzing trace with hash 416988, now seen corresponding path program 1 times [2025-01-10 01:13:30,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:30,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334164440] [2025-01-10 01:13:30,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:30,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:30,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:30,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:30,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:30,959 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:13:30,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:30,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334164440] [2025-01-10 01:13:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334164440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:30,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:30,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:13:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510440283] [2025-01-10 01:13:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:30,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:30,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:30,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:30,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:30,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-10 01:13:30,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:13:30,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:30,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-10 01:13:30,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:31,081 INFO L124 PetriNetUnfolderBase]: 212/371 cut-off events. [2025-01-10 01:13:31,081 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-10 01:13:31,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 371 events. 212/371 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1443 event pairs, 176 based on Foata normal form. 1/265 useless extension candidates. Maximal degree in co-relation 705. Up to 364 conditions per place. [2025-01-10 01:13:31,086 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-01-10 01:13:31,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 120 flow [2025-01-10 01:13:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-01-10 01:13:31,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-01-10 01:13:31,095 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 80 flow. Second operand 3 states and 50 transitions. [2025-01-10 01:13:31,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 120 flow [2025-01-10 01:13:31,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:13:31,099 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2025-01-10 01:13:31,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-01-10 01:13:31,102 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-01-10 01:13:31,102 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2025-01-10 01:13:31,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:13:31,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:31,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:31,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:13:31,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:31,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash 416989, now seen corresponding path program 1 times [2025-01-10 01:13:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:31,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427015664] [2025-01-10 01:13:31,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:31,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:31,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:31,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:31,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:31,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:31,312 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:13:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:31,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427015664] [2025-01-10 01:13:31,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427015664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:31,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747182955] [2025-01-10 01:13:31,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:31,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:31,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:31,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:31,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-10 01:13:31,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:13:31,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:31,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-10 01:13:31,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:31,426 INFO L124 PetriNetUnfolderBase]: 213/374 cut-off events. [2025-01-10 01:13:31,426 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:13:31,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 374 events. 213/374 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1458 event pairs, 176 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 737. Up to 369 conditions per place. [2025-01-10 01:13:31,429 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-01-10 01:13:31,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 132 flow [2025-01-10 01:13:31,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-01-10 01:13:31,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2025-01-10 01:13:31,431 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 58 transitions. [2025-01-10 01:13:31,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 132 flow [2025-01-10 01:13:31,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:31,434 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2025-01-10 01:13:31,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-01-10 01:13:31,436 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-01-10 01:13:31,436 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2025-01-10 01:13:31,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:13:31,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:31,436 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:13:31,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:13:31,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:31,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash 400738837, now seen corresponding path program 1 times [2025-01-10 01:13:31,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:31,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521138137] [2025-01-10 01:13:31,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:31,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:31,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:13:31,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:13:31,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:31,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:31,730 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:13:31,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:31,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521138137] [2025-01-10 01:13:31,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521138137] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:31,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687017936] [2025-01-10 01:13:31,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:31,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:31,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:31,735 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:13:31,736 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:13:31,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:13:31,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:13:31,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:31,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:31,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:13:31,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:31,838 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:13:32,029 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:13:32,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:32,147 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:13:32,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687017936] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:32,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:32,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:13:32,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441666229] [2025-01-10 01:13:32,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:32,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:13:32,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:32,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:13:32,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:13:32,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-10 01:13:32,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:13:32,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:32,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-10 01:13:32,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:32,351 INFO L124 PetriNetUnfolderBase]: 213/373 cut-off events. [2025-01-10 01:13:32,352 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:13:32,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 373 events. 213/373 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1457 event pairs, 176 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 744. Up to 365 conditions per place. [2025-01-10 01:13:32,354 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 21 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2025-01-10 01:13:32,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 141 flow [2025-01-10 01:13:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:13:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:13:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2025-01-10 01:13:32,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31981981981981983 [2025-01-10 01:13:32,355 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 6 states and 71 transitions. [2025-01-10 01:13:32,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 141 flow [2025-01-10 01:13:32,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:32,356 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 96 flow [2025-01-10 01:13:32,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2025-01-10 01:13:32,358 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-01-10 01:13:32,358 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 96 flow [2025-01-10 01:13:32,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:13:32,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:32,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:32,368 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:13:32,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:32,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:32,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1379630689, now seen corresponding path program 1 times [2025-01-10 01:13:32,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:32,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523951448] [2025-01-10 01:13:32,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:32,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:32,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:13:32,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:13:32,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:32,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:32,608 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:13:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523951448] [2025-01-10 01:13:32,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523951448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:32,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:32,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:32,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180684752] [2025-01-10 01:13:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:32,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:32,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:32,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:32,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-10 01:13:32,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:13:32,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:32,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-10 01:13:32,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:32,665 INFO L124 PetriNetUnfolderBase]: 165/292 cut-off events. [2025-01-10 01:13:32,665 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:13:32,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 292 events. 165/292 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1047 event pairs, 132 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 582. Up to 283 conditions per place. [2025-01-10 01:13:32,667 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2025-01-10 01:13:32,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 144 flow [2025-01-10 01:13:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-01-10 01:13:32,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3581081081081081 [2025-01-10 01:13:32,668 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 96 flow. Second operand 4 states and 53 transitions. [2025-01-10 01:13:32,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 144 flow [2025-01-10 01:13:32,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 114 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 01:13:32,669 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 68 flow [2025-01-10 01:13:32,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-01-10 01:13:32,670 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-01-10 01:13:32,670 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 68 flow [2025-01-10 01:13:32,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:13:32,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:32,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:32,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:13:32,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:32,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1379630688, now seen corresponding path program 1 times [2025-01-10 01:13:32,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:32,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938369967] [2025-01-10 01:13:32,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:32,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:32,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:13:32,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:13:32,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:32,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:32,735 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:13:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:32,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938369967] [2025-01-10 01:13:32,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938369967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:32,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:32,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855529995] [2025-01-10 01:13:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:32,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:32,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:32,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:32,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:32,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:32,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:13:32,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:32,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:32,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:32,848 INFO L124 PetriNetUnfolderBase]: 232/431 cut-off events. [2025-01-10 01:13:32,848 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 01:13:32,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 431 events. 232/431 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1796 event pairs, 200 based on Foata normal form. 23/368 useless extension candidates. Maximal degree in co-relation 574. Up to 286 conditions per place. [2025-01-10 01:13:32,851 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 36 selfloop transitions, 3 changer transitions 2/44 dead transitions. [2025-01-10 01:13:32,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 184 flow [2025-01-10 01:13:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-01-10 01:13:32,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2025-01-10 01:13:32,853 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 68 flow. Second operand 4 states and 77 transitions. [2025-01-10 01:13:32,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 184 flow [2025-01-10 01:13:32,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:32,854 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 79 flow [2025-01-10 01:13:32,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-01-10 01:13:32,855 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2025-01-10 01:13:32,857 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 79 flow [2025-01-10 01:13:32,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:13:32,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:32,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:32,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:13:32,857 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:32,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:32,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2058851032, now seen corresponding path program 1 times [2025-01-10 01:13:32,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:32,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975950176] [2025-01-10 01:13:32,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:32,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:32,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:13:32,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:13:32,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:32,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:33,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:33,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975950176] [2025-01-10 01:13:33,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975950176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:33,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981128327] [2025-01-10 01:13:33,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:33,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:33,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:33,029 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:13:33,031 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:13:33,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:13:33,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:13:33,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:33,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:33,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:13:33,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:33,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:33,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-01-10 01:13:33,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:33,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981128327] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:33,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:33,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:13:33,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160756841] [2025-01-10 01:13:33,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:33,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:13:33,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:33,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:13:33,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:13:33,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:33,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 79 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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:13:33,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:33,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:33,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:33,525 INFO L124 PetriNetUnfolderBase]: 289/543 cut-off events. [2025-01-10 01:13:33,526 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-10 01:13:33,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 543 events. 289/543 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2344 event pairs, 248 based on Foata normal form. 11/446 useless extension candidates. Maximal degree in co-relation 876. Up to 392 conditions per place. [2025-01-10 01:13:33,529 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 37 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2025-01-10 01:13:33,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 201 flow [2025-01-10 01:13:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-01-10 01:13:33,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2025-01-10 01:13:33,530 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 79 flow. Second operand 5 states and 85 transitions. [2025-01-10 01:13:33,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 201 flow [2025-01-10 01:13:33,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:33,531 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 98 flow [2025-01-10 01:13:33,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2025-01-10 01:13:33,532 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-01-10 01:13:33,532 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 98 flow [2025-01-10 01:13:33,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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:13:33,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:33,532 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:33,542 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:13:33,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:33,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:33,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1196438764, now seen corresponding path program 1 times [2025-01-10 01:13:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606651830] [2025-01-10 01:13:33,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:33,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:13:33,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:13:33,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:33,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:33,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:33,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606651830] [2025-01-10 01:13:33,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606651830] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:33,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607658276] [2025-01-10 01:13:33,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:33,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:33,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:33,902 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:13:33,903 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:13:33,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:13:33,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:13:33,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:33,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:33,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:13:33,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:34,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:34,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607658276] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:34,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:34,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-10 01:13:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94793217] [2025-01-10 01:13:34,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:34,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:13:34,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:34,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:13:34,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:13:34,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:34,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 98 flow. Second operand has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 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:13:34,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:34,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:34,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:34,504 INFO L124 PetriNetUnfolderBase]: 547/1012 cut-off events. [2025-01-10 01:13:34,505 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2025-01-10 01:13:34,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 1012 events. 547/1012 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4972 event pairs, 341 based on Foata normal form. 24/839 useless extension candidates. Maximal degree in co-relation 1051. Up to 401 conditions per place. [2025-01-10 01:13:34,510 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 79 selfloop transitions, 10 changer transitions 2/94 dead transitions. [2025-01-10 01:13:34,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 94 transitions, 446 flow [2025-01-10 01:13:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:13:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:13:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2025-01-10 01:13:34,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2025-01-10 01:13:34,511 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 98 flow. Second operand 9 states and 166 transitions. [2025-01-10 01:13:34,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 94 transitions, 446 flow [2025-01-10 01:13:34,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 94 transitions, 432 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:34,513 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 165 flow [2025-01-10 01:13:34,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=165, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-01-10 01:13:34,514 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2025-01-10 01:13:34,514 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 165 flow [2025-01-10 01:13:34,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 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:13:34,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:34,514 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:34,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:34,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:34,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:34,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:34,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1838071004, now seen corresponding path program 2 times [2025-01-10 01:13:34,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:34,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139763155] [2025-01-10 01:13:34,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:34,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:34,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 01:13:34,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:13:34,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:34,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:13:34,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:34,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139763155] [2025-01-10 01:13:34,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139763155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:34,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394044259] [2025-01-10 01:13:34,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:34,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:34,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:34,865 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:13:34,866 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:13:34,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 01:13:34,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:13:34,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:34,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:34,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:13:34,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:35,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:35,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-01-10 01:13:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:35,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394044259] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:35,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:35,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2025-01-10 01:13:35,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672966204] [2025-01-10 01:13:35,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:35,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:13:35,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:35,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:13:35,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:13:35,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:35,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 165 flow. Second operand has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 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:13:35,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:35,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:35,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:35,685 INFO L124 PetriNetUnfolderBase]: 648/1201 cut-off events. [2025-01-10 01:13:35,685 INFO L125 PetriNetUnfolderBase]: For 886/886 co-relation queries the response was YES. [2025-01-10 01:13:35,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1201 events. 648/1201 cut-off events. For 886/886 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5976 event pairs, 430 based on Foata normal form. 55/1069 useless extension candidates. Maximal degree in co-relation 1878. Up to 755 conditions per place. [2025-01-10 01:13:35,691 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 65 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2025-01-10 01:13:35,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 414 flow [2025-01-10 01:13:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:13:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:13:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2025-01-10 01:13:35,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2025-01-10 01:13:35,692 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 165 flow. Second operand 9 states and 151 transitions. [2025-01-10 01:13:35,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 414 flow [2025-01-10 01:13:35,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 407 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:35,695 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 185 flow [2025-01-10 01:13:35,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=185, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2025-01-10 01:13:35,696 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2025-01-10 01:13:35,696 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 185 flow [2025-01-10 01:13:35,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 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:13:35,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:35,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:35,705 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:13:35,900 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,SelfDestructingSolverStorable7 [2025-01-10 01:13:35,900 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:35,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1313469082, now seen corresponding path program 1 times [2025-01-10 01:13:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:35,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844723405] [2025-01-10 01:13:35,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:35,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:13:35,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:13:35,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:35,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:35,922 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:13:35,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:35,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844723405] [2025-01-10 01:13:35,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844723405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:35,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:35,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:35,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892908346] [2025-01-10 01:13:35,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:35,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:35,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:35,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:35,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:35,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:35,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:13:35,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:35,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:35,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:36,024 INFO L124 PetriNetUnfolderBase]: 717/1305 cut-off events. [2025-01-10 01:13:36,024 INFO L125 PetriNetUnfolderBase]: For 1093/1093 co-relation queries the response was YES. [2025-01-10 01:13:36,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 1305 events. 717/1305 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6502 event pairs, 441 based on Foata normal form. 6/1104 useless extension candidates. Maximal degree in co-relation 1946. Up to 859 conditions per place. [2025-01-10 01:13:36,030 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 38 selfloop transitions, 4 changer transitions 4/49 dead transitions. [2025-01-10 01:13:36,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 323 flow [2025-01-10 01:13:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-01-10 01:13:36,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5315315315315315 [2025-01-10 01:13:36,031 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 185 flow. Second operand 3 states and 59 transitions. [2025-01-10 01:13:36,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 323 flow [2025-01-10 01:13:36,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 287 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:36,035 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 168 flow [2025-01-10 01:13:36,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-01-10 01:13:36,036 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2025-01-10 01:13:36,036 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 168 flow [2025-01-10 01:13:36,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:13:36,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:36,036 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:36,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:13:36,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:36,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:36,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1474391097, now seen corresponding path program 1 times [2025-01-10 01:13:36,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:36,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464877902] [2025-01-10 01:13:36,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:36,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:36,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:36,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:36,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:36,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:36,292 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:13:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464877902] [2025-01-10 01:13:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464877902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:13:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772212730] [2025-01-10 01:13:36,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:36,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:13:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:36,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:13:36,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:13:36,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:36,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:13:36,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:36,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:36,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:36,490 INFO L124 PetriNetUnfolderBase]: 879/1565 cut-off events. [2025-01-10 01:13:36,490 INFO L125 PetriNetUnfolderBase]: For 1542/1542 co-relation queries the response was YES. [2025-01-10 01:13:36,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 1565 events. 879/1565 cut-off events. For 1542/1542 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7494 event pairs, 136 based on Foata normal form. 3/1323 useless extension candidates. Maximal degree in co-relation 3053. Up to 447 conditions per place. [2025-01-10 01:13:36,496 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 51 selfloop transitions, 9 changer transitions 12/75 dead transitions. [2025-01-10 01:13:36,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 435 flow [2025-01-10 01:13:36,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:13:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:13:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-01-10 01:13:36,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2025-01-10 01:13:36,497 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 168 flow. Second operand 6 states and 110 transitions. [2025-01-10 01:13:36,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 435 flow [2025-01-10 01:13:36,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 411 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:36,501 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 188 flow [2025-01-10 01:13:36,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2025-01-10 01:13:36,501 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2025-01-10 01:13:36,501 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 188 flow [2025-01-10 01:13:36,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:13:36,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:36,502 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:36,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:13:36,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:36,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1328010878, now seen corresponding path program 2 times [2025-01-10 01:13:36,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:36,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000520417] [2025-01-10 01:13:36,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:36,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:36,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:13:36,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:13:36,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:36,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:36,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:36,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000520417] [2025-01-10 01:13:36,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000520417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:36,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:36,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:36,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360408177] [2025-01-10 01:13:36,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:36,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:36,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:36,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:36,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:36,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:36,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:13:36,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:36,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:36,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:36,692 INFO L124 PetriNetUnfolderBase]: 936/1678 cut-off events. [2025-01-10 01:13:36,692 INFO L125 PetriNetUnfolderBase]: For 1663/1663 co-relation queries the response was YES. [2025-01-10 01:13:36,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4122 conditions, 1678 events. 936/1678 cut-off events. For 1663/1663 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7963 event pairs, 409 based on Foata normal form. 33/1445 useless extension candidates. Maximal degree in co-relation 3178. Up to 667 conditions per place. [2025-01-10 01:13:36,698 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 54 selfloop transitions, 9 changer transitions 3/69 dead transitions. [2025-01-10 01:13:36,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 431 flow [2025-01-10 01:13:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-01-10 01:13:36,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5743243243243243 [2025-01-10 01:13:36,699 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 188 flow. Second operand 4 states and 85 transitions. [2025-01-10 01:13:36,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 431 flow [2025-01-10 01:13:36,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 409 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 01:13:36,705 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 226 flow [2025-01-10 01:13:36,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2025-01-10 01:13:36,705 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2025-01-10 01:13:36,706 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 226 flow [2025-01-10 01:13:36,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:13:36,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:36,707 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:36,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:13:36,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:36,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1763821280, now seen corresponding path program 3 times [2025-01-10 01:13:36,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:36,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289694155] [2025-01-10 01:13:36,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:13:36,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:36,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-01-10 01:13:36,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 34 statements. [2025-01-10 01:13:36,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:13:36,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:13:36,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289694155] [2025-01-10 01:13:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289694155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737143375] [2025-01-10 01:13:36,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:13:36,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:36,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:36,857 INFO L229 MonitoredProcess]: Starting monitored process 6 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:13:36,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:13:36,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-01-10 01:13:36,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 34 statements. [2025-01-10 01:13:36,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:13:36,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:36,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:13:36,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:13:37,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:37,048 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:37,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2025-01-10 01:13:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:13:37,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737143375] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:37,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 12 [2025-01-10 01:13:37,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561018031] [2025-01-10 01:13:37,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:37,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:13:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:37,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:13:37,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:13:37,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:37,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 226 flow. Second operand has 13 states, 13 states have (on average 12.076923076923077) internal successors, (157), 13 states have internal predecessors, (157), 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:13:37,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:37,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:37,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:37,418 INFO L124 PetriNetUnfolderBase]: 959/1673 cut-off events. [2025-01-10 01:13:37,418 INFO L125 PetriNetUnfolderBase]: For 2728/2728 co-relation queries the response was YES. [2025-01-10 01:13:37,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4561 conditions, 1673 events. 959/1673 cut-off events. For 2728/2728 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7533 event pairs, 140 based on Foata normal form. 4/1417 useless extension candidates. Maximal degree in co-relation 4526. Up to 300 conditions per place. [2025-01-10 01:13:37,425 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 85 selfloop transitions, 15 changer transitions 45/148 dead transitions. [2025-01-10 01:13:37,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 148 transitions, 831 flow [2025-01-10 01:13:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:13:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:13:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions. [2025-01-10 01:13:37,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-01-10 01:13:37,427 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 226 flow. Second operand 11 states and 231 transitions. [2025-01-10 01:13:37,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 148 transitions, 831 flow [2025-01-10 01:13:37,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 148 transitions, 779 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:37,433 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 294 flow [2025-01-10 01:13:37,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=294, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2025-01-10 01:13:37,433 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2025-01-10 01:13:37,433 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 294 flow [2025-01-10 01:13:37,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.076923076923077) internal successors, (157), 13 states have internal predecessors, (157), 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:13:37,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:37,434 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:37,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:37,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:13:37,634 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:37,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:37,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1974013088, now seen corresponding path program 4 times [2025-01-10 01:13:37,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:37,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944779072] [2025-01-10 01:13:37,635 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:13:37,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:37,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:13:37,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:13:37,658 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:13:37,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:13:37,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:37,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944779072] [2025-01-10 01:13:37,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944779072] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:37,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762076826] [2025-01-10 01:13:37,787 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:13:37,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:37,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:37,789 INFO L229 MonitoredProcess]: Starting monitored process 7 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:13:37,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:13:37,832 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:13:37,854 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:13:37,854 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:13:37,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:37,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:13:37,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:13:38,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:38,145 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:38,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-01-10 01:13:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:13:38,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762076826] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:38,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:38,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 15 [2025-01-10 01:13:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725722296] [2025-01-10 01:13:38,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:38,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:13:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:38,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:13:38,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:13:38,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:38,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 294 flow. Second operand has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 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:13:38,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:38,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:38,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:38,735 INFO L124 PetriNetUnfolderBase]: 1039/1809 cut-off events. [2025-01-10 01:13:38,736 INFO L125 PetriNetUnfolderBase]: For 2791/2791 co-relation queries the response was YES. [2025-01-10 01:13:38,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 1809 events. 1039/1809 cut-off events. For 2791/2791 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8290 event pairs, 104 based on Foata normal form. 1/1529 useless extension candidates. Maximal degree in co-relation 4822. Up to 325 conditions per place. [2025-01-10 01:13:38,744 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 91 selfloop transitions, 18 changer transitions 39/151 dead transitions. [2025-01-10 01:13:38,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 151 transitions, 870 flow [2025-01-10 01:13:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:13:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:13:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 247 transitions. [2025-01-10 01:13:38,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-01-10 01:13:38,746 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 294 flow. Second operand 13 states and 247 transitions. [2025-01-10 01:13:38,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 151 transitions, 870 flow [2025-01-10 01:13:38,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 151 transitions, 786 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-01-10 01:13:38,752 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 267 flow [2025-01-10 01:13:38,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=267, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2025-01-10 01:13:38,753 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2025-01-10 01:13:38,753 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 267 flow [2025-01-10 01:13:38,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 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:13:38,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:38,754 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:38,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:38,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:13:38,962 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:38,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash -789903177, now seen corresponding path program 5 times [2025-01-10 01:13:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589601105] [2025-01-10 01:13:38,963 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:13:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:38,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-01-10 01:13:38,980 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:13:38,981 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:13:38,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:13:39,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:39,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589601105] [2025-01-10 01:13:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589601105] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:39,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564096977] [2025-01-10 01:13:39,038 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:13:39,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:39,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:39,045 INFO L229 MonitoredProcess]: Starting monitored process 8 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:13:39,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:13:39,079 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-01-10 01:13:39,099 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:13:39,099 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:13:39,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:39,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:13:39,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:13:39,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:13:39,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564096977] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:39,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:39,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-01-10 01:13:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084685557] [2025-01-10 01:13:39,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:39,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:13:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:39,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:13:39,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:13:39,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:39,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:39,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:39,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:39,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:39,427 INFO L124 PetriNetUnfolderBase]: 2067/3581 cut-off events. [2025-01-10 01:13:39,427 INFO L125 PetriNetUnfolderBase]: For 4227/4227 co-relation queries the response was YES. [2025-01-10 01:13:39,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9202 conditions, 3581 events. 2067/3581 cut-off events. For 4227/4227 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 19021 event pairs, 564 based on Foata normal form. 22/3047 useless extension candidates. Maximal degree in co-relation 9164. Up to 1046 conditions per place. [2025-01-10 01:13:39,441 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 72 selfloop transitions, 24 changer transitions 0/99 dead transitions. [2025-01-10 01:13:39,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 99 transitions, 753 flow [2025-01-10 01:13:39,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-01-10 01:13:39,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5891891891891892 [2025-01-10 01:13:39,442 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 267 flow. Second operand 5 states and 109 transitions. [2025-01-10 01:13:39,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 99 transitions, 753 flow [2025-01-10 01:13:39,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 676 flow, removed 14 selfloop flow, removed 10 redundant places. [2025-01-10 01:13:39,448 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 425 flow [2025-01-10 01:13:39,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=425, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-01-10 01:13:39,449 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2025-01-10 01:13:39,449 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 425 flow [2025-01-10 01:13:39,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:39,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:39,450 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:39,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:39,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:39,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:39,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:39,651 INFO L85 PathProgramCache]: Analyzing trace with hash 345319379, now seen corresponding path program 6 times [2025-01-10 01:13:39,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:39,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390490527] [2025-01-10 01:13:39,651 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:13:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:39,666 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 4 equivalence classes. [2025-01-10 01:13:39,679 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 40 statements. [2025-01-10 01:13:39,679 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:13:39,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:13:39,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:39,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390490527] [2025-01-10 01:13:39,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390490527] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:39,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605861418] [2025-01-10 01:13:39,833 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:13:39,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:39,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:39,835 INFO L229 MonitoredProcess]: Starting monitored process 9 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:13:39,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:13:39,878 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 4 equivalence classes. [2025-01-10 01:13:39,896 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 40 statements. [2025-01-10 01:13:39,896 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:13:39,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:39,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:13:39,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:39,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:13:40,087 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:40,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-01-10 01:13:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:13:40,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:40,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2025-01-10 01:13:40,531 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:40,531 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 53 treesize of output 41 [2025-01-10 01:13:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:13:40,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605861418] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:40,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:40,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-10 01:13:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921877206] [2025-01-10 01:13:40,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:40,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:13:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:40,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:13:40,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:13:40,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:40,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 425 flow. Second operand has 19 states, 19 states have (on average 11.526315789473685) internal successors, (219), 19 states have internal predecessors, (219), 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:13:40,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:40,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:40,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:41,671 INFO L124 PetriNetUnfolderBase]: 4762/8230 cut-off events. [2025-01-10 01:13:41,671 INFO L125 PetriNetUnfolderBase]: For 10038/10038 co-relation queries the response was YES. [2025-01-10 01:13:41,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21746 conditions, 8230 events. 4762/8230 cut-off events. For 10038/10038 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 52313 event pairs, 1288 based on Foata normal form. 4/6956 useless extension candidates. Maximal degree in co-relation 19395. Up to 2761 conditions per place. [2025-01-10 01:13:41,699 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 123 selfloop transitions, 21 changer transitions 73/220 dead transitions. [2025-01-10 01:13:41,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 220 transitions, 1692 flow [2025-01-10 01:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:13:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:13:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 273 transitions. [2025-01-10 01:13:41,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2025-01-10 01:13:41,701 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 425 flow. Second operand 15 states and 273 transitions. [2025-01-10 01:13:41,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 220 transitions, 1692 flow [2025-01-10 01:13:41,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 220 transitions, 1582 flow, removed 55 selfloop flow, removed 0 redundant places. [2025-01-10 01:13:41,716 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 527 flow [2025-01-10 01:13:41,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=527, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2025-01-10 01:13:41,717 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 45 predicate places. [2025-01-10 01:13:41,717 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 527 flow [2025-01-10 01:13:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.526315789473685) internal successors, (219), 19 states have internal predecessors, (219), 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:13:41,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:41,717 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:41,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:13:41,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:13:41,918 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:41,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash -542765023, now seen corresponding path program 7 times [2025-01-10 01:13:41,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:41,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411395381] [2025-01-10 01:13:41,918 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:13:41,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:41,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 01:13:41,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:13:41,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:41,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:13:42,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411395381] [2025-01-10 01:13:42,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411395381] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513001198] [2025-01-10 01:13:42,057 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:13:42,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:42,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:42,061 INFO L229 MonitoredProcess]: Starting monitored process 10 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:13:42,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:13:42,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 01:13:42,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:13:42,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:42,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:42,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:13:42,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:13:42,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:13:42,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513001198] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:42,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:42,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-10 01:13:42,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113011942] [2025-01-10 01:13:42,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:42,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:13:42,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:42,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:13:42,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:13:42,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:42,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 527 flow. Second operand has 20 states, 20 states have (on average 11.7) internal successors, (234), 20 states have internal predecessors, (234), 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:13:42,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:42,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:42,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:42,923 INFO L124 PetriNetUnfolderBase]: 2293/4011 cut-off events. [2025-01-10 01:13:42,923 INFO L125 PetriNetUnfolderBase]: For 4749/4749 co-relation queries the response was YES. [2025-01-10 01:13:42,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10427 conditions, 4011 events. 2293/4011 cut-off events. For 4749/4749 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 22536 event pairs, 1903 based on Foata normal form. 12/3398 useless extension candidates. Maximal degree in co-relation 10361. Up to 3570 conditions per place. [2025-01-10 01:13:42,940 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 50 selfloop transitions, 6 changer transitions 43/102 dead transitions. [2025-01-10 01:13:42,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 102 transitions, 782 flow [2025-01-10 01:13:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:13:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:13:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2025-01-10 01:13:42,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4294294294294294 [2025-01-10 01:13:42,941 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 527 flow. Second operand 9 states and 143 transitions. [2025-01-10 01:13:42,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 102 transitions, 782 flow [2025-01-10 01:13:42,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 102 transitions, 742 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-01-10 01:13:42,953 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 441 flow [2025-01-10 01:13:42,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=441, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2025-01-10 01:13:42,953 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 43 predicate places. [2025-01-10 01:13:42,954 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 441 flow [2025-01-10 01:13:42,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.7) internal successors, (234), 20 states have internal predecessors, (234), 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:13:42,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:42,954 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:42,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:43,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:43,158 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:43,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash 170388931, now seen corresponding path program 8 times [2025-01-10 01:13:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:43,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781503724] [2025-01-10 01:13:43,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:43,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:13:43,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:13:43,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:43,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:13:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:43,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781503724] [2025-01-10 01:13:43,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781503724] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:43,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450083049] [2025-01-10 01:13:43,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:43,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:43,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:43,421 INFO L229 MonitoredProcess]: Starting monitored process 11 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:13:43,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:13:43,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:13:43,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:13:43,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:43,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:43,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:13:43,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:13:43,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:43,629 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:43,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-01-10 01:13:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:13:43,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450083049] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:43,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:43,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2025-01-10 01:13:43,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990150365] [2025-01-10 01:13:43,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:43,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:13:43,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:43,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:13:43,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:13:43,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:43,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 441 flow. Second operand has 17 states, 17 states have (on average 11.764705882352942) internal successors, (200), 17 states have internal predecessors, (200), 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:13:43,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:43,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:43,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:45,755 INFO L124 PetriNetUnfolderBase]: 8703/14935 cut-off events. [2025-01-10 01:13:45,755 INFO L125 PetriNetUnfolderBase]: For 17866/17866 co-relation queries the response was YES. [2025-01-10 01:13:45,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38854 conditions, 14935 events. 8703/14935 cut-off events. For 17866/17866 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 99894 event pairs, 768 based on Foata normal form. 29/12655 useless extension candidates. Maximal degree in co-relation 36194. Up to 2725 conditions per place. [2025-01-10 01:13:45,806 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 348 selfloop transitions, 139 changer transitions 135/625 dead transitions. [2025-01-10 01:13:45,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 625 transitions, 4065 flow [2025-01-10 01:13:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-10 01:13:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-01-10 01:13:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 929 transitions. [2025-01-10 01:13:45,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5706388206388207 [2025-01-10 01:13:45,809 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 441 flow. Second operand 44 states and 929 transitions. [2025-01-10 01:13:45,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 625 transitions, 4065 flow [2025-01-10 01:13:45,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 625 transitions, 4032 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-10 01:13:45,838 INFO L231 Difference]: Finished difference. Result has 139 places, 180 transitions, 2296 flow [2025-01-10 01:13:45,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=2296, PETRI_PLACES=139, PETRI_TRANSITIONS=180} [2025-01-10 01:13:45,840 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 103 predicate places. [2025-01-10 01:13:45,840 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 180 transitions, 2296 flow [2025-01-10 01:13:45,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.764705882352942) internal successors, (200), 17 states have internal predecessors, (200), 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:13:45,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:45,841 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:45,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:13:46,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:13:46,041 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:46,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:46,043 INFO L85 PathProgramCache]: Analyzing trace with hash 202773896, now seen corresponding path program 9 times [2025-01-10 01:13:46,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:46,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039322439] [2025-01-10 01:13:46,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:13:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:46,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 5 equivalence classes. [2025-01-10 01:13:46,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 48 statements. [2025-01-10 01:13:46,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:13:46,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:13:46,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:46,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039322439] [2025-01-10 01:13:46,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039322439] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:46,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717877715] [2025-01-10 01:13:46,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:13:46,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:46,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:46,230 INFO L229 MonitoredProcess]: Starting monitored process 12 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:13:46,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:13:46,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 5 equivalence classes. [2025-01-10 01:13:46,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 48 statements. [2025-01-10 01:13:46,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:13:46,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:46,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:13:46,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 29 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:13:46,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:13:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717877715] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:46,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2025-01-10 01:13:46,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696435184] [2025-01-10 01:13:46,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:46,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 01:13:46,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:46,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 01:13:46,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2025-01-10 01:13:46,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:46,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 180 transitions, 2296 flow. Second operand has 27 states, 27 states have (on average 11.74074074074074) internal successors, (317), 27 states have internal predecessors, (317), 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:13:46,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:46,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:46,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:48,899 INFO L124 PetriNetUnfolderBase]: 9722/16898 cut-off events. [2025-01-10 01:13:48,899 INFO L125 PetriNetUnfolderBase]: For 39930/39930 co-relation queries the response was YES. [2025-01-10 01:13:48,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46256 conditions, 16898 events. 9722/16898 cut-off events. For 39930/39930 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 120961 event pairs, 3098 based on Foata normal form. 308/14540 useless extension candidates. Maximal degree in co-relation 45614. Up to 7829 conditions per place. [2025-01-10 01:13:48,976 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 112 selfloop transitions, 16 changer transitions 206/337 dead transitions. [2025-01-10 01:13:48,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 337 transitions, 3254 flow [2025-01-10 01:13:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:13:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 01:13:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 366 transitions. [2025-01-10 01:13:48,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2025-01-10 01:13:48,978 INFO L175 Difference]: Start difference. First operand has 139 places, 180 transitions, 2296 flow. Second operand 20 states and 366 transitions. [2025-01-10 01:13:48,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 337 transitions, 3254 flow [2025-01-10 01:13:49,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 337 transitions, 2556 flow, removed 275 selfloop flow, removed 8 redundant places. [2025-01-10 01:13:49,115 INFO L231 Difference]: Finished difference. Result has 147 places, 117 transitions, 1024 flow [2025-01-10 01:13:49,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1024, PETRI_PLACES=147, PETRI_TRANSITIONS=117} [2025-01-10 01:13:49,115 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 111 predicate places. [2025-01-10 01:13:49,116 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 117 transitions, 1024 flow [2025-01-10 01:13:49,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.74074074074074) internal successors, (317), 27 states have internal predecessors, (317), 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:13:49,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:49,116 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:49,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:49,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:13:49,317 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:49,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1356577008, now seen corresponding path program 10 times [2025-01-10 01:13:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577270443] [2025-01-10 01:13:49,317 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:13:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:49,323 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-01-10 01:13:49,335 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:13:49,335 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:13:49,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:13:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:49,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577270443] [2025-01-10 01:13:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577270443] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:49,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121904230] [2025-01-10 01:13:49,796 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:13:49,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:49,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:49,800 INFO L229 MonitoredProcess]: Starting monitored process 13 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:13:49,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:13:49,841 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-01-10 01:13:49,941 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:13:49,942 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:13:49,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:49,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 01:13:49,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:13:50,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:50,287 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:50,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-01-10 01:13:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:13:50,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121904230] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:50,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:50,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 31 [2025-01-10 01:13:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808577377] [2025-01-10 01:13:50,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:50,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 01:13:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:50,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 01:13:50,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2025-01-10 01:13:50,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:50,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 117 transitions, 1024 flow. Second operand has 32 states, 32 states have (on average 11.625) internal successors, (372), 32 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:50,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:50,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:50,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:56,782 INFO L124 PetriNetUnfolderBase]: 20749/35625 cut-off events. [2025-01-10 01:13:56,782 INFO L125 PetriNetUnfolderBase]: For 52134/52134 co-relation queries the response was YES. [2025-01-10 01:13:57,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86738 conditions, 35625 events. 20749/35625 cut-off events. For 52134/52134 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 273498 event pairs, 964 based on Foata normal form. 243/30344 useless extension candidates. Maximal degree in co-relation 85052. Up to 6550 conditions per place. [2025-01-10 01:13:57,068 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 724 selfloop transitions, 414 changer transitions 219/1360 dead transitions. [2025-01-10 01:13:57,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1360 transitions, 9614 flow [2025-01-10 01:13:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-01-10 01:13:57,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2025-01-10 01:13:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 1706 transitions. [2025-01-10 01:13:57,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5622940013183916 [2025-01-10 01:13:57,078 INFO L175 Difference]: Start difference. First operand has 147 places, 117 transitions, 1024 flow. Second operand 82 states and 1706 transitions. [2025-01-10 01:13:57,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 1360 transitions, 9614 flow [2025-01-10 01:13:57,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 1360 transitions, 8983 flow, removed 298 selfloop flow, removed 21 redundant places. [2025-01-10 01:13:57,308 INFO L231 Difference]: Finished difference. Result has 200 places, 480 transitions, 4533 flow [2025-01-10 01:13:57,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=4533, PETRI_PLACES=200, PETRI_TRANSITIONS=480} [2025-01-10 01:13:57,309 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 164 predicate places. [2025-01-10 01:13:57,309 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 480 transitions, 4533 flow [2025-01-10 01:13:57,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.625) internal successors, (372), 32 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:57,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:57,310 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:57,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:57,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:57,510 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:57,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:57,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2094152880, now seen corresponding path program 11 times [2025-01-10 01:13:57,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:57,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641154458] [2025-01-10 01:13:57,511 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:13:57,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:57,517 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 6 equivalence classes. [2025-01-10 01:13:57,543 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:13:57,543 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 01:13:57,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:13:58,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641154458] [2025-01-10 01:13:58,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641154458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431597128] [2025-01-10 01:13:58,068 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:13:58,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:58,073 INFO L229 MonitoredProcess]: Starting monitored process 14 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:13:58,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:13:58,138 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 6 equivalence classes. [2025-01-10 01:13:58,168 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:13:58,169 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 01:13:58,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:58,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 01:13:58,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:13:58,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:58,550 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:58,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-01-10 01:13:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:13:58,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431597128] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:58,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:58,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 10] total 29 [2025-01-10 01:13:58,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131353093] [2025-01-10 01:13:58,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:58,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:13:58,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:58,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:13:58,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:13:58,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:58,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 480 transitions, 4533 flow. Second operand has 30 states, 30 states have (on average 11.7) internal successors, (351), 30 states have internal predecessors, (351), 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:13:58,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:58,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:58,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:06,955 INFO L124 PetriNetUnfolderBase]: 33056/56660 cut-off events. [2025-01-10 01:14:06,956 INFO L125 PetriNetUnfolderBase]: For 115583/115583 co-relation queries the response was YES. [2025-01-10 01:14:07,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148677 conditions, 56660 events. 33056/56660 cut-off events. For 115583/115583 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 461810 event pairs, 4480 based on Foata normal form. 53/47932 useless extension candidates. Maximal degree in co-relation 145538. Up to 10425 conditions per place. [2025-01-10 01:14:07,488 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 659 selfloop transitions, 559 changer transitions 138/1359 dead transitions. [2025-01-10 01:14:07,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1359 transitions, 12337 flow [2025-01-10 01:14:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-10 01:14:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-01-10 01:14:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 1196 transitions. [2025-01-10 01:14:07,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5573159366262814 [2025-01-10 01:14:07,492 INFO L175 Difference]: Start difference. First operand has 200 places, 480 transitions, 4533 flow. Second operand 58 states and 1196 transitions. [2025-01-10 01:14:07,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 1359 transitions, 12337 flow [2025-01-10 01:14:08,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 1359 transitions, 12027 flow, removed 144 selfloop flow, removed 6 redundant places. [2025-01-10 01:14:08,047 INFO L231 Difference]: Finished difference. Result has 273 places, 715 transitions, 8482 flow [2025-01-10 01:14:08,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4377, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=345, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=8482, PETRI_PLACES=273, PETRI_TRANSITIONS=715} [2025-01-10 01:14:08,048 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 237 predicate places. [2025-01-10 01:14:08,048 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 715 transitions, 8482 flow [2025-01-10 01:14:08,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.7) internal successors, (351), 30 states have internal predecessors, (351), 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:14:08,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:08,049 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:08,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:08,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:08,250 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:14:08,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash -64980921, now seen corresponding path program 12 times [2025-01-10 01:14:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:08,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494987811] [2025-01-10 01:14:08,251 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:14:08,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:08,257 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 53 statements into 6 equivalence classes. [2025-01-10 01:14:08,283 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:14:08,283 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-10 01:14:08,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:14:08,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:08,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494987811] [2025-01-10 01:14:08,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494987811] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:08,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960976500] [2025-01-10 01:14:08,431 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:14:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:08,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:08,436 INFO L229 MonitoredProcess]: Starting monitored process 15 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:14:08,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:14:08,480 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 53 statements into 6 equivalence classes. [2025-01-10 01:14:08,592 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:14:08,592 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-10 01:14:08,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:08,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:14:08,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:14:08,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:14:08,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960976500] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:08,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:08,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 12 [2025-01-10 01:14:08,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905307399] [2025-01-10 01:14:08,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:08,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:14:08,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:08,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:14:08,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:14:08,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:14:08,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 715 transitions, 8482 flow. Second operand has 13 states, 13 states have (on average 12.76923076923077) internal successors, (166), 13 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:14:08,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:08,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:14:08,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:25,608 INFO L124 PetriNetUnfolderBase]: 65327/111879 cut-off events. [2025-01-10 01:14:25,608 INFO L125 PetriNetUnfolderBase]: For 351476/351476 co-relation queries the response was YES. [2025-01-10 01:14:27,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309181 conditions, 111879 events. 65327/111879 cut-off events. For 351476/351476 co-relation queries the response was YES. Maximal size of possible extension queue 2605. Compared 1009247 event pairs, 10642 based on Foata normal form. 44/94595 useless extension candidates. Maximal degree in co-relation 301433. Up to 20600 conditions per place. [2025-01-10 01:14:27,283 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 318 selfloop transitions, 1160 changer transitions 0/1481 dead transitions. [2025-01-10 01:14:27,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1481 transitions, 19663 flow [2025-01-10 01:14:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:14:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 01:14:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 329 transitions. [2025-01-10 01:14:27,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5230524642289348 [2025-01-10 01:14:27,285 INFO L175 Difference]: Start difference. First operand has 273 places, 715 transitions, 8482 flow. Second operand 17 states and 329 transitions. [2025-01-10 01:14:27,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1481 transitions, 19663 flow [2025-01-10 01:14:30,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 1481 transitions, 19218 flow, removed 201 selfloop flow, removed 12 redundant places. [2025-01-10 01:14:31,018 INFO L231 Difference]: Finished difference. Result has 279 places, 1332 transitions, 18183 flow [2025-01-10 01:14:31,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8211, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=649, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=18183, PETRI_PLACES=279, PETRI_TRANSITIONS=1332} [2025-01-10 01:14:31,020 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 243 predicate places. [2025-01-10 01:14:31,020 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 1332 transitions, 18183 flow [2025-01-10 01:14:31,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.76923076923077) internal successors, (166), 13 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:14:31,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:31,020 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:31,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:31,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 01:14:31,221 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:14:31,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -533781566, now seen corresponding path program 13 times [2025-01-10 01:14:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935526277] [2025-01-10 01:14:31,223 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:14:31,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:31,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:14:31,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:14:31,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:31,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:14:31,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:31,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935526277] [2025-01-10 01:14:31,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935526277] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:31,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461693053] [2025-01-10 01:14:31,536 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:14:31,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:31,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:31,538 INFO L229 MonitoredProcess]: Starting monitored process 16 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:14:31,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:14:31,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:14:31,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:14:31,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:31,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:31,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:14:31,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:14:31,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 37 proven. 41 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:14:32,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461693053] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:32,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:32,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 34 [2025-01-10 01:14:32,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337037596] [2025-01-10 01:14:32,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:32,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 01:14:32,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:32,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 01:14:32,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=884, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:14:32,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:14:32,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 1332 transitions, 18183 flow. Second operand has 35 states, 35 states have (on average 11.485714285714286) internal successors, (402), 35 states have internal predecessors, (402), 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:14:32,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:32,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:14:32,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand