./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.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 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:09:47,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:09:48,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:09:48,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:09:48,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:09:48,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:09:48,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:09:48,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:09:48,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:09:48,102 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:09:48,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:09:48,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:09:48,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:09:48,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:09:48,103 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:09:48,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:09:48,104 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:09:48,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:09:48,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:09:48,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:09:48,105 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:09:48,105 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:09:48,105 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:09:48,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:09:48,105 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:09:48,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:09:48,105 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:09:48,105 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:09:48,106 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:09:48,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:09:48,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:09:48,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:09:48,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:09:48,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:48,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:09:48,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:09:48,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:09:48,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:09:48,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:48,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:09:48,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:09:48,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:09:48,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:09:48,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:09:48,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:09:48,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:09:48,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:09:48,108 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 -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2025-01-10 01:09:48,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:09:48,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:09:48,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:09:48,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:09:48,451 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:09:48,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-01-10 01:09:49,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2265f8444/c959fca65efe428db9f5d00bed3a04af/FLAGe9aa9c6f8 [2025-01-10 01:09:50,190 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:09:50,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-01-10 01:09:50,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2265f8444/c959fca65efe428db9f5d00bed3a04af/FLAGe9aa9c6f8 [2025-01-10 01:09:50,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2265f8444/c959fca65efe428db9f5d00bed3a04af [2025-01-10 01:09:50,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:09:50,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:09:50,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:09:50,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:09:50,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:09:50,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13cd50e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50, skipping insertion in model container [2025-01-10 01:09:50,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:09:50,467 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:09:50,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:09:50,479 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:09:50,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:09:50,527 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:09:50,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50 WrapperNode [2025-01-10 01:09:50,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:09:50,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:09:50,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:09:50,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:09:50,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,562 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 12, calls inlined = 14, statements flattened = 177 [2025-01-10 01:09:50,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:09:50,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:09:50,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:09:50,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:09:50,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,589 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:09:50,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:09:50,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:09:50,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:09:50,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:09:50,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (1/1) ... [2025-01-10 01:09:50,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:50,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:50,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:09:50,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:09:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:09:50,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:09:50,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:09:50,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:09:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:09:50,669 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:09:50,759 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:09:50,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:09:51,097 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:09:51,097 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:09:51,386 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:09:51,386 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:09:51,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:51 BoogieIcfgContainer [2025-01-10 01:09:51,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:09:51,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:09:51,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:09:51,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:09:51,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:09:50" (1/3) ... [2025-01-10 01:09:51,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e28daff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:51, skipping insertion in model container [2025-01-10 01:09:51,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:50" (2/3) ... [2025-01-10 01:09:51,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e28daff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:51, skipping insertion in model container [2025-01-10 01:09:51,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:51" (3/3) ... [2025-01-10 01:09:51,398 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2025-01-10 01:09:51,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:09:51,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-dec-subseq.wvr.c that has 3 procedures, 49 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-01-10 01:09:51,415 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:09:51,474 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:09:51,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 53 transitions, 120 flow [2025-01-10 01:09:51,532 INFO L124 PetriNetUnfolderBase]: 5/51 cut-off events. [2025-01-10 01:09:51,535 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:09:51,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 51 events. 5/51 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 133 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-01-10 01:09:51,540 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 53 transitions, 120 flow [2025-01-10 01:09:51,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 50 transitions, 112 flow [2025-01-10 01:09:51,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:09:51,568 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;@122a80ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:09:51,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-10 01:09:51,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:09:51,572 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:09:51,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:09:51,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:51,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:09:51,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:51,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:51,578 INFO L85 PathProgramCache]: Analyzing trace with hash 549889, now seen corresponding path program 1 times [2025-01-10 01:09:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:51,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767542127] [2025-01-10 01:09:51,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:51,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:51,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:09:51,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:09:51,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:51,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:51,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:51,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767542127] [2025-01-10 01:09:51,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767542127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:51,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:51,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:09:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548081977] [2025-01-10 01:09:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:51,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:51,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:51,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:51,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:51,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 01:09:51,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:51,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:51,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 01:09:51,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:52,077 INFO L124 PetriNetUnfolderBase]: 299/576 cut-off events. [2025-01-10 01:09:52,077 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 01:09:52,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 576 events. 299/576 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3102 event pairs, 171 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 985. Up to 443 conditions per place. [2025-01-10 01:09:52,087 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 28 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-01-10 01:09:52,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 164 flow [2025-01-10 01:09:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-01-10 01:09:52,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5660377358490566 [2025-01-10 01:09:52,101 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 112 flow. Second operand 3 states and 90 transitions. [2025-01-10 01:09:52,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 164 flow [2025-01-10 01:09:52,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 156 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:09:52,109 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 100 flow [2025-01-10 01:09:52,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-01-10 01:09:52,114 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-01-10 01:09:52,115 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 100 flow [2025-01-10 01:09:52,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:52,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:52,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:09:52,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:09:52,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:52,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:52,117 INFO L85 PathProgramCache]: Analyzing trace with hash 549890, now seen corresponding path program 1 times [2025-01-10 01:09:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:52,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172232598] [2025-01-10 01:09:52,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:52,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:09:52,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:09:52,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:52,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:52,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172232598] [2025-01-10 01:09:52,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172232598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:52,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:52,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835533471] [2025-01-10 01:09:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:52,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:52,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:52,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:52,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 01:09:52,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:52,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:52,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 01:09:52,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:52,722 INFO L124 PetriNetUnfolderBase]: 300/579 cut-off events. [2025-01-10 01:09:52,722 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:09:52,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 579 events. 300/579 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3119 event pairs, 171 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 1019. Up to 452 conditions per place. [2025-01-10 01:09:52,728 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 31 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2025-01-10 01:09:52,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 176 flow [2025-01-10 01:09:52,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-01-10 01:09:52,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5283018867924528 [2025-01-10 01:09:52,730 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 100 flow. Second operand 4 states and 112 transitions. [2025-01-10 01:09:52,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 176 flow [2025-01-10 01:09:52,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:52,732 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 123 flow [2025-01-10 01:09:52,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-01-10 01:09:52,735 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-01-10 01:09:52,735 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 123 flow [2025-01-10 01:09:52,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:52,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:52,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:09:52,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:09:52,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash 17046814, now seen corresponding path program 1 times [2025-01-10 01:09:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:52,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756775736] [2025-01-10 01:09:52,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:52,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:52,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:09:52,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:09:52,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:52,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:52,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756775736] [2025-01-10 01:09:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756775736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519784334] [2025-01-10 01:09:52,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:52,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:52,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:52,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:53,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 01:09:53,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:53,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:53,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 01:09:53,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:53,258 INFO L124 PetriNetUnfolderBase]: 301/582 cut-off events. [2025-01-10 01:09:53,258 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:09:53,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 582 events. 301/582 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3114 event pairs, 171 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 1040. Up to 451 conditions per place. [2025-01-10 01:09:53,265 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 31 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2025-01-10 01:09:53,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 205 flow [2025-01-10 01:09:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-01-10 01:09:53,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5056603773584906 [2025-01-10 01:09:53,269 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 123 flow. Second operand 5 states and 134 transitions. [2025-01-10 01:09:53,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 205 flow [2025-01-10 01:09:53,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:53,271 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 157 flow [2025-01-10 01:09:53,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2025-01-10 01:09:53,273 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-01-10 01:09:53,273 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 157 flow [2025-01-10 01:09:53,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:53,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:53,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:09:53,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:09:53,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:53,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:53,275 INFO L85 PathProgramCache]: Analyzing trace with hash 17046823, now seen corresponding path program 1 times [2025-01-10 01:09:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:53,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718414573] [2025-01-10 01:09:53,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:53,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:09:53,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:09:53,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:53,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718414573] [2025-01-10 01:09:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718414573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:53,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:53,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199032856] [2025-01-10 01:09:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:53,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:53,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:53,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:53,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2025-01-10 01:09:53,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:53,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:53,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2025-01-10 01:09:53,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:53,515 INFO L124 PetriNetUnfolderBase]: 291/534 cut-off events. [2025-01-10 01:09:53,516 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:09:53,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 534 events. 291/534 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2621 event pairs, 171 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 992. Up to 434 conditions per place. [2025-01-10 01:09:53,521 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 33 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-01-10 01:09:53,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 221 flow [2025-01-10 01:09:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-01-10 01:09:53,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44339622641509435 [2025-01-10 01:09:53,523 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 157 flow. Second operand 4 states and 94 transitions. [2025-01-10 01:09:53,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 221 flow [2025-01-10 01:09:53,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:53,525 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 154 flow [2025-01-10 01:09:53,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-01-10 01:09:53,528 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-01-10 01:09:53,528 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 154 flow [2025-01-10 01:09:53,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:53,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:53,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:09:53,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:09:53,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:53,530 INFO L85 PathProgramCache]: Analyzing trace with hash 17046824, now seen corresponding path program 1 times [2025-01-10 01:09:53,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:53,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096061692] [2025-01-10 01:09:53,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:53,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:53,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:09:53,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:09:53,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:53,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:53,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:53,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096061692] [2025-01-10 01:09:53,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096061692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:53,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:53,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735913025] [2025-01-10 01:09:53,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:53,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:53,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:53,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:53,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:53,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-01-10 01:09:53,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:53,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:53,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-01-10 01:09:53,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:53,751 INFO L124 PetriNetUnfolderBase]: 274/512 cut-off events. [2025-01-10 01:09:53,751 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:09:53,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 512 events. 274/512 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2555 event pairs, 153 based on Foata normal form. 1/336 useless extension candidates. Maximal degree in co-relation 937. Up to 411 conditions per place. [2025-01-10 01:09:53,755 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 31 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-01-10 01:09:53,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 215 flow [2025-01-10 01:09:53,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-01-10 01:09:53,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5974842767295597 [2025-01-10 01:09:53,757 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 154 flow. Second operand 3 states and 95 transitions. [2025-01-10 01:09:53,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 215 flow [2025-01-10 01:09:53,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:53,759 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 150 flow [2025-01-10 01:09:53,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2025-01-10 01:09:53,760 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-01-10 01:09:53,760 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 150 flow [2025-01-10 01:09:53,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:53,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:53,760 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:09:53,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:09:53,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:53,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 528461786, now seen corresponding path program 1 times [2025-01-10 01:09:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:53,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922608490] [2025-01-10 01:09:53,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:53,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:53,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:53,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:53,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:53,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:54,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:54,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922608490] [2025-01-10 01:09:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922608490] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78752389] [2025-01-10 01:09:54,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:54,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:54,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:54,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:54,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:09:54,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:54,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:54,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:54,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:54,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:09:54,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:54,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:09:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:54,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:54,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78752389] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:54,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:54,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:09:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501404175] [2025-01-10 01:09:54,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:54,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:09:54,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:54,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:09:54,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:09:54,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 01:09:54,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 150 flow. Second operand has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:54,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:54,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 01:09:54,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:55,059 INFO L124 PetriNetUnfolderBase]: 275/514 cut-off events. [2025-01-10 01:09:55,059 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 01:09:55,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 514 events. 275/514 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2541 event pairs, 153 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 939. Up to 411 conditions per place. [2025-01-10 01:09:55,062 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 28 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2025-01-10 01:09:55,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 239 flow [2025-01-10 01:09:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:09:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:09:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2025-01-10 01:09:55,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4481132075471698 [2025-01-10 01:09:55,064 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 150 flow. Second operand 8 states and 190 transitions. [2025-01-10 01:09:55,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 239 flow [2025-01-10 01:09:55,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:55,066 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 179 flow [2025-01-10 01:09:55,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2025-01-10 01:09:55,067 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-01-10 01:09:55,067 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 179 flow [2025-01-10 01:09:55,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:55,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:55,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:09:55,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:09:55,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:55,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:55,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:55,273 INFO L85 PathProgramCache]: Analyzing trace with hash -797863987, now seen corresponding path program 1 times [2025-01-10 01:09:55,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:55,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146576292] [2025-01-10 01:09:55,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:55,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:55,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:55,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:55,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:55,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146576292] [2025-01-10 01:09:55,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146576292] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120111095] [2025-01-10 01:09:55,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:55,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:55,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:55,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:55,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:09:55,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:55,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:55,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:55,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:55,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:09:55,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:55,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:55,502 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 22 treesize of output 18 [2025-01-10 01:09:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:55,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120111095] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:55,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:55,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 01:09:55,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052085284] [2025-01-10 01:09:55,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:55,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:09:55,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:55,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:09:55,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:09:55,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2025-01-10 01:09:55,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 179 flow. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:55,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:55,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2025-01-10 01:09:55,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:55,747 INFO L124 PetriNetUnfolderBase]: 275/513 cut-off events. [2025-01-10 01:09:55,748 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:09:55,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 513 events. 275/513 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2554 event pairs, 153 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 938. Up to 402 conditions per place. [2025-01-10 01:09:55,750 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 31 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2025-01-10 01:09:55,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 251 flow [2025-01-10 01:09:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-01-10 01:09:55,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5094339622641509 [2025-01-10 01:09:55,752 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 179 flow. Second operand 5 states and 135 transitions. [2025-01-10 01:09:55,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 251 flow [2025-01-10 01:09:55,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 205 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 01:09:55,755 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 143 flow [2025-01-10 01:09:55,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-01-10 01:09:55,757 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-01-10 01:09:55,757 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 143 flow [2025-01-10 01:09:55,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:55,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:55,758 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:09:55,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:09:55,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:55,959 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:55,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash -797863997, now seen corresponding path program 1 times [2025-01-10 01:09:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530855243] [2025-01-10 01:09:55,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:55,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:55,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:55,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:55,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:55,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:56,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:56,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530855243] [2025-01-10 01:09:56,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530855243] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:56,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231407349] [2025-01-10 01:09:56,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:56,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:56,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:56,164 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:56,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:09:56,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:56,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:56,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:56,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:56,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:09:56,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:56,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:09:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:56,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:56,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231407349] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:56,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:56,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:09:56,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367029947] [2025-01-10 01:09:56,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:56,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:09:56,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:56,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:09:56,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:09:56,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 01:09:56,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 143 flow. Second operand has 13 states, 13 states have (on average 20.307692307692307) internal successors, (264), 13 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:56,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:56,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 01:09:56,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:57,073 INFO L124 PetriNetUnfolderBase]: 275/512 cut-off events. [2025-01-10 01:09:57,074 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:09:57,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 512 events. 275/512 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2557 event pairs, 153 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 916. Up to 402 conditions per place. [2025-01-10 01:09:57,078 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 23 selfloop transitions, 14 changer transitions 0/47 dead transitions. [2025-01-10 01:09:57,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 213 flow [2025-01-10 01:09:57,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:09:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:09:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-01-10 01:09:57,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2025-01-10 01:09:57,080 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 143 flow. Second operand 7 states and 168 transitions. [2025-01-10 01:09:57,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 213 flow [2025-01-10 01:09:57,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:57,081 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 161 flow [2025-01-10 01:09:57,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=161, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2025-01-10 01:09:57,084 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-01-10 01:09:57,085 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 161 flow [2025-01-10 01:09:57,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.307692307692307) internal successors, (264), 13 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:57,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:57,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:57,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:09:57,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:57,290 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:57,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash 460791863, now seen corresponding path program 1 times [2025-01-10 01:09:57,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199376882] [2025-01-10 01:09:57,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:57,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:57,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:57,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:57,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:57,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:57,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:57,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199376882] [2025-01-10 01:09:57,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199376882] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:57,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781731110] [2025-01-10 01:09:57,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:57,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:57,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:57,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:09:57,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:57,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:57,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:57,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:57,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:09:57,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:57,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:09:57,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781731110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:57,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:09:57,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 01:09:57,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628824492] [2025-01-10 01:09:57,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:57,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:57,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:57,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:57,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:09:57,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-01-10 01:09:57,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:57,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:57,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-01-10 01:09:57,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:57,676 INFO L124 PetriNetUnfolderBase]: 536/885 cut-off events. [2025-01-10 01:09:57,677 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:09:57,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 885 events. 536/885 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 4683 event pairs, 136 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 1712. Up to 486 conditions per place. [2025-01-10 01:09:57,682 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 57 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2025-01-10 01:09:57,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 67 transitions, 324 flow [2025-01-10 01:09:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-01-10 01:09:57,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5801886792452831 [2025-01-10 01:09:57,683 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 161 flow. Second operand 4 states and 123 transitions. [2025-01-10 01:09:57,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 67 transitions, 324 flow [2025-01-10 01:09:57,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 294 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 01:09:57,685 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 149 flow [2025-01-10 01:09:57,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2025-01-10 01:09:57,687 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-01-10 01:09:57,689 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 149 flow [2025-01-10 01:09:57,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:57,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:57,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:57,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:09:57,892 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,SelfDestructingSolverStorable8 [2025-01-10 01:09:57,892 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:57,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash 439364696, now seen corresponding path program 1 times [2025-01-10 01:09:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:57,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573792155] [2025-01-10 01:09:57,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:57,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:57,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:09:57,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:09:57,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:57,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:57,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573792155] [2025-01-10 01:09:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573792155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602207523] [2025-01-10 01:09:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:57,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:57,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:57,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:57,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-01-10 01:09:57,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:57,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:57,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-01-10 01:09:57,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:58,124 INFO L124 PetriNetUnfolderBase]: 480/932 cut-off events. [2025-01-10 01:09:58,124 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-10 01:09:58,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 932 events. 480/932 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5487 event pairs, 312 based on Foata normal form. 27/703 useless extension candidates. Maximal degree in co-relation 1514. Up to 661 conditions per place. [2025-01-10 01:09:58,130 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 53 selfloop transitions, 3 changer transitions 1/67 dead transitions. [2025-01-10 01:09:58,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 326 flow [2025-01-10 01:09:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-01-10 01:09:58,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6556603773584906 [2025-01-10 01:09:58,131 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 149 flow. Second operand 4 states and 139 transitions. [2025-01-10 01:09:58,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 326 flow [2025-01-10 01:09:58,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:58,133 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 166 flow [2025-01-10 01:09:58,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-01-10 01:09:58,134 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-01-10 01:09:58,134 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 166 flow [2025-01-10 01:09:58,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:58,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:58,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:58,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:09:58,134 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:58,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash 313832320, now seen corresponding path program 1 times [2025-01-10 01:09:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179028459] [2025-01-10 01:09:58,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:58,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:09:58,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:09:58,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:58,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:58,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:58,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179028459] [2025-01-10 01:09:58,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179028459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:58,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:58,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:58,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717968580] [2025-01-10 01:09:58,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:58,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:58,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:58,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:58,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:58,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 01:09:58,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:58,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:58,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 01:09:58,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:58,541 INFO L124 PetriNetUnfolderBase]: 359/739 cut-off events. [2025-01-10 01:09:58,541 INFO L125 PetriNetUnfolderBase]: For 93/121 co-relation queries the response was YES. [2025-01-10 01:09:58,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 739 events. 359/739 cut-off events. For 93/121 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4160 event pairs, 237 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 1319. Up to 592 conditions per place. [2025-01-10 01:09:58,545 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 32 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-01-10 01:09:58,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 230 flow [2025-01-10 01:09:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-01-10 01:09:58,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49528301886792453 [2025-01-10 01:09:58,548 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 166 flow. Second operand 4 states and 105 transitions. [2025-01-10 01:09:58,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 230 flow [2025-01-10 01:09:58,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:58,551 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 161 flow [2025-01-10 01:09:58,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2025-01-10 01:09:58,551 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-01-10 01:09:58,551 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 161 flow [2025-01-10 01:09:58,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:58,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:58,552 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:58,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:09:58,552 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:58,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:58,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1322729087, now seen corresponding path program 1 times [2025-01-10 01:09:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:58,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374535705] [2025-01-10 01:09:58,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:58,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:09:58,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:09:58,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:58,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:58,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:58,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374535705] [2025-01-10 01:09:58,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374535705] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:58,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245339626] [2025-01-10 01:09:58,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:58,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:58,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:58,657 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:09:58,659 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:09:58,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:09:58,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:09:58,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:58,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:58,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:09:58,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:58,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245339626] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:58,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 01:09:58,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176324021] [2025-01-10 01:09:58,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:58,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:09:58,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:58,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:09:58,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:09:58,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2025-01-10 01:09:59,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 161 flow. Second operand has 15 states, 15 states have (on average 22.066666666666666) internal successors, (331), 15 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:59,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:59,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2025-01-10 01:09:59,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:59,325 INFO L124 PetriNetUnfolderBase]: 601/1180 cut-off events. [2025-01-10 01:09:59,325 INFO L125 PetriNetUnfolderBase]: For 138/186 co-relation queries the response was YES. [2025-01-10 01:09:59,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 1180 events. 601/1180 cut-off events. For 138/186 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6995 event pairs, 201 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 2058. Up to 288 conditions per place. [2025-01-10 01:09:59,332 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 79 selfloop transitions, 20 changer transitions 0/108 dead transitions. [2025-01-10 01:09:59,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 533 flow [2025-01-10 01:09:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:09:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:09:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 314 transitions. [2025-01-10 01:09:59,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5385934819897084 [2025-01-10 01:09:59,335 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 161 flow. Second operand 11 states and 314 transitions. [2025-01-10 01:09:59,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 533 flow [2025-01-10 01:09:59,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 108 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:59,339 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 247 flow [2025-01-10 01:09:59,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=247, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2025-01-10 01:09:59,340 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2025-01-10 01:09:59,340 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 247 flow [2025-01-10 01:09:59,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 22.066666666666666) internal successors, (331), 15 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:59,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:59,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:59,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:09:59,540 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:09:59,541 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:59,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:59,541 INFO L85 PathProgramCache]: Analyzing trace with hash 313832319, now seen corresponding path program 1 times [2025-01-10 01:09:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:59,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579460720] [2025-01-10 01:09:59,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:59,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:59,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:09:59,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:09:59,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:59,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:59,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579460720] [2025-01-10 01:09:59,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579460720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:59,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:59,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:59,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362242704] [2025-01-10 01:09:59,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:59,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:59,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:59,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:59,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:59,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 01:09:59,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:59,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:59,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 01:09:59,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:59,806 INFO L124 PetriNetUnfolderBase]: 399/869 cut-off events. [2025-01-10 01:09:59,807 INFO L125 PetriNetUnfolderBase]: For 276/296 co-relation queries the response was YES. [2025-01-10 01:09:59,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 869 events. 399/869 cut-off events. For 276/296 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5107 event pairs, 266 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1427. Up to 674 conditions per place. [2025-01-10 01:09:59,813 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 35 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2025-01-10 01:09:59,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 51 transitions, 321 flow [2025-01-10 01:09:59,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-01-10 01:09:59,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46037735849056605 [2025-01-10 01:09:59,814 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 247 flow. Second operand 5 states and 122 transitions. [2025-01-10 01:09:59,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 51 transitions, 321 flow [2025-01-10 01:09:59,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 51 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:59,816 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 246 flow [2025-01-10 01:09:59,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2025-01-10 01:09:59,817 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2025-01-10 01:09:59,817 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 246 flow [2025-01-10 01:09:59,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:59,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:59,817 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:59,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:09:59,817 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:09:59,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1225090788, now seen corresponding path program 2 times [2025-01-10 01:09:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916587992] [2025-01-10 01:09:59,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:59,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:09:59,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:09:59,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:59,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:10:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916587992] [2025-01-10 01:10:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916587992] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007904643] [2025-01-10 01:10:00,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:00,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:00,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:00,051 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:10:00,053 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:10:00,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:10:00,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:10:00,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:00,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:00,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:10:00,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:10:00,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:00,330 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 30 treesize of output 26 [2025-01-10 01:10:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:10:00,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007904643] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:00,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-01-10 01:10:00,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504394024] [2025-01-10 01:10:00,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:00,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:10:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:00,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:10:00,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:10:00,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-01-10 01:10:00,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 246 flow. Second operand has 19 states, 19 states have (on average 18.842105263157894) internal successors, (358), 19 states have internal predecessors, (358), 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:10:00,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:00,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-01-10 01:10:00,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:01,566 INFO L124 PetriNetUnfolderBase]: 626/1236 cut-off events. [2025-01-10 01:10:01,566 INFO L125 PetriNetUnfolderBase]: For 268/284 co-relation queries the response was YES. [2025-01-10 01:10:01,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2899 conditions, 1236 events. 626/1236 cut-off events. For 268/284 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7259 event pairs, 184 based on Foata normal form. 56/1184 useless extension candidates. Maximal degree in co-relation 2036. Up to 242 conditions per place. [2025-01-10 01:10:01,572 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 79 selfloop transitions, 15 changer transitions 0/101 dead transitions. [2025-01-10 01:10:01,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 559 flow [2025-01-10 01:10:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:10:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:10:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 268 transitions. [2025-01-10 01:10:01,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5056603773584906 [2025-01-10 01:10:01,577 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 246 flow. Second operand 10 states and 268 transitions. [2025-01-10 01:10:01,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 559 flow [2025-01-10 01:10:01,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 101 transitions, 549 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:01,580 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 281 flow [2025-01-10 01:10:01,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=281, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2025-01-10 01:10:01,582 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2025-01-10 01:10:01,582 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 281 flow [2025-01-10 01:10:01,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.842105263157894) internal successors, (358), 19 states have internal predecessors, (358), 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:10:01,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:01,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:01,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:10:01,783 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,SelfDestructingSolverStorable13 [2025-01-10 01:10:01,784 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:10:01,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:01,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1250713813, now seen corresponding path program 1 times [2025-01-10 01:10:01,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:01,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129296909] [2025-01-10 01:10:01,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:01,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:01,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:10:01,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:10:01,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:01,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129296909] [2025-01-10 01:10:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129296909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:01,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:01,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:10:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852809390] [2025-01-10 01:10:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:01,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:01,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:01,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:01,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2025-01-10 01:10:01,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:10:01,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:01,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2025-01-10 01:10:01,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:01,983 INFO L124 PetriNetUnfolderBase]: 518/1068 cut-off events. [2025-01-10 01:10:01,983 INFO L125 PetriNetUnfolderBase]: For 658/674 co-relation queries the response was YES. [2025-01-10 01:10:01,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2661 conditions, 1068 events. 518/1068 cut-off events. For 658/674 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6198 event pairs, 140 based on Foata normal form. 32/996 useless extension candidates. Maximal degree in co-relation 1824. Up to 565 conditions per place. [2025-01-10 01:10:01,991 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 47 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-01-10 01:10:01,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 61 transitions, 405 flow [2025-01-10 01:10:01,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-01-10 01:10:01,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5566037735849056 [2025-01-10 01:10:01,993 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 281 flow. Second operand 4 states and 118 transitions. [2025-01-10 01:10:01,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 61 transitions, 405 flow [2025-01-10 01:10:01,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 383 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-01-10 01:10:01,996 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 260 flow [2025-01-10 01:10:01,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2025-01-10 01:10:01,996 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2025-01-10 01:10:01,996 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 260 flow [2025-01-10 01:10:01,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:10:01,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:01,997 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:01,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:10:01,997 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:10:01,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash -380082516, now seen corresponding path program 3 times [2025-01-10 01:10:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:01,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525536319] [2025-01-10 01:10:01,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:10:01,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:02,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-01-10 01:10:02,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 20 statements. [2025-01-10 01:10:02,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:10:02,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:10:02,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:02,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525536319] [2025-01-10 01:10:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525536319] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894186861] [2025-01-10 01:10:02,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:10:02,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:02,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:02,206 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:10:02,209 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:10:02,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-01-10 01:10:02,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 20 statements. [2025-01-10 01:10:02,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:10:02,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:02,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:10:02,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:10:02,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:02,520 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 13 treesize of output 11 [2025-01-10 01:10:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:10:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894186861] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:02,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:02,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-10 01:10:02,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980823490] [2025-01-10 01:10:02,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:02,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:10:02,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:02,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:10:02,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:10:02,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-01-10 01:10:02,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 260 flow. Second operand has 15 states, 15 states have (on average 19.333333333333332) internal successors, (290), 15 states have internal predecessors, (290), 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:10:02,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:02,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-01-10 01:10:02,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:03,178 INFO L124 PetriNetUnfolderBase]: 590/1112 cut-off events. [2025-01-10 01:10:03,178 INFO L125 PetriNetUnfolderBase]: For 512/532 co-relation queries the response was YES. [2025-01-10 01:10:03,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 1112 events. 590/1112 cut-off events. For 512/532 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6140 event pairs, 44 based on Foata normal form. 16/1023 useless extension candidates. Maximal degree in co-relation 1953. Up to 356 conditions per place. [2025-01-10 01:10:03,187 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 50 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2025-01-10 01:10:03,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 451 flow [2025-01-10 01:10:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:10:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:10:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2025-01-10 01:10:03,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44339622641509435 [2025-01-10 01:10:03,190 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 260 flow. Second operand 8 states and 188 transitions. [2025-01-10 01:10:03,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 451 flow [2025-01-10 01:10:03,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 435 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:03,193 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 292 flow [2025-01-10 01:10:03,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=292, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2025-01-10 01:10:03,195 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2025-01-10 01:10:03,195 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 292 flow [2025-01-10 01:10:03,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.333333333333332) internal successors, (290), 15 states have internal predecessors, (290), 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:10:03,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:03,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:03,205 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:10:03,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:03,397 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:10:03,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1918334685, now seen corresponding path program 1 times [2025-01-10 01:10:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:03,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058197458] [2025-01-10 01:10:03,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:03,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:10:03,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:10:03,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:03,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:03,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:03,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058197458] [2025-01-10 01:10:03,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058197458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:03,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:03,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:03,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214141289] [2025-01-10 01:10:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:03,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:03,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-01-10 01:10:03,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:03,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:03,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-01-10 01:10:03,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:03,620 INFO L124 PetriNetUnfolderBase]: 561/1192 cut-off events. [2025-01-10 01:10:03,620 INFO L125 PetriNetUnfolderBase]: For 1154/1170 co-relation queries the response was YES. [2025-01-10 01:10:03,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 1192 events. 561/1192 cut-off events. For 1154/1170 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7239 event pairs, 261 based on Foata normal form. 6/1075 useless extension candidates. Maximal degree in co-relation 2183. Up to 614 conditions per place. [2025-01-10 01:10:03,627 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 51 selfloop transitions, 2 changer transitions 3/67 dead transitions. [2025-01-10 01:10:03,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 67 transitions, 476 flow [2025-01-10 01:10:03,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-01-10 01:10:03,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6289308176100629 [2025-01-10 01:10:03,629 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 292 flow. Second operand 3 states and 100 transitions. [2025-01-10 01:10:03,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 67 transitions, 476 flow [2025-01-10 01:10:03,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 446 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:10:03,634 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 268 flow [2025-01-10 01:10:03,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2025-01-10 01:10:03,635 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2025-01-10 01:10:03,635 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 268 flow [2025-01-10 01:10:03,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:03,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:03,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:03,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:10:03,636 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:10:03,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1978715322, now seen corresponding path program 1 times [2025-01-10 01:10:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:03,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598923178] [2025-01-10 01:10:03,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:03,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:03,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:10:03,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:10:03,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:03,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:03,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:03,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598923178] [2025-01-10 01:10:03,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598923178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:03,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:03,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:03,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928385018] [2025-01-10 01:10:03,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:03,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:03,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:03,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:03,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-01-10 01:10:03,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:03,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:03,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-01-10 01:10:03,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:03,808 INFO L124 PetriNetUnfolderBase]: 474/993 cut-off events. [2025-01-10 01:10:03,808 INFO L125 PetriNetUnfolderBase]: For 903/923 co-relation queries the response was YES. [2025-01-10 01:10:03,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2626 conditions, 993 events. 474/993 cut-off events. For 903/923 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5568 event pairs, 197 based on Foata normal form. 23/939 useless extension candidates. Maximal degree in co-relation 2569. Up to 628 conditions per place. [2025-01-10 01:10:03,815 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 47 selfloop transitions, 2 changer transitions 6/66 dead transitions. [2025-01-10 01:10:03,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 445 flow [2025-01-10 01:10:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-01-10 01:10:03,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6226415094339622 [2025-01-10 01:10:03,817 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 268 flow. Second operand 3 states and 99 transitions. [2025-01-10 01:10:03,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 445 flow [2025-01-10 01:10:03,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:03,821 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 280 flow [2025-01-10 01:10:03,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2025-01-10 01:10:03,822 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2025-01-10 01:10:03,822 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 280 flow [2025-01-10 01:10:03,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:03,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:03,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:03,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:10:03,822 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:10:03,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash 872617887, now seen corresponding path program 1 times [2025-01-10 01:10:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:03,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656450103] [2025-01-10 01:10:03,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:03,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:10:03,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:10:03,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:03,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656450103] [2025-01-10 01:10:04,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656450103] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:04,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215127705] [2025-01-10 01:10:04,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:04,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:04,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:04,507 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:10:04,509 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:10:04,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:10:04,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:10:04,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:04,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:04,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 01:10:04,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:05,126 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-01-10 01:10:05,127 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 34 treesize of output 10 [2025-01-10 01:10:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:05,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:05,652 INFO L349 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2025-01-10 01:10:05,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 99 [2025-01-10 01:10:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215127705] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:06,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:06,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 32 [2025-01-10 01:10:06,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697851162] [2025-01-10 01:10:06,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:06,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-10 01:10:06,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:06,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 01:10:06,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=815, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 01:10:10,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-10 01:10:10,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 53 [2025-01-10 01:10:10,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 280 flow. Second operand has 33 states, 33 states have (on average 18.454545454545453) internal successors, (609), 33 states have internal predecessors, (609), 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:10:10,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:10,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 53 [2025-01-10 01:10:10,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:16,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-10 01:10:21,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-10 01:10:22,309 INFO L124 PetriNetUnfolderBase]: 2856/4933 cut-off events. [2025-01-10 01:10:22,310 INFO L125 PetriNetUnfolderBase]: For 5095/5095 co-relation queries the response was YES. [2025-01-10 01:10:22,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13788 conditions, 4933 events. 2856/4933 cut-off events. For 5095/5095 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 28595 event pairs, 262 based on Foata normal form. 7/4394 useless extension candidates. Maximal degree in co-relation 8816. Up to 850 conditions per place. [2025-01-10 01:10:22,337 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 277 selfloop transitions, 106 changer transitions 76/462 dead transitions. [2025-01-10 01:10:22,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 462 transitions, 3058 flow [2025-01-10 01:10:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-10 01:10:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-01-10 01:10:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1064 transitions. [2025-01-10 01:10:22,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4562607204116638 [2025-01-10 01:10:22,342 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 280 flow. Second operand 44 states and 1064 transitions. [2025-01-10 01:10:22,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 462 transitions, 3058 flow [2025-01-10 01:10:22,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 462 transitions, 2986 flow, removed 34 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:22,359 INFO L231 Difference]: Finished difference. Result has 141 places, 153 transitions, 1314 flow [2025-01-10 01:10:22,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1314, PETRI_PLACES=141, PETRI_TRANSITIONS=153} [2025-01-10 01:10:22,360 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 89 predicate places. [2025-01-10 01:10:22,360 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 153 transitions, 1314 flow [2025-01-10 01:10:22,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 18.454545454545453) internal successors, (609), 33 states have internal predecessors, (609), 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:10:22,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:22,361 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:22,370 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:10:22,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:22,565 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:10:22,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:22,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1746374038, now seen corresponding path program 2 times [2025-01-10 01:10:22,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:22,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607755335] [2025-01-10 01:10:22,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:22,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:10:22,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:10:22,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:22,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607755335] [2025-01-10 01:10:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607755335] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335958459] [2025-01-10 01:10:22,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:22,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:22,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:22,702 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:10:22,703 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:10:22,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:10:22,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:10:22,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:22,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:22,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:10:22,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:22,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:22,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335958459] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:22,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:22,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:10:22,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985768375] [2025-01-10 01:10:22,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:22,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:10:22,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:22,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:10:22,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:10:23,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-01-10 01:10:23,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 153 transitions, 1314 flow. Second operand has 12 states, 12 states have (on average 24.25) internal successors, (291), 12 states have internal predecessors, (291), 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:10:23,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:23,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-01-10 01:10:23,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:23,483 INFO L124 PetriNetUnfolderBase]: 936/2106 cut-off events. [2025-01-10 01:10:23,483 INFO L125 PetriNetUnfolderBase]: For 13119/13159 co-relation queries the response was YES. [2025-01-10 01:10:23,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8920 conditions, 2106 events. 936/2106 cut-off events. For 13119/13159 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 13392 event pairs, 280 based on Foata normal form. 58/2073 useless extension candidates. Maximal degree in co-relation 8854. Up to 786 conditions per place. [2025-01-10 01:10:23,494 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 46 selfloop transitions, 13 changer transitions 102/174 dead transitions. [2025-01-10 01:10:23,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 174 transitions, 1818 flow [2025-01-10 01:10:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:10:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:10:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 284 transitions. [2025-01-10 01:10:23,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5358490566037736 [2025-01-10 01:10:23,496 INFO L175 Difference]: Start difference. First operand has 141 places, 153 transitions, 1314 flow. Second operand 10 states and 284 transitions. [2025-01-10 01:10:23,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 174 transitions, 1818 flow [2025-01-10 01:10:23,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 174 transitions, 1667 flow, removed 68 selfloop flow, removed 11 redundant places. [2025-01-10 01:10:23,528 INFO L231 Difference]: Finished difference. Result has 131 places, 64 transitions, 483 flow [2025-01-10 01:10:23,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=483, PETRI_PLACES=131, PETRI_TRANSITIONS=64} [2025-01-10 01:10:23,529 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 79 predicate places. [2025-01-10 01:10:23,529 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 64 transitions, 483 flow [2025-01-10 01:10:23,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.25) internal successors, (291), 12 states have internal predecessors, (291), 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:10:23,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:23,529 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:23,535 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:10:23,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:23,729 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:10:23,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash 979926782, now seen corresponding path program 3 times [2025-01-10 01:10:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:23,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221747922] [2025-01-10 01:10:23,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:10:23,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:23,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-01-10 01:10:23,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 37 statements. [2025-01-10 01:10:23,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:10:23,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:10:23,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:23,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221747922] [2025-01-10 01:10:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221747922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:23,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:10:23,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951940823] [2025-01-10 01:10:23,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:23,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:23,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:23,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:23,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:23,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-01-10 01:10:23,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 64 transitions, 483 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:23,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:23,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-01-10 01:10:23,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:24,018 INFO L124 PetriNetUnfolderBase]: 687/1550 cut-off events. [2025-01-10 01:10:24,018 INFO L125 PetriNetUnfolderBase]: For 8933/8963 co-relation queries the response was YES. [2025-01-10 01:10:24,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6212 conditions, 1550 events. 687/1550 cut-off events. For 8933/8963 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8499 event pairs, 244 based on Foata normal form. 56/1519 useless extension candidates. Maximal degree in co-relation 6112. Up to 488 conditions per place. [2025-01-10 01:10:24,030 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 78 selfloop transitions, 14 changer transitions 6/111 dead transitions. [2025-01-10 01:10:24,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 111 transitions, 989 flow [2025-01-10 01:10:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-01-10 01:10:24,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2025-01-10 01:10:24,031 INFO L175 Difference]: Start difference. First operand has 131 places, 64 transitions, 483 flow. Second operand 4 states and 138 transitions. [2025-01-10 01:10:24,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 111 transitions, 989 flow [2025-01-10 01:10:24,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 111 transitions, 785 flow, removed 85 selfloop flow, removed 22 redundant places. [2025-01-10 01:10:24,044 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 460 flow [2025-01-10 01:10:24,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=460, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2025-01-10 01:10:24,044 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2025-01-10 01:10:24,044 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 460 flow [2025-01-10 01:10:24,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:24,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:24,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:24,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:10:24,045 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:10:24,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:24,046 INFO L85 PathProgramCache]: Analyzing trace with hash -294167226, now seen corresponding path program 4 times [2025-01-10 01:10:24,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:24,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789169155] [2025-01-10 01:10:24,047 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:10:24,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:24,057 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-10 01:10:24,095 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:10:24,099 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:10:24,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:25,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789169155] [2025-01-10 01:10:25,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789169155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769621431] [2025-01-10 01:10:25,434 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:10:25,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:25,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:25,436 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:10:25,437 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:10:25,487 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-10 01:10:25,518 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:10:25,518 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:10:25,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:25,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-10 01:10:25,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:25,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:10:25,610 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:10:25,648 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:10:25,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:10:25,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:10:25,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:10:26,769 INFO L349 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2025-01-10 01:10:26,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 27 [2025-01-10 01:10:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:26,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:29,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:10:29,048 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 79 [2025-01-10 01:10:29,089 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-01-10 01:10:29,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 125 [2025-01-10 01:10:29,242 INFO L349 Elim1Store]: treesize reduction 16, result has 90.4 percent of original size [2025-01-10 01:10:29,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 197 [2025-01-10 01:10:30,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:10:30,283 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 69 [2025-01-10 01:10:30,300 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2025-01-10 01:10:30,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 102 [2025-01-10 01:10:30,419 INFO L349 Elim1Store]: treesize reduction 16, result has 90.5 percent of original size [2025-01-10 01:10:30,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 207 [2025-01-10 01:10:31,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:10:31,498 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 51 [2025-01-10 01:10:31,508 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-10 01:10:31,509 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 81 treesize of output 65 [2025-01-10 01:10:31,563 INFO L349 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2025-01-10 01:10:31,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 104 [2025-01-10 01:10:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769621431] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:32,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 18] total 51 [2025-01-10 01:10:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476704776] [2025-01-10 01:10:32,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:32,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-10 01:10:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:32,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-10 01:10:32,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=2199, Unknown=5, NotChecked=0, Total=2652 [2025-01-10 01:10:34,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 53 [2025-01-10 01:10:34,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 460 flow. Second operand has 52 states, 52 states have (on average 7.269230769230769) internal successors, (378), 52 states have internal predecessors, (378), 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:10:34,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:34,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 53 [2025-01-10 01:10:34,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:52,287 INFO L124 PetriNetUnfolderBase]: 8507/14394 cut-off events. [2025-01-10 01:10:52,287 INFO L125 PetriNetUnfolderBase]: For 25559/25559 co-relation queries the response was YES. [2025-01-10 01:10:52,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46456 conditions, 14394 events. 8507/14394 cut-off events. For 25559/25559 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 92539 event pairs, 246 based on Foata normal form. 32/13750 useless extension candidates. Maximal degree in co-relation 38840. Up to 2637 conditions per place. [2025-01-10 01:10:52,356 INFO L140 encePairwiseOnDemand]: 33/53 looper letters, 615 selfloop transitions, 419 changer transitions 157/1194 dead transitions. [2025-01-10 01:10:52,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 1194 transitions, 8412 flow [2025-01-10 01:10:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-01-10 01:10:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2025-01-10 01:10:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 1544 transitions. [2025-01-10 01:10:52,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23493609251369446 [2025-01-10 01:10:52,361 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 460 flow. Second operand 124 states and 1544 transitions. [2025-01-10 01:10:52,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 1194 transitions, 8412 flow [2025-01-10 01:10:52,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 1194 transitions, 8337 flow, removed 33 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:52,404 INFO L231 Difference]: Finished difference. Result has 267 places, 599 transitions, 5801 flow [2025-01-10 01:10:52,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=124, PETRI_FLOW=5801, PETRI_PLACES=267, PETRI_TRANSITIONS=599} [2025-01-10 01:10:52,405 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 215 predicate places. [2025-01-10 01:10:52,405 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 599 transitions, 5801 flow [2025-01-10 01:10:52,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 7.269230769230769) internal successors, (378), 52 states have internal predecessors, (378), 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:10:52,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:52,405 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:52,414 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:10:52,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:52,606 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:10:52,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash 571753448, now seen corresponding path program 5 times [2025-01-10 01:10:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827287017] [2025-01-10 01:10:52,609 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:10:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:52,618 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-01-10 01:10:52,641 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:10:52,642 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:10:52,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:53,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:53,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827287017] [2025-01-10 01:10:53,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827287017] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:53,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731915598] [2025-01-10 01:10:53,773 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:10:53,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:53,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:53,775 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:10:53,777 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:10:53,837 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-01-10 01:10:53,877 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:10:53,878 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:10:53,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:53,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-10 01:10:53,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:54,738 INFO L349 Elim1Store]: treesize reduction 34, result has 57.0 percent of original size [2025-01-10 01:10:54,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2025-01-10 01:10:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:10:54,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:56,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:10:56,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 233 treesize of output 1432