./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:02:33,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:02:33,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:02:33,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:02:33,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:02:33,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:02:33,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:02:33,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:02:33,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:02:33,643 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:02:33,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:02:33,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:02:33,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:02:33,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:02:33,644 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:02:33,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:02:33,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:02:33,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:02:33,645 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:02:33,645 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:02:33,645 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:02:33,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:02:33,645 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:02:33,645 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:02:33,645 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:02:33,645 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:02:33,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:02:33,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:02:33,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:02:33,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:02:33,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:02:33,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:02:33,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:02:33,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:02:33,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:02:33,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:02:33,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:02:33,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:02:33,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:02:33,647 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2025-02-06 12:02:33,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:02:33,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:02:33,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:02:33,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:02:33,949 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:02:33,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-02-06 12:02:35,181 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4868703f9/e715ea7451f74a23a24e619698a9dbe5/FLAG7dd12d9c7 [2025-02-06 12:02:35,505 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:02:35,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-02-06 12:02:35,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4868703f9/e715ea7451f74a23a24e619698a9dbe5/FLAG7dd12d9c7 [2025-02-06 12:02:35,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4868703f9/e715ea7451f74a23a24e619698a9dbe5 [2025-02-06 12:02:35,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:02:35,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:02:35,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:02:35,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:02:35,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:02:35,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35, skipping insertion in model container [2025-02-06 12:02:35,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:02:36,256 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,272 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,278 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,281 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,285 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,294 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,295 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,297 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,298 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,302 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,316 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:36,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:02:36,347 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:02:36,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:02:36,482 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:02:36,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36 WrapperNode [2025-02-06 12:02:36,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:02:36,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:02:36,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:02:36,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:02:36,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,575 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 729 [2025-02-06 12:02:36,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:02:36,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:02:36,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:02:36,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:02:36,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,637 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 3, 355, 12, 2, 12, 2]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 1, 355, 0, 0, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 5, 2, 2, 1]. [2025-02-06 12:02:36,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,669 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:02:36,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:02:36,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:02:36,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:02:36,697 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (1/1) ... [2025-02-06 12:02:36,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:02:36,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:36,735 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-02-06 12:02:36,743 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-02-06 12:02:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:02:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:02:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:02:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:02:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 12:02:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 12:02:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 12:02:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 12:02:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 12:02:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 12:02:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 12:02:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 12:02:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:02:36,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:02:37,075 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:02:37,076 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:02:37,775 INFO L? ?]: Removed 258 outVars from TransFormulas that were not future-live. [2025-02-06 12:02:37,775 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:02:37,789 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:02:37,791 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:02:37,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:02:37 BoogieIcfgContainer [2025-02-06 12:02:37,792 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:02:37,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:02:37,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:02:37,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:02:37,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:02:35" (1/3) ... [2025-02-06 12:02:37,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39568c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:02:37, skipping insertion in model container [2025-02-06 12:02:37,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:36" (2/3) ... [2025-02-06 12:02:37,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39568c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:02:37, skipping insertion in model container [2025-02-06 12:02:37,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:02:37" (3/3) ... [2025-02-06 12:02:37,800 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-02-06 12:02:37,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:02:37,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-2.i that has 2 procedures, 244 locations, 1 initial locations, 7 loop locations, and 96 error locations. [2025-02-06 12:02:37,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:02:37,864 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;@2833f8a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:02:37,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-02-06 12:02:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 144 states have (on average 1.9305555555555556) internal successors, (278), 240 states have internal predecessors, (278), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:02:37,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:37,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:02:37,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:37,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 331629, now seen corresponding path program 1 times [2025-02-06 12:02:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:37,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966806817] [2025-02-06 12:02:37,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:38,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:02:38,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:02:38,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:38,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:38,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:38,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966806817] [2025-02-06 12:02:38,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966806817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:38,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:38,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:38,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87657303] [2025-02-06 12:02:38,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:38,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:38,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:38,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:38,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:38,512 INFO L87 Difference]: Start difference. First operand has 244 states, 144 states have (on average 1.9305555555555556) internal successors, (278), 240 states have internal predecessors, (278), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02-06 12:02:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:38,709 INFO L93 Difference]: Finished difference Result 253 states and 285 transitions. [2025-02-06 12:02:38,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2025-02-06 12:02:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:38,718 INFO L225 Difference]: With dead ends: 253 [2025-02-06 12:02:38,719 INFO L226 Difference]: Without dead ends: 251 [2025-02-06 12:02:38,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:38,724 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 237 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:38,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 201 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-06 12:02:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2025-02-06 12:02:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 140 states have (on average 1.8714285714285714) internal successors, (262), 231 states have internal predecessors, (262), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 266 transitions. [2025-02-06 12:02:38,770 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 266 transitions. Word has length 3 [2025-02-06 12:02:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:38,770 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 266 transitions. [2025-02-06 12:02:38,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02-06 12:02:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2025-02-06 12:02:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:02:38,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:38,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:02:38,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:02:38,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:38,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash 331630, now seen corresponding path program 1 times [2025-02-06 12:02:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077048201] [2025-02-06 12:02:38,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:38,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:02:38,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:02:38,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:38,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:39,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:39,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077048201] [2025-02-06 12:02:39,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077048201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:39,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:39,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:39,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254693871] [2025-02-06 12:02:39,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:39,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:39,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:39,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:39,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:39,031 INFO L87 Difference]: Start difference. First operand 235 states and 266 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02-06 12:02:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:39,171 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2025-02-06 12:02:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:39,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2025-02-06 12:02:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:39,172 INFO L225 Difference]: With dead ends: 234 [2025-02-06 12:02:39,172 INFO L226 Difference]: Without dead ends: 234 [2025-02-06 12:02:39,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:39,173 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 10 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:39,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 425 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-06 12:02:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-02-06 12:02:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 140 states have (on average 1.8642857142857143) internal successors, (261), 230 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2025-02-06 12:02:39,181 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 3 [2025-02-06 12:02:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:39,181 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2025-02-06 12:02:39,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02-06 12:02:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2025-02-06 12:02:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:02:39,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:39,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:02:39,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:02:39,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:39,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:39,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1289891869, now seen corresponding path program 1 times [2025-02-06 12:02:39,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:39,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595807520] [2025-02-06 12:02:39,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:39,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:39,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:02:39,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:02:39,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:39,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:39,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595807520] [2025-02-06 12:02:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595807520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:39,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:39,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634201070] [2025-02-06 12:02:39,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:39,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:39,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:39,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:39,363 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-06 12:02:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:39,384 INFO L93 Difference]: Finished difference Result 237 states and 269 transitions. [2025-02-06 12:02:39,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:39,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-02-06 12:02:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:39,386 INFO L225 Difference]: With dead ends: 237 [2025-02-06 12:02:39,387 INFO L226 Difference]: Without dead ends: 237 [2025-02-06 12:02:39,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:39,388 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:39,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 519 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-06 12:02:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2025-02-06 12:02:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 141 states have (on average 1.8581560283687943) internal successors, (262), 231 states have internal predecessors, (262), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 266 transitions. [2025-02-06 12:02:39,402 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 266 transitions. Word has length 6 [2025-02-06 12:02:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:39,402 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 266 transitions. [2025-02-06 12:02:39,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-06 12:02:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2025-02-06 12:02:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:02:39,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:39,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:02:39,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:02:39,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:39,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1289892030, now seen corresponding path program 1 times [2025-02-06 12:02:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384336553] [2025-02-06 12:02:39,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:39,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:02:39,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:02:39,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:39,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:39,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:39,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384336553] [2025-02-06 12:02:39,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384336553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:39,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:39,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:39,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422206344] [2025-02-06 12:02:39,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:39,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:02:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:39,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:02:39,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:02:39,698 INFO L87 Difference]: Start difference. First operand 235 states and 266 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-02-06 12:02:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:39,901 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2025-02-06 12:02:39,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:02:39,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) Word has length 6 [2025-02-06 12:02:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:39,906 INFO L225 Difference]: With dead ends: 237 [2025-02-06 12:02:39,906 INFO L226 Difference]: Without dead ends: 237 [2025-02-06 12:02:39,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:02:39,907 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 10 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:39,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 592 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-06 12:02:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2025-02-06 12:02:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 142 states have (on average 1.852112676056338) internal successors, (263), 232 states have internal predecessors, (263), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 267 transitions. [2025-02-06 12:02:39,922 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 267 transitions. Word has length 6 [2025-02-06 12:02:39,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:39,922 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 267 transitions. [2025-02-06 12:02:39,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-02-06 12:02:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 267 transitions. [2025-02-06 12:02:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:02:39,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:39,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:39,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:02:39,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:39,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash 101300744, now seen corresponding path program 1 times [2025-02-06 12:02:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:39,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831372492] [2025-02-06 12:02:39,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:39,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:02:39,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:02:39,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:39,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:40,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831372492] [2025-02-06 12:02:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831372492] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549558569] [2025-02-06 12:02:40,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:40,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:40,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:40,085 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-02-06 12:02:40,087 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-02-06 12:02:40,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:02:40,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:02:40,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:40,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:40,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:02:40,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:40,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549558569] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:40,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:02:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128537527] [2025-02-06 12:02:40,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:40,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:40,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:40,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:40,346 INFO L87 Difference]: Start difference. First operand 236 states and 267 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-02-06 12:02:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:40,371 INFO L93 Difference]: Finished difference Result 244 states and 277 transitions. [2025-02-06 12:02:40,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:02:40,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) Word has length 9 [2025-02-06 12:02:40,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:40,372 INFO L225 Difference]: With dead ends: 244 [2025-02-06 12:02:40,372 INFO L226 Difference]: Without dead ends: 244 [2025-02-06 12:02:40,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:40,374 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 4 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:40,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 519 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-06 12:02:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-02-06 12:02:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 150 states have (on average 1.82) internal successors, (273), 240 states have internal predecessors, (273), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 277 transitions. [2025-02-06 12:02:40,381 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 277 transitions. Word has length 9 [2025-02-06 12:02:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:40,381 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 277 transitions. [2025-02-06 12:02:40,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-02-06 12:02:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 277 transitions. [2025-02-06 12:02:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:02:40,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:40,381 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:40,390 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-02-06 12:02:40,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:40,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:40,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash 101300905, now seen corresponding path program 1 times [2025-02-06 12:02:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:40,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494486208] [2025-02-06 12:02:40,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:40,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:02:40,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:02:40,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:40,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:40,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494486208] [2025-02-06 12:02:40,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494486208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835599986] [2025-02-06 12:02:40,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:40,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:40,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:40,863 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-02-06 12:02:40,865 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-02-06 12:02:40,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:02:41,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:02:41,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:41,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:41,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:02:41,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:41,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:41,227 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 7 treesize of output 5 [2025-02-06 12:02:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835599986] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:41,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:41,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:02:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986912703] [2025-02-06 12:02:41,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:41,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:02:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:41,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:02:41,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:02:41,238 INFO L87 Difference]: Start difference. First operand 244 states and 277 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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-02-06 12:02:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:41,509 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2025-02-06 12:02:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:02:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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) Word has length 9 [2025-02-06 12:02:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:41,511 INFO L225 Difference]: With dead ends: 243 [2025-02-06 12:02:41,511 INFO L226 Difference]: Without dead ends: 243 [2025-02-06 12:02:41,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:02:41,511 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 506 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:41,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 769 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-06 12:02:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-02-06 12:02:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 150 states have (on average 1.8) internal successors, (270), 239 states have internal predecessors, (270), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 274 transitions. [2025-02-06 12:02:41,516 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 274 transitions. Word has length 9 [2025-02-06 12:02:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:41,516 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 274 transitions. [2025-02-06 12:02:41,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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-02-06 12:02:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2025-02-06 12:02:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 12:02:41,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:41,517 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:41,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:02:41,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:41,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:41,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:41,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1697185699, now seen corresponding path program 2 times [2025-02-06 12:02:41,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:41,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033568340] [2025-02-06 12:02:41,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:41,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:41,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 12:02:41,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-06 12:02:41,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:02:41,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 12:02:41,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:41,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033568340] [2025-02-06 12:02:41,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033568340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:41,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:41,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:02:41,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124435915] [2025-02-06 12:02:41,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:41,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:02:41,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:41,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:02:41,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:41,935 INFO L87 Difference]: Start difference. First operand 243 states and 274 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-02-06 12:02:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:42,064 INFO L93 Difference]: Finished difference Result 258 states and 290 transitions. [2025-02-06 12:02:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:42,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 18 [2025-02-06 12:02:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:42,065 INFO L225 Difference]: With dead ends: 258 [2025-02-06 12:02:42,065 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 12:02:42,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:42,066 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 477 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:42,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 230 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 12:02:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 242. [2025-02-06 12:02:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 150 states have (on average 1.7933333333333332) internal successors, (269), 238 states have internal predecessors, (269), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 273 transitions. [2025-02-06 12:02:42,073 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 273 transitions. Word has length 18 [2025-02-06 12:02:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 273 transitions. [2025-02-06 12:02:42,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-02-06 12:02:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 273 transitions. [2025-02-06 12:02:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 12:02:42,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:42,074 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:42,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:02:42,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:42,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1697185698, now seen corresponding path program 1 times [2025-02-06 12:02:42,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:42,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686169863] [2025-02-06 12:02:42,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:42,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:42,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:02:42,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:02:42,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:42,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:42,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686169863] [2025-02-06 12:02:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686169863] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745605415] [2025-02-06 12:02:42,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:42,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:42,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:42,300 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-02-06 12:02:42,301 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-02-06 12:02:42,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:02:42,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:02:42,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:42,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:42,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:02:42,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:42,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:42,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745605415] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:42,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:42,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 12:02:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852124390] [2025-02-06 12:02:42,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:42,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:02:42,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:42,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:02:42,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:42,602 INFO L87 Difference]: Start difference. First operand 242 states and 273 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-02-06 12:02:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:42,654 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2025-02-06 12:02:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:02:42,657 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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) Word has length 18 [2025-02-06 12:02:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:42,658 INFO L225 Difference]: With dead ends: 260 [2025-02-06 12:02:42,658 INFO L226 Difference]: Without dead ends: 260 [2025-02-06 12:02:42,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:42,658 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 4 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:42,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1031 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-06 12:02:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-02-06 12:02:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 168 states have (on average 1.7083333333333333) internal successors, (287), 256 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 291 transitions. [2025-02-06 12:02:42,667 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 291 transitions. Word has length 18 [2025-02-06 12:02:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:42,667 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 291 transitions. [2025-02-06 12:02:42,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-02-06 12:02:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 291 transitions. [2025-02-06 12:02:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:02:42,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:42,669 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:42,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:02:42,869 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-02-06 12:02:42,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:42,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash 164971710, now seen corresponding path program 2 times [2025-02-06 12:02:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:42,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085821493] [2025-02-06 12:02:42,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:42,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:42,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 12:02:42,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-02-06 12:02:42,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:02:42,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:43,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:43,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085821493] [2025-02-06 12:02:43,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085821493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:43,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:43,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:43,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297533417] [2025-02-06 12:02:43,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:43,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:02:43,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:43,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:02:43,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:43,088 INFO L87 Difference]: Start difference. First operand 260 states and 291 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-02-06 12:02:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:43,273 INFO L93 Difference]: Finished difference Result 275 states and 307 transitions. [2025-02-06 12:02:43,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:02:43,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 36 [2025-02-06 12:02:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:43,274 INFO L225 Difference]: With dead ends: 275 [2025-02-06 12:02:43,274 INFO L226 Difference]: Without dead ends: 275 [2025-02-06 12:02:43,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:43,275 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 762 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:43,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 146 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-06 12:02:43,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 259. [2025-02-06 12:02:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 168 states have (on average 1.7023809523809523) internal successors, (286), 255 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2025-02-06 12:02:43,285 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 36 [2025-02-06 12:02:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:43,285 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2025-02-06 12:02:43,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-02-06 12:02:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2025-02-06 12:02:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:02:43,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:43,286 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:43,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:02:43,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:43,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1648594014, now seen corresponding path program 1 times [2025-02-06 12:02:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:43,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688389628] [2025-02-06 12:02:43,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:43,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:43,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:02:43,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:02:43,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:43,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:43,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:43,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688389628] [2025-02-06 12:02:43,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688389628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:43,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:43,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:43,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314262105] [2025-02-06 12:02:43,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:43,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:43,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:43,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:43,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:43,552 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:43,673 INFO L93 Difference]: Finished difference Result 270 states and 302 transitions. [2025-02-06 12:02:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:43,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-02-06 12:02:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:43,675 INFO L225 Difference]: With dead ends: 270 [2025-02-06 12:02:43,675 INFO L226 Difference]: Without dead ends: 270 [2025-02-06 12:02:43,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:43,675 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 217 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:43,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 203 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-06 12:02:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 254. [2025-02-06 12:02:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 168 states have (on average 1.6726190476190477) internal successors, (281), 250 states have internal predecessors, (281), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2025-02-06 12:02:43,688 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 44 [2025-02-06 12:02:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:43,689 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2025-02-06 12:02:43,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2025-02-06 12:02:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:02:43,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:43,691 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:43,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:02:43,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:43,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1648594015, now seen corresponding path program 1 times [2025-02-06 12:02:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:43,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693311639] [2025-02-06 12:02:43,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:43,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:43,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:02:43,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:02:43,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:43,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693311639] [2025-02-06 12:02:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693311639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:44,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:44,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:44,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624734607] [2025-02-06 12:02:44,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:44,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:44,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:44,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:44,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:44,304 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:44,546 INFO L93 Difference]: Finished difference Result 415 states and 476 transitions. [2025-02-06 12:02:44,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:02:44,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-02-06 12:02:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:44,548 INFO L225 Difference]: With dead ends: 415 [2025-02-06 12:02:44,549 INFO L226 Difference]: Without dead ends: 415 [2025-02-06 12:02:44,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:44,549 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 1003 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:44,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 734 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-06 12:02:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 253. [2025-02-06 12:02:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 168 states have (on average 1.6666666666666667) internal successors, (280), 249 states have internal predecessors, (280), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2025-02-06 12:02:44,559 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 44 [2025-02-06 12:02:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:44,559 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2025-02-06 12:02:44,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2025-02-06 12:02:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:02:44,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:44,560 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:44,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:02:44,560 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:44,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:44,561 INFO L85 PathProgramCache]: Analyzing trace with hash 313492509, now seen corresponding path program 1 times [2025-02-06 12:02:44,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:44,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190607601] [2025-02-06 12:02:44,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:44,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:44,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:02:44,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:02:44,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:44,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:44,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190607601] [2025-02-06 12:02:44,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190607601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:44,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:44,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:02:44,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014945248] [2025-02-06 12:02:44,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:44,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:02:44,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:44,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:02:44,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:44,907 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:45,121 INFO L93 Difference]: Finished difference Result 287 states and 322 transitions. [2025-02-06 12:02:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:02:45,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-06 12:02:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:45,123 INFO L225 Difference]: With dead ends: 287 [2025-02-06 12:02:45,123 INFO L226 Difference]: Without dead ends: 287 [2025-02-06 12:02:45,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:45,123 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 493 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:45,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 291 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-06 12:02:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 266. [2025-02-06 12:02:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 182 states have (on average 1.6538461538461537) internal successors, (301), 262 states have internal predecessors, (301), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 305 transitions. [2025-02-06 12:02:45,129 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 305 transitions. Word has length 47 [2025-02-06 12:02:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:45,129 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 305 transitions. [2025-02-06 12:02:45,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 305 transitions. [2025-02-06 12:02:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:02:45,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:45,130 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:45,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:02:45,130 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:45,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:45,131 INFO L85 PathProgramCache]: Analyzing trace with hash 313491580, now seen corresponding path program 1 times [2025-02-06 12:02:45,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:45,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813121595] [2025-02-06 12:02:45,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:45,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:45,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:02:45,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:02:45,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:45,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:45,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:45,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813121595] [2025-02-06 12:02:45,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813121595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:45,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:45,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:45,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497101519] [2025-02-06 12:02:45,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:45,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:02:45,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:45,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:02:45,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:02:45,290 INFO L87 Difference]: Start difference. First operand 266 states and 305 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:45,447 INFO L93 Difference]: Finished difference Result 297 states and 343 transitions. [2025-02-06 12:02:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:02:45,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-06 12:02:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:45,448 INFO L225 Difference]: With dead ends: 297 [2025-02-06 12:02:45,448 INFO L226 Difference]: Without dead ends: 297 [2025-02-06 12:02:45,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:45,449 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 371 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:45,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 271 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-06 12:02:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 259. [2025-02-06 12:02:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 255 states have internal predecessors, (294), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 298 transitions. [2025-02-06 12:02:45,454 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 298 transitions. Word has length 47 [2025-02-06 12:02:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:45,454 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 298 transitions. [2025-02-06 12:02:45,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 298 transitions. [2025-02-06 12:02:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:02:45,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:45,455 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:45,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:02:45,455 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:45,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash 313491581, now seen corresponding path program 1 times [2025-02-06 12:02:45,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:45,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783153396] [2025-02-06 12:02:45,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:45,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:02:45,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:02:45,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:45,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:45,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:45,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783153396] [2025-02-06 12:02:45,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783153396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:45,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:45,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:45,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944668154] [2025-02-06 12:02:45,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:45,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:02:45,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:45,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:02:45,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:45,682 INFO L87 Difference]: Start difference. First operand 259 states and 298 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:45,738 INFO L93 Difference]: Finished difference Result 264 states and 297 transitions. [2025-02-06 12:02:45,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:02:45,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-06 12:02:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:45,740 INFO L225 Difference]: With dead ends: 264 [2025-02-06 12:02:45,740 INFO L226 Difference]: Without dead ends: 264 [2025-02-06 12:02:45,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:45,741 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 230 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:45,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 944 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-06 12:02:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 259. [2025-02-06 12:02:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 182 states have (on average 1.60989010989011) internal successors, (293), 255 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 297 transitions. [2025-02-06 12:02:45,746 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 297 transitions. Word has length 47 [2025-02-06 12:02:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:45,746 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 297 transitions. [2025-02-06 12:02:45,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 297 transitions. [2025-02-06 12:02:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:02:45,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:45,747 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:45,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:02:45,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:45,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1996650489, now seen corresponding path program 1 times [2025-02-06 12:02:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:45,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976658033] [2025-02-06 12:02:45,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:45,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:02:45,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:02:45,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:45,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:46,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976658033] [2025-02-06 12:02:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976658033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:46,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:46,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912624458] [2025-02-06 12:02:46,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:46,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:46,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:46,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:46,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:46,020 INFO L87 Difference]: Start difference. First operand 259 states and 297 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:46,119 INFO L93 Difference]: Finished difference Result 264 states and 304 transitions. [2025-02-06 12:02:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:46,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-06 12:02:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:46,120 INFO L225 Difference]: With dead ends: 264 [2025-02-06 12:02:46,120 INFO L226 Difference]: Without dead ends: 264 [2025-02-06 12:02:46,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:46,122 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 203 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:46,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 199 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-06 12:02:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2025-02-06 12:02:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 187 states have (on average 1.6042780748663101) internal successors, (300), 259 states have internal predecessors, (300), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2025-02-06 12:02:46,126 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 50 [2025-02-06 12:02:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:46,127 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2025-02-06 12:02:46,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2025-02-06 12:02:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:02:46,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:46,127 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:46,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:02:46,128 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:46,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1996650490, now seen corresponding path program 1 times [2025-02-06 12:02:46,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:46,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352060919] [2025-02-06 12:02:46,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:46,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:46,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:02:46,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:02:46,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:46,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:46,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:46,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352060919] [2025-02-06 12:02:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352060919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:46,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:46,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103320140] [2025-02-06 12:02:46,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:46,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:46,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:46,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:46,612 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:46,982 INFO L93 Difference]: Finished difference Result 273 states and 309 transitions. [2025-02-06 12:02:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:02:46,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-06 12:02:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:46,984 INFO L225 Difference]: With dead ends: 273 [2025-02-06 12:02:46,984 INFO L226 Difference]: Without dead ends: 273 [2025-02-06 12:02:46,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:02:46,985 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 232 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:46,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 386 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:02:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-06 12:02:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 263. [2025-02-06 12:02:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 187 states have (on average 1.5989304812834224) internal successors, (299), 259 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 303 transitions. [2025-02-06 12:02:46,991 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 303 transitions. Word has length 50 [2025-02-06 12:02:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:46,991 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 303 transitions. [2025-02-06 12:02:46,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 303 transitions. [2025-02-06 12:02:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 12:02:46,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:46,992 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:46,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:02:46,992 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:46,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:46,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1212874709, now seen corresponding path program 1 times [2025-02-06 12:02:46,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:46,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280713580] [2025-02-06 12:02:46,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:46,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:47,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:02:47,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:02:47,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:47,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:47,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:47,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280713580] [2025-02-06 12:02:47,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280713580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:47,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:47,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:02:47,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777671075] [2025-02-06 12:02:47,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:47,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:02:47,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:47,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:02:47,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:47,240 INFO L87 Difference]: Start difference. First operand 263 states and 303 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:47,416 INFO L93 Difference]: Finished difference Result 262 states and 301 transitions. [2025-02-06 12:02:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:02:47,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-02-06 12:02:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:47,417 INFO L225 Difference]: With dead ends: 262 [2025-02-06 12:02:47,417 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 12:02:47,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:47,418 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 12 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:47,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 705 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 12:02:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-02-06 12:02:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 187 states have (on average 1.588235294117647) internal successors, (297), 258 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 301 transitions. [2025-02-06 12:02:47,426 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 301 transitions. Word has length 53 [2025-02-06 12:02:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:47,426 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 301 transitions. [2025-02-06 12:02:47,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 301 transitions. [2025-02-06 12:02:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 12:02:47,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:47,428 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:47,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:02:47,428 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:47,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1212874710, now seen corresponding path program 1 times [2025-02-06 12:02:47,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:47,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067594549] [2025-02-06 12:02:47,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:47,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:47,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:02:47,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:02:47,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:47,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:47,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:47,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067594549] [2025-02-06 12:02:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067594549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:47,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:47,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:02:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552050218] [2025-02-06 12:02:47,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:47,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:02:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:47,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:02:47,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:47,796 INFO L87 Difference]: Start difference. First operand 262 states and 301 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:47,974 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2025-02-06 12:02:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:02:47,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-02-06 12:02:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:47,975 INFO L225 Difference]: With dead ends: 261 [2025-02-06 12:02:47,975 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 12:02:47,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:47,976 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 11 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:47,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 707 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 12:02:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-02-06 12:02:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 187 states have (on average 1.5775401069518717) internal successors, (295), 257 states have internal predecessors, (295), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 299 transitions. [2025-02-06 12:02:47,980 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 299 transitions. Word has length 53 [2025-02-06 12:02:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:47,980 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 299 transitions. [2025-02-06 12:02:47,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 299 transitions. [2025-02-06 12:02:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 12:02:47,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:47,981 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-02-06 12:02:47,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:02:47,981 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:47,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash 685429897, now seen corresponding path program 1 times [2025-02-06 12:02:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46273980] [2025-02-06 12:02:47,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:48,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 12:02:48,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 12:02:48,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:48,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46273980] [2025-02-06 12:02:48,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46273980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:48,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:48,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416964714] [2025-02-06 12:02:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:48,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:48,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:48,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:48,099 INFO L87 Difference]: Start difference. First operand 261 states and 299 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:48,110 INFO L93 Difference]: Finished difference Result 273 states and 314 transitions. [2025-02-06 12:02:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:48,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-02-06 12:02:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:48,111 INFO L225 Difference]: With dead ends: 273 [2025-02-06 12:02:48,111 INFO L226 Difference]: Without dead ends: 273 [2025-02-06 12:02:48,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:48,112 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 6 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:48,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 479 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-06 12:02:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 263. [2025-02-06 12:02:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 189 states have (on average 1.5714285714285714) internal successors, (297), 259 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 301 transitions. [2025-02-06 12:02:48,117 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 301 transitions. Word has length 57 [2025-02-06 12:02:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:48,117 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 301 transitions. [2025-02-06 12:02:48,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 301 transitions. [2025-02-06 12:02:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 12:02:48,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:48,118 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-02-06 12:02:48,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:02:48,118 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:48,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -226263121, now seen corresponding path program 1 times [2025-02-06 12:02:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:48,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803062956] [2025-02-06 12:02:48,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:48,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 12:02:48,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 12:02:48,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:48,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:48,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803062956] [2025-02-06 12:02:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803062956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:48,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:48,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:02:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129011114] [2025-02-06 12:02:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:48,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:02:48,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:48,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:02:48,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:48,321 INFO L87 Difference]: Start difference. First operand 263 states and 301 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:48,492 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2025-02-06 12:02:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:02:48,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-02-06 12:02:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:48,494 INFO L225 Difference]: With dead ends: 262 [2025-02-06 12:02:48,494 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 12:02:48,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:48,495 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 5 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:48,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 765 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 12:02:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-02-06 12:02:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 189 states have (on average 1.560846560846561) internal successors, (295), 258 states have internal predecessors, (295), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 299 transitions. [2025-02-06 12:02:48,504 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 299 transitions. Word has length 58 [2025-02-06 12:02:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:48,504 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 299 transitions. [2025-02-06 12:02:48,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 299 transitions. [2025-02-06 12:02:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 12:02:48,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:48,506 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-02-06 12:02:48,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:02:48,507 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:48,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash -226263120, now seen corresponding path program 1 times [2025-02-06 12:02:48,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:48,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333395169] [2025-02-06 12:02:48,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:48,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 12:02:48,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 12:02:48,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:48,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333395169] [2025-02-06 12:02:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333395169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:49,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:49,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:49,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528629791] [2025-02-06 12:02:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:49,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:49,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:49,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:49,031 INFO L87 Difference]: Start difference. First operand 262 states and 299 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:49,269 INFO L93 Difference]: Finished difference Result 270 states and 308 transitions. [2025-02-06 12:02:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:02:49,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-02-06 12:02:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:49,270 INFO L225 Difference]: With dead ends: 270 [2025-02-06 12:02:49,270 INFO L226 Difference]: Without dead ends: 270 [2025-02-06 12:02:49,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:02:49,271 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 14 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:49,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 854 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-06 12:02:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2025-02-06 12:02:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 195 states have (on average 1.5487179487179488) internal successors, (302), 264 states have internal predecessors, (302), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 306 transitions. [2025-02-06 12:02:49,275 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 306 transitions. Word has length 58 [2025-02-06 12:02:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:49,275 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 306 transitions. [2025-02-06 12:02:49,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 306 transitions. [2025-02-06 12:02:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 12:02:49,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:49,277 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:49,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:02:49,277 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:49,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:49,278 INFO L85 PathProgramCache]: Analyzing trace with hash 12042252, now seen corresponding path program 1 times [2025-02-06 12:02:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:49,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457617307] [2025-02-06 12:02:49,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:49,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 12:02:49,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 12:02:49,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:49,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457617307] [2025-02-06 12:02:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457617307] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233192153] [2025-02-06 12:02:49,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:49,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:49,400 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-02-06 12:02:49,402 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-02-06 12:02:49,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 12:02:49,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 12:02:49,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:49,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:49,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:02:49,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:49,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:49,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233192153] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:49,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:49,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:02:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808835340] [2025-02-06 12:02:49,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:49,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:49,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:49,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:49,745 INFO L87 Difference]: Start difference. First operand 268 states and 306 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:49,769 INFO L93 Difference]: Finished difference Result 295 states and 336 transitions. [2025-02-06 12:02:49,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:02:49,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-02-06 12:02:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:49,771 INFO L225 Difference]: With dead ends: 295 [2025-02-06 12:02:49,771 INFO L226 Difference]: Without dead ends: 295 [2025-02-06 12:02:49,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:49,774 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 14 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:49,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 951 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-06 12:02:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2025-02-06 12:02:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 219 states have (on average 1.5159817351598173) internal successors, (332), 288 states have internal predecessors, (332), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 336 transitions. [2025-02-06 12:02:49,779 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 336 transitions. Word has length 62 [2025-02-06 12:02:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:49,779 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 336 transitions. [2025-02-06 12:02:49,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 336 transitions. [2025-02-06 12:02:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 12:02:49,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:49,780 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-02-06 12:02:49,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:02:49,980 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,SelfDestructingSolverStorable21 [2025-02-06 12:02:49,981 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:49,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash 373556365, now seen corresponding path program 1 times [2025-02-06 12:02:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:49,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262282064] [2025-02-06 12:02:49,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:50,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:02:50,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:02:50,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:50,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:50,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:50,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262282064] [2025-02-06 12:02:50,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262282064] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:50,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206535739] [2025-02-06 12:02:50,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:50,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:50,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:50,472 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-02-06 12:02:50,473 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-02-06 12:02:50,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:02:50,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:02:50,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:50,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:50,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 12:02:50,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:50,786 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-02-06 12:02:50,804 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-02-06 12:02:50,811 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-02-06 12:02:50,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2025-02-06 12:02:50,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-02-06 12:02:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:50,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:51,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206535739] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:51,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:51,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-02-06 12:02:51,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002705253] [2025-02-06 12:02:51,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:51,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 12:02:51,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:51,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 12:02:51,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:02:51,187 INFO L87 Difference]: Start difference. First operand 292 states and 336 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:51,872 INFO L93 Difference]: Finished difference Result 291 states and 330 transitions. [2025-02-06 12:02:51,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:02:51,873 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-02-06 12:02:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:51,874 INFO L225 Difference]: With dead ends: 291 [2025-02-06 12:02:51,874 INFO L226 Difference]: Without dead ends: 291 [2025-02-06 12:02:51,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2025-02-06 12:02:51,875 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 33 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:51,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1945 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:02:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-06 12:02:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-02-06 12:02:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 219 states have (on average 1.4885844748858448) internal successors, (326), 287 states have internal predecessors, (326), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 330 transitions. [2025-02-06 12:02:51,882 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 330 transitions. Word has length 63 [2025-02-06 12:02:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:51,882 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 330 transitions. [2025-02-06 12:02:51,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 330 transitions. [2025-02-06 12:02:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:02:51,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:51,883 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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-02-06 12:02:51,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 12:02:52,083 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,SelfDestructingSolverStorable22 [2025-02-06 12:02:52,084 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:52,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1280348087, now seen corresponding path program 2 times [2025-02-06 12:02:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:52,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577227742] [2025-02-06 12:02:52,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:52,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-06 12:02:52,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:02:52,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:02:52,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577227742] [2025-02-06 12:02:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577227742] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420589584] [2025-02-06 12:02:52,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:52,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:52,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:52,357 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-02-06 12:02:52,360 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-02-06 12:02:52,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-06 12:02:52,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:02:52,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:02:52,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:52,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:02:52,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:52,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:52,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420589584] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:52,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:52,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 12:02:52,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636263635] [2025-02-06 12:02:52,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:52,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:02:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:52,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:02:52,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:52,929 INFO L87 Difference]: Start difference. First operand 291 states and 330 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:52,990 INFO L93 Difference]: Finished difference Result 360 states and 396 transitions. [2025-02-06 12:02:52,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:02:52,991 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2025-02-06 12:02:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:52,992 INFO L225 Difference]: With dead ends: 360 [2025-02-06 12:02:52,992 INFO L226 Difference]: Without dead ends: 360 [2025-02-06 12:02:52,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:52,993 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 25 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:52,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1437 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-06 12:02:53,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 351. [2025-02-06 12:02:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 279 states have (on average 1.4050179211469533) internal successors, (392), 347 states have internal predecessors, (392), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 396 transitions. [2025-02-06 12:02:53,003 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 396 transitions. Word has length 77 [2025-02-06 12:02:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:53,004 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 396 transitions. [2025-02-06 12:02:53,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 396 transitions. [2025-02-06 12:02:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 12:02:53,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:53,005 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-02-06 12:02:53,019 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-02-06 12:02:53,205 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,SelfDestructingSolverStorable23 [2025-02-06 12:02:53,206 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:53,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:53,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1241449961, now seen corresponding path program 3 times [2025-02-06 12:02:53,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948201738] [2025-02-06 12:02:53,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:02:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:53,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 12 equivalence classes. [2025-02-06 12:02:53,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 107 statements. [2025-02-06 12:02:53,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 12:02:53,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:53,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948201738] [2025-02-06 12:02:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948201738] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804989683] [2025-02-06 12:02:53,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:02:53,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:53,770 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-02-06 12:02:53,782 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-02-06 12:02:54,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 12 equivalence classes. [2025-02-06 12:02:54,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 107 statements. [2025-02-06 12:02:54,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 12:02:54,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:54,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:02:54,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:54,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:02:54,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-02-06 12:02:54,290 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:02:54,293 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-02-06 12:02:54,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:02:54,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-02-06 12:02:54,787 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:02:54,787 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-02-06 12:02:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:54,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:55,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:02:55,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 72 [2025-02-06 12:02:56,032 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 66 treesize of output 62 [2025-02-06 12:02:56,054 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-06 12:02:56,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 59 [2025-02-06 12:02:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:56,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804989683] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:56,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:56,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-02-06 12:02:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525707633] [2025-02-06 12:02:56,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:56,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:02:56,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:56,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:02:56,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-06 12:02:56,091 INFO L87 Difference]: Start difference. First operand 351 states and 396 transitions. Second operand has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:56,679 INFO L93 Difference]: Finished difference Result 355 states and 391 transitions. [2025-02-06 12:02:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:02:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2025-02-06 12:02:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:56,681 INFO L225 Difference]: With dead ends: 355 [2025-02-06 12:02:56,681 INFO L226 Difference]: Without dead ends: 355 [2025-02-06 12:02:56,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-02-06 12:02:56,681 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 632 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:56,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 975 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:02:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-06 12:02:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 292. [2025-02-06 12:02:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 288 states have internal predecessors, (323), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 327 transitions. [2025-02-06 12:02:56,690 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 327 transitions. Word has length 107 [2025-02-06 12:02:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:56,690 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 327 transitions. [2025-02-06 12:02:56,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 327 transitions. [2025-02-06 12:02:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 12:02:56,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:56,691 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-02-06 12:02:56,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:02:56,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:56,892 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:56,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1241449033, now seen corresponding path program 1 times [2025-02-06 12:02:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:56,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107232028] [2025-02-06 12:02:56,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:56,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:56,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 12:02:56,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 12:02:56,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:56,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:57,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:57,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107232028] [2025-02-06 12:02:57,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107232028] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:57,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187378468] [2025-02-06 12:02:57,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:57,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:57,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:57,427 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-02-06 12:02:57,432 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-02-06 12:02:57,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 12:02:57,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 12:02:57,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:57,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:57,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 12:02:57,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:57,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:02:57,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 12:02:57,832 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:02:57,832 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-02-06 12:02:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:57,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:58,269 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 49 treesize of output 45 [2025-02-06 12:02:58,290 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-06 12:02:58,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 49 [2025-02-06 12:02:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187378468] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:58,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:58,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-02-06 12:02:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107067358] [2025-02-06 12:02:58,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:58,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:02:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:58,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:02:58,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-02-06 12:02:58,320 INFO L87 Difference]: Start difference. First operand 292 states and 327 transitions. Second operand has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:58,834 INFO L93 Difference]: Finished difference Result 356 states and 390 transitions. [2025-02-06 12:02:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:02:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2025-02-06 12:02:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:58,836 INFO L225 Difference]: With dead ends: 356 [2025-02-06 12:02:58,836 INFO L226 Difference]: Without dead ends: 356 [2025-02-06 12:02:58,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:02:58,836 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1054 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:58,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 628 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:02:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-06 12:02:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 289. [2025-02-06 12:02:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 224 states have (on average 1.4285714285714286) internal successors, (320), 285 states have internal predecessors, (320), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 324 transitions. [2025-02-06 12:02:58,843 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 324 transitions. Word has length 107 [2025-02-06 12:02:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:58,843 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 324 transitions. [2025-02-06 12:02:58,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 324 transitions. [2025-02-06 12:02:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 12:02:58,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:58,844 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-02-06 12:02:58,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 12:02:59,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 12:02:59,045 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:02:59,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:59,045 INFO L85 PathProgramCache]: Analyzing trace with hash 72618670, now seen corresponding path program 1 times [2025-02-06 12:02:59,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:59,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452404780] [2025-02-06 12:02:59,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:59,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:59,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 12:02:59,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 12:02:59,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:59,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:59,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:59,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452404780] [2025-02-06 12:02:59,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452404780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:59,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023599475] [2025-02-06 12:02:59,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:59,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:59,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:59,989 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-02-06 12:02:59,990 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-02-06 12:03:00,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 12:03:00,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 12:03:00,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:00,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:00,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 12:03:00,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:00,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2025-02-06 12:03:00,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:03:00,484 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-02-06 12:03:00,484 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 1 case distinctions, treesize of input 21 treesize of output 23 [2025-02-06 12:03:00,631 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:03:00,633 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-02-06 12:03:00,648 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-02-06 12:03:00,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2025-02-06 12:03:00,728 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 15 treesize of output 1 [2025-02-06 12:03:02,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-02-06 12:03:02,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:02,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2025-02-06 12:03:02,253 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:03:02,253 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-02-06 12:03:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-02-06 12:03:02,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:03,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:03:03,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 61 [2025-02-06 12:03:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023599475] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:03,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 23 [2025-02-06 12:03:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959651700] [2025-02-06 12:03:03,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:03,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:03:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:03,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:03:03,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-02-06 12:03:03,551 INFO L87 Difference]: Start difference. First operand 289 states and 324 transitions. Second operand has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 24 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:04,856 INFO L93 Difference]: Finished difference Result 477 states and 529 transitions. [2025-02-06 12:03:04,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:03:04,857 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 24 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-02-06 12:03:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:04,859 INFO L225 Difference]: With dead ends: 477 [2025-02-06 12:03:04,859 INFO L226 Difference]: Without dead ends: 477 [2025-02-06 12:03:04,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 12:03:04,860 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 948 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:04,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1098 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 12:03:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-02-06 12:03:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 328. [2025-02-06 12:03:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 323 states have internal predecessors, (387), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 393 transitions. [2025-02-06 12:03:04,868 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 393 transitions. Word has length 110 [2025-02-06 12:03:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:04,869 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 393 transitions. [2025-02-06 12:03:04,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 24 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 393 transitions. [2025-02-06 12:03:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 12:03:04,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:04,870 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-02-06 12:03:04,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 12:03:05,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:05,072 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:05,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:05,073 INFO L85 PathProgramCache]: Analyzing trace with hash 44941613, now seen corresponding path program 1 times [2025-02-06 12:03:05,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:05,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691717444] [2025-02-06 12:03:05,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:05,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:05,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 12:03:05,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 12:03:05,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:05,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:05,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:05,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691717444] [2025-02-06 12:03:05,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691717444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:05,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:05,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:03:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578879530] [2025-02-06 12:03:05,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:05,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:03:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:05,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:03:05,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:05,676 INFO L87 Difference]: Start difference. First operand 328 states and 393 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:05,840 INFO L93 Difference]: Finished difference Result 376 states and 452 transitions. [2025-02-06 12:03:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:03:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-02-06 12:03:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:05,842 INFO L225 Difference]: With dead ends: 376 [2025-02-06 12:03:05,842 INFO L226 Difference]: Without dead ends: 376 [2025-02-06 12:03:05,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:03:05,843 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 358 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:05,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 645 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-06 12:03:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 331. [2025-02-06 12:03:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 266 states have (on average 1.4699248120300752) internal successors, (391), 326 states have internal predecessors, (391), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 397 transitions. [2025-02-06 12:03:05,850 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 397 transitions. Word has length 110 [2025-02-06 12:03:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:05,851 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 397 transitions. [2025-02-06 12:03:05,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 397 transitions. [2025-02-06 12:03:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 12:03:05,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:05,852 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:05,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 12:03:05,852 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:05,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash 239027974, now seen corresponding path program 1 times [2025-02-06 12:03:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380555510] [2025-02-06 12:03:05,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:05,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 12:03:05,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 12:03:05,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:05,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:06,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:06,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380555510] [2025-02-06 12:03:06,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380555510] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:06,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883766891] [2025-02-06 12:03:06,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:06,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:06,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:06,320 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-02-06 12:03:06,322 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-02-06 12:03:06,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 12:03:06,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 12:03:06,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:06,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:06,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 1550 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:03:06,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:06,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:07,112 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-02-06 12:03:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:07,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883766891] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:07,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:07,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-02-06 12:03:07,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749329892] [2025-02-06 12:03:07,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:07,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:03:07,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:07,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:03:07,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:03:07,140 INFO L87 Difference]: Start difference. First operand 331 states and 397 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:07,421 INFO L93 Difference]: Finished difference Result 413 states and 462 transitions. [2025-02-06 12:03:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:03:07,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2025-02-06 12:03:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:07,423 INFO L225 Difference]: With dead ends: 413 [2025-02-06 12:03:07,423 INFO L226 Difference]: Without dead ends: 413 [2025-02-06 12:03:07,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:03:07,424 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 731 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:07,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 879 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:03:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-06 12:03:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 330. [2025-02-06 12:03:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 266 states have (on average 1.462406015037594) internal successors, (389), 325 states have internal predecessors, (389), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 395 transitions. [2025-02-06 12:03:07,436 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 395 transitions. Word has length 112 [2025-02-06 12:03:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:07,437 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 395 transitions. [2025-02-06 12:03:07,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 395 transitions. [2025-02-06 12:03:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 12:03:07,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:07,437 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:07,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 12:03:07,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 12:03:07,638 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:07,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1174095300, now seen corresponding path program 1 times [2025-02-06 12:03:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680459495] [2025-02-06 12:03:07,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:07,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 12:03:07,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 12:03:07,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:07,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:08,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:08,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680459495] [2025-02-06 12:03:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680459495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:08,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:03:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804982987] [2025-02-06 12:03:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:03:08,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:08,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:03:08,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:03:08,157 INFO L87 Difference]: Start difference. First operand 330 states and 395 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:08,239 INFO L93 Difference]: Finished difference Result 378 states and 458 transitions. [2025-02-06 12:03:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:03:08,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-02-06 12:03:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:08,241 INFO L225 Difference]: With dead ends: 378 [2025-02-06 12:03:08,241 INFO L226 Difference]: Without dead ends: 378 [2025-02-06 12:03:08,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:03:08,242 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 42 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:08,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1294 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:08,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-06 12:03:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 334. [2025-02-06 12:03:08,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 270 states have (on average 1.4592592592592593) internal successors, (394), 329 states have internal predecessors, (394), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 400 transitions. [2025-02-06 12:03:08,247 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 400 transitions. Word has length 113 [2025-02-06 12:03:08,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:08,247 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 400 transitions. [2025-02-06 12:03:08,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 400 transitions. [2025-02-06 12:03:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 12:03:08,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:08,248 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:08,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 12:03:08,248 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:08,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1180067429, now seen corresponding path program 1 times [2025-02-06 12:03:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:08,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116056969] [2025-02-06 12:03:08,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:08,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:08,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 12:03:08,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 12:03:08,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:08,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116056969] [2025-02-06 12:03:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116056969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947623479] [2025-02-06 12:03:09,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:09,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:09,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:09,052 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-02-06 12:03:09,054 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-02-06 12:03:09,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 12:03:09,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 12:03:09,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:09,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:09,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 12:03:09,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:09,527 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 15 treesize of output 1 [2025-02-06 12:03:09,580 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 15 treesize of output 11 [2025-02-06 12:03:09,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-06 12:03:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-06 12:03:09,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:09,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 12:03:09,968 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 18 treesize of output 16 [2025-02-06 12:03:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-06 12:03:10,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947623479] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:10,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:10,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2025-02-06 12:03:10,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141638531] [2025-02-06 12:03:10,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:10,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 12:03:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:10,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 12:03:10,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-02-06 12:03:10,073 INFO L87 Difference]: Start difference. First operand 334 states and 400 transitions. Second operand has 26 states, 25 states have (on average 3.48) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:10,387 INFO L93 Difference]: Finished difference Result 610 states and 743 transitions. [2025-02-06 12:03:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:03:10,387 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.48) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-02-06 12:03:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:10,389 INFO L225 Difference]: With dead ends: 610 [2025-02-06 12:03:10,389 INFO L226 Difference]: Without dead ends: 610 [2025-02-06 12:03:10,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2025-02-06 12:03:10,390 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 976 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:10,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 2873 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:03:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-02-06 12:03:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 543. [2025-02-06 12:03:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 477 states have (on average 1.4884696016771488) internal successors, (710), 536 states have internal predecessors, (710), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 720 transitions. [2025-02-06 12:03:10,399 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 720 transitions. Word has length 113 [2025-02-06 12:03:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:10,399 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 720 transitions. [2025-02-06 12:03:10,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.48) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 720 transitions. [2025-02-06 12:03:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 12:03:10,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:10,401 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:10,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 12:03:10,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-06 12:03:10,602 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:10,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1180077327, now seen corresponding path program 1 times [2025-02-06 12:03:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:10,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375012294] [2025-02-06 12:03:10,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:10,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 12:03:10,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 12:03:10,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:10,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:10,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375012294] [2025-02-06 12:03:10,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375012294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:10,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:10,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:10,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993913581] [2025-02-06 12:03:10,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:10,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:10,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:10,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:10,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:10,793 INFO L87 Difference]: Start difference. First operand 543 states and 720 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:10,824 INFO L93 Difference]: Finished difference Result 542 states and 718 transitions. [2025-02-06 12:03:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:10,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-02-06 12:03:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:10,826 INFO L225 Difference]: With dead ends: 542 [2025-02-06 12:03:10,826 INFO L226 Difference]: Without dead ends: 542 [2025-02-06 12:03:10,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:10,827 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 175 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:10,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 243 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-02-06 12:03:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-02-06 12:03:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 477 states have (on average 1.4842767295597483) internal successors, (708), 535 states have internal predecessors, (708), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 718 transitions. [2025-02-06 12:03:10,844 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 718 transitions. Word has length 113 [2025-02-06 12:03:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:10,846 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 718 transitions. [2025-02-06 12:03:10,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 718 transitions. [2025-02-06 12:03:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 12:03:10,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:10,847 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:10,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 12:03:10,847 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:10,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash -879557403, now seen corresponding path program 1 times [2025-02-06 12:03:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:10,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977547059] [2025-02-06 12:03:10,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:10,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:10,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 12:03:10,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 12:03:10,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:10,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977547059] [2025-02-06 12:03:12,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977547059] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:12,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058514073] [2025-02-06 12:03:12,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:12,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:12,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:12,969 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:12,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 12:03:13,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 12:03:13,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 12:03:13,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:13,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:13,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 12:03:13,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:13,430 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 15 treesize of output 11 [2025-02-06 12:03:13,435 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 15 treesize of output 11 [2025-02-06 12:03:13,493 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-02-06 12:03:13,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 27 treesize of output 15 [2025-02-06 12:03:13,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:13,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 12:03:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:13,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:14,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058514073] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:14,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:14,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-02-06 12:03:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563930755] [2025-02-06 12:03:14,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:14,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:03:14,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:14,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:03:14,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-02-06 12:03:14,345 INFO L87 Difference]: Start difference. First operand 542 states and 718 transitions. Second operand has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:14,782 INFO L93 Difference]: Finished difference Result 534 states and 651 transitions. [2025-02-06 12:03:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:03:14,783 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2025-02-06 12:03:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:14,784 INFO L225 Difference]: With dead ends: 534 [2025-02-06 12:03:14,785 INFO L226 Difference]: Without dead ends: 534 [2025-02-06 12:03:14,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:03:14,785 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 973 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:14,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 2468 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:03:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-06 12:03:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 499. [2025-02-06 12:03:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 434 states have (on average 1.4470046082949308) internal successors, (628), 492 states have internal predecessors, (628), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 638 transitions. [2025-02-06 12:03:14,796 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 638 transitions. Word has length 114 [2025-02-06 12:03:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:14,797 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 638 transitions. [2025-02-06 12:03:14,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 638 transitions. [2025-02-06 12:03:14,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 12:03:14,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:14,798 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:14,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 12:03:14,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:14,999 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2072615363, now seen corresponding path program 1 times [2025-02-06 12:03:15,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:15,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229510115] [2025-02-06 12:03:15,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:15,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:15,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 12:03:15,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 12:03:15,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:15,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:16,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229510115] [2025-02-06 12:03:16,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229510115] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249644925] [2025-02-06 12:03:16,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:16,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:16,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:16,015 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:16,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 12:03:16,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 12:03:16,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 12:03:16,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:16,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:16,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 12:03:16,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:16,423 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 15 treesize of output 1 [2025-02-06 12:03:16,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 12:03:16,437 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 15 treesize of output 1 [2025-02-06 12:03:16,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 12:03:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:16,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:16,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 12:03:16,634 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 18 treesize of output 16 [2025-02-06 12:03:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:16,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249644925] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:16,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:16,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 16 [2025-02-06 12:03:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242747137] [2025-02-06 12:03:16,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:16,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 12:03:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:16,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 12:03:16,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-02-06 12:03:16,677 INFO L87 Difference]: Start difference. First operand 499 states and 638 transitions. Second operand has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:16,895 INFO L93 Difference]: Finished difference Result 539 states and 658 transitions. [2025-02-06 12:03:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:03:16,896 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2025-02-06 12:03:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:16,897 INFO L225 Difference]: With dead ends: 539 [2025-02-06 12:03:16,897 INFO L226 Difference]: Without dead ends: 539 [2025-02-06 12:03:16,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-02-06 12:03:16,897 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 554 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:16,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 2263 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:03:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-06 12:03:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 500. [2025-02-06 12:03:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 435 states have (on average 1.445977011494253) internal successors, (629), 493 states have internal predecessors, (629), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 639 transitions. [2025-02-06 12:03:16,906 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 639 transitions. Word has length 114 [2025-02-06 12:03:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:16,906 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 639 transitions. [2025-02-06 12:03:16,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 639 transitions. [2025-02-06 12:03:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 12:03:16,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:16,908 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:16,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 12:03:17,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:17,109 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -173433191, now seen corresponding path program 1 times [2025-02-06 12:03:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849452255] [2025-02-06 12:03:17,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:17,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 12:03:17,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 12:03:17,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:17,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:17,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:17,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849452255] [2025-02-06 12:03:17,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849452255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:17,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884084406] [2025-02-06 12:03:17,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:17,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:17,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:17,774 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:17,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 12:03:18,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 12:03:18,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 12:03:18,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:18,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:18,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 12:03:18,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:18,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:03:18,183 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 15 treesize of output 1 [2025-02-06 12:03:18,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 12:03:18,223 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 15 treesize of output 1 [2025-02-06 12:03:18,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 12:03:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:18,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:18,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-06 12:03:18,419 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 20 [2025-02-06 12:03:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:18,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884084406] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:18,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2025-02-06 12:03:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701538640] [2025-02-06 12:03:18,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:18,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:03:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:18,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:03:18,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-02-06 12:03:18,504 INFO L87 Difference]: Start difference. First operand 500 states and 639 transitions. Second operand has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:18,934 INFO L93 Difference]: Finished difference Result 529 states and 645 transitions. [2025-02-06 12:03:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:03:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2025-02-06 12:03:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:18,936 INFO L225 Difference]: With dead ends: 529 [2025-02-06 12:03:18,936 INFO L226 Difference]: Without dead ends: 529 [2025-02-06 12:03:18,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2025-02-06 12:03:18,937 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 521 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:18,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1581 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:03:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-06 12:03:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 501. [2025-02-06 12:03:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 436 states have (on average 1.444954128440367) internal successors, (630), 494 states have internal predecessors, (630), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 640 transitions. [2025-02-06 12:03:18,947 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 640 transitions. Word has length 115 [2025-02-06 12:03:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:18,947 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 640 transitions. [2025-02-06 12:03:18,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 640 transitions. [2025-02-06 12:03:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 12:03:18,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:18,948 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:18,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 12:03:19,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-02-06 12:03:19,149 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:19,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1376341886, now seen corresponding path program 1 times [2025-02-06 12:03:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:19,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194194206] [2025-02-06 12:03:19,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:19,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 12:03:19,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 12:03:19,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:19,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:19,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:19,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194194206] [2025-02-06 12:03:19,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194194206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:19,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:19,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:19,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966002146] [2025-02-06 12:03:19,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:19,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:19,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:19,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:19,312 INFO L87 Difference]: Start difference. First operand 501 states and 640 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:19,343 INFO L93 Difference]: Finished difference Result 500 states and 639 transitions. [2025-02-06 12:03:19,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:19,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2025-02-06 12:03:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:19,345 INFO L225 Difference]: With dead ends: 500 [2025-02-06 12:03:19,345 INFO L226 Difference]: Without dead ends: 500 [2025-02-06 12:03:19,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:19,345 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 178 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:19,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 236 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-02-06 12:03:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-02-06 12:03:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 436 states have (on average 1.4426605504587156) internal successors, (629), 493 states have internal predecessors, (629), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 639 transitions. [2025-02-06 12:03:19,356 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 639 transitions. Word has length 116 [2025-02-06 12:03:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:19,357 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 639 transitions. [2025-02-06 12:03:19,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 639 transitions. [2025-02-06 12:03:19,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 12:03:19,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:19,357 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:19,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 12:03:19,357 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:19,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1501405575, now seen corresponding path program 1 times [2025-02-06 12:03:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604516563] [2025-02-06 12:03:19,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:19,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:19,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 12:03:19,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 12:03:19,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:19,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:19,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604516563] [2025-02-06 12:03:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604516563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:19,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:19,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:03:19,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699696516] [2025-02-06 12:03:19,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:19,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:03:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:19,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:03:19,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:19,582 INFO L87 Difference]: Start difference. First operand 500 states and 639 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:19,599 INFO L93 Difference]: Finished difference Result 497 states and 629 transitions. [2025-02-06 12:03:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:03:19,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2025-02-06 12:03:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:19,601 INFO L225 Difference]: With dead ends: 497 [2025-02-06 12:03:19,601 INFO L226 Difference]: Without dead ends: 497 [2025-02-06 12:03:19,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:19,602 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:19,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 679 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-06 12:03:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-02-06 12:03:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 433 states have (on average 1.4295612009237875) internal successors, (619), 490 states have internal predecessors, (619), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 629 transitions. [2025-02-06 12:03:19,608 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 629 transitions. Word has length 117 [2025-02-06 12:03:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:19,609 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 629 transitions. [2025-02-06 12:03:19,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 629 transitions. [2025-02-06 12:03:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 12:03:19,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:19,610 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:19,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 12:03:19,610 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash 834428150, now seen corresponding path program 1 times [2025-02-06 12:03:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:19,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091040795] [2025-02-06 12:03:19,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:19,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 12:03:19,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 12:03:19,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:19,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:19,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:19,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091040795] [2025-02-06 12:03:19,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091040795] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:19,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697317147] [2025-02-06 12:03:19,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:19,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:19,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:19,870 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:19,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 12:03:20,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 12:03:20,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 12:03:20,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:20,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:20,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:03:20,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:20,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:20,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697317147] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:20,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:20,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-06 12:03:20,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114169129] [2025-02-06 12:03:20,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:20,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:03:20,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:20,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:03:20,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:03:20,480 INFO L87 Difference]: Start difference. First operand 497 states and 629 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:20,537 INFO L93 Difference]: Finished difference Result 577 states and 690 transitions. [2025-02-06 12:03:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:03:20,537 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2025-02-06 12:03:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:20,539 INFO L225 Difference]: With dead ends: 577 [2025-02-06 12:03:20,539 INFO L226 Difference]: Without dead ends: 577 [2025-02-06 12:03:20,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:03:20,540 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 96 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:20,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1382 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:20,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-02-06 12:03:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 498. [2025-02-06 12:03:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 434 states have (on average 1.4285714285714286) internal successors, (620), 491 states have internal predecessors, (620), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 630 transitions. [2025-02-06 12:03:20,547 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 630 transitions. Word has length 117 [2025-02-06 12:03:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:20,547 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 630 transitions. [2025-02-06 12:03:20,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 630 transitions. [2025-02-06 12:03:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 12:03:20,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:20,548 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:20,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 12:03:20,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-06 12:03:20,749 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:20,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:20,749 INFO L85 PathProgramCache]: Analyzing trace with hash 283074477, now seen corresponding path program 1 times [2025-02-06 12:03:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:20,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258422587] [2025-02-06 12:03:20,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:20,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:20,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 12:03:20,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 12:03:20,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:20,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:21,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:21,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258422587] [2025-02-06 12:03:21,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258422587] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:21,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675519771] [2025-02-06 12:03:21,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:21,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:21,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:21,039 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:21,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 12:03:21,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 12:03:21,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 12:03:21,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:21,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:21,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:03:21,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:21,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:21,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675519771] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:21,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:21,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-02-06 12:03:21,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914196226] [2025-02-06 12:03:21,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:21,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:03:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:21,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:03:21,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:03:21,639 INFO L87 Difference]: Start difference. First operand 498 states and 630 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:21,690 INFO L93 Difference]: Finished difference Result 501 states and 629 transitions. [2025-02-06 12:03:21,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:03:21,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2025-02-06 12:03:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:21,692 INFO L225 Difference]: With dead ends: 501 [2025-02-06 12:03:21,692 INFO L226 Difference]: Without dead ends: 501 [2025-02-06 12:03:21,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:03:21,692 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 213 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:21,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 886 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-06 12:03:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 495. [2025-02-06 12:03:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 431 states have (on average 1.4222737819025522) internal successors, (613), 488 states have internal predecessors, (613), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 623 transitions. [2025-02-06 12:03:21,702 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 623 transitions. Word has length 117 [2025-02-06 12:03:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:21,702 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 623 transitions. [2025-02-06 12:03:21,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 623 transitions. [2025-02-06 12:03:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 12:03:21,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:21,703 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:21,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-06 12:03:21,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-02-06 12:03:21,904 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash -701050377, now seen corresponding path program 1 times [2025-02-06 12:03:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:21,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925540399] [2025-02-06 12:03:21,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:21,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 12:03:21,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 12:03:21,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:21,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:22,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:22,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925540399] [2025-02-06 12:03:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925540399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:22,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:22,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:22,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442382525] [2025-02-06 12:03:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:22,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:22,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:22,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:22,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:22,201 INFO L87 Difference]: Start difference. First operand 495 states and 623 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:22,298 INFO L93 Difference]: Finished difference Result 494 states and 621 transitions. [2025-02-06 12:03:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2025-02-06 12:03:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:22,300 INFO L225 Difference]: With dead ends: 494 [2025-02-06 12:03:22,300 INFO L226 Difference]: Without dead ends: 494 [2025-02-06 12:03:22,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:22,301 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:22,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-02-06 12:03:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2025-02-06 12:03:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 431 states have (on average 1.4176334106728539) internal successors, (611), 487 states have internal predecessors, (611), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 621 transitions. [2025-02-06 12:03:22,308 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 621 transitions. Word has length 118 [2025-02-06 12:03:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:22,308 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 621 transitions. [2025-02-06 12:03:22,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 621 transitions. [2025-02-06 12:03:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 12:03:22,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:22,309 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:22,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 12:03:22,309 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:22,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:22,310 INFO L85 PathProgramCache]: Analyzing trace with hash -701050378, now seen corresponding path program 1 times [2025-02-06 12:03:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254611683] [2025-02-06 12:03:22,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:22,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 12:03:22,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 12:03:22,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:22,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254611683] [2025-02-06 12:03:22,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254611683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:22,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:22,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:22,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643545822] [2025-02-06 12:03:22,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:22,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:22,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:22,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:22,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:22,539 INFO L87 Difference]: Start difference. First operand 494 states and 621 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:22,625 INFO L93 Difference]: Finished difference Result 493 states and 619 transitions. [2025-02-06 12:03:22,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:22,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2025-02-06 12:03:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:22,627 INFO L225 Difference]: With dead ends: 493 [2025-02-06 12:03:22,627 INFO L226 Difference]: Without dead ends: 493 [2025-02-06 12:03:22,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:22,627 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:22,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-06 12:03:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-02-06 12:03:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 431 states have (on average 1.4129930394431554) internal successors, (609), 486 states have internal predecessors, (609), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 619 transitions. [2025-02-06 12:03:22,635 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 619 transitions. Word has length 118 [2025-02-06 12:03:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:22,635 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 619 transitions. [2025-02-06 12:03:22,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 619 transitions. [2025-02-06 12:03:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 12:03:22,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:22,637 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:22,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-06 12:03:22,637 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:22,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:22,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1273739051, now seen corresponding path program 1 times [2025-02-06 12:03:22,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:22,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657324736] [2025-02-06 12:03:22,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:22,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 12:03:22,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 12:03:22,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:22,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:23,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657324736] [2025-02-06 12:03:23,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657324736] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:23,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493415729] [2025-02-06 12:03:23,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:23,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:23,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:23,925 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:23,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 12:03:24,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 12:03:24,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 12:03:24,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:24,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:24,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 1572 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 12:03:24,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:24,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:03:24,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2025-02-06 12:03:24,489 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:03:24,489 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-02-06 12:03:24,499 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 15 treesize of output 1 [2025-02-06 12:03:24,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 12:03:24,521 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 15 treesize of output 1 [2025-02-06 12:03:24,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 12:03:24,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:03:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:24,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:25,005 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 6 treesize of output 4 [2025-02-06 12:03:25,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 12:03:25,013 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 20 treesize of output 18 [2025-02-06 12:03:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493415729] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:25,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:25,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2025-02-06 12:03:25,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188626514] [2025-02-06 12:03:25,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:25,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:03:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:25,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:03:25,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-02-06 12:03:25,090 INFO L87 Difference]: Start difference. First operand 493 states and 619 transitions. Second operand has 20 states, 19 states have (on average 4.578947368421052) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:25,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:25,551 INFO L93 Difference]: Finished difference Result 523 states and 632 transitions. [2025-02-06 12:03:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:03:25,551 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.578947368421052) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2025-02-06 12:03:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:25,552 INFO L225 Difference]: With dead ends: 523 [2025-02-06 12:03:25,552 INFO L226 Difference]: Without dead ends: 523 [2025-02-06 12:03:25,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-02-06 12:03:25,553 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 588 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:25,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1492 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:03:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-02-06 12:03:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 496. [2025-02-06 12:03:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 434 states have (on average 1.4101382488479262) internal successors, (612), 489 states have internal predecessors, (612), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 622 transitions. [2025-02-06 12:03:25,558 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 622 transitions. Word has length 119 [2025-02-06 12:03:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:25,558 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 622 transitions. [2025-02-06 12:03:25,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.578947368421052) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 622 transitions. [2025-02-06 12:03:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 12:03:25,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:25,559 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:25,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 12:03:25,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:25,760 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:25,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:25,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1430488097, now seen corresponding path program 1 times [2025-02-06 12:03:25,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:25,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381743274] [2025-02-06 12:03:25,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:25,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:25,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 12:03:25,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 12:03:25,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:25,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:25,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:25,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381743274] [2025-02-06 12:03:25,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381743274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:25,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:25,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:03:25,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221287847] [2025-02-06 12:03:25,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:25,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:03:25,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:25,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:03:25,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:25,977 INFO L87 Difference]: Start difference. First operand 496 states and 622 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:25,994 INFO L93 Difference]: Finished difference Result 494 states and 614 transitions. [2025-02-06 12:03:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:03:25,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2025-02-06 12:03:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:25,998 INFO L225 Difference]: With dead ends: 494 [2025-02-06 12:03:25,998 INFO L226 Difference]: Without dead ends: 494 [2025-02-06 12:03:25,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:25,999 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 2 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:25,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 668 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-02-06 12:03:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2025-02-06 12:03:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 426 states have (on average 1.3990610328638498) internal successors, (596), 481 states have internal predecessors, (596), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 606 transitions. [2025-02-06 12:03:26,005 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 606 transitions. Word has length 121 [2025-02-06 12:03:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:26,005 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 606 transitions. [2025-02-06 12:03:26,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 606 transitions. [2025-02-06 12:03:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 12:03:26,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:26,006 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:26,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-06 12:03:26,006 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:26,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:26,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1511852657, now seen corresponding path program 1 times [2025-02-06 12:03:26,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:26,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458724083] [2025-02-06 12:03:26,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:26,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:26,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 12:03:26,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 12:03:26,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:26,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:26,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:26,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458724083] [2025-02-06 12:03:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458724083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:26,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:26,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:03:26,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015379782] [2025-02-06 12:03:26,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:26,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:03:26,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:26,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:03:26,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:03:26,336 INFO L87 Difference]: Start difference. First operand 488 states and 606 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:26,403 INFO L93 Difference]: Finished difference Result 506 states and 627 transitions. [2025-02-06 12:03:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:03:26,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2025-02-06 12:03:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:26,405 INFO L225 Difference]: With dead ends: 506 [2025-02-06 12:03:26,405 INFO L226 Difference]: Without dead ends: 506 [2025-02-06 12:03:26,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:03:26,406 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 20 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:26,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1048 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-06 12:03:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 495. [2025-02-06 12:03:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 433 states have (on average 1.3903002309468822) internal successors, (602), 488 states have internal predecessors, (602), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 612 transitions. [2025-02-06 12:03:26,416 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 612 transitions. Word has length 122 [2025-02-06 12:03:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:26,416 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 612 transitions. [2025-02-06 12:03:26,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 612 transitions. [2025-02-06 12:03:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 12:03:26,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:26,417 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:26,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-06 12:03:26,417 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:26,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash 75978844, now seen corresponding path program 1 times [2025-02-06 12:03:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720757069] [2025-02-06 12:03:26,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:26,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 12:03:26,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 12:03:26,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:26,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720757069] [2025-02-06 12:03:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720757069] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381991531] [2025-02-06 12:03:28,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:28,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:28,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:28,382 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:28,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 12:03:28,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 12:03:29,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 12:03:29,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:29,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:29,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 12:03:29,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:29,037 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 10 treesize of output 8 [2025-02-06 12:03:29,093 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-02-06 12:03:29,129 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 15 treesize of output 1 [2025-02-06 12:03:29,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 12:03:29,216 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 15 treesize of output 1 [2025-02-06 12:03:29,759 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 12:03:29,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 12:03:29,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 12:03:29,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:03:29,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:03:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:29,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:30,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 12:03:30,389 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 20 treesize of output 18 [2025-02-06 12:03:30,455 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 6 treesize of output 4 [2025-02-06 12:03:30,484 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 20 [2025-02-06 12:03:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:30,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381991531] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:30,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:30,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 34 [2025-02-06 12:03:30,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938148938] [2025-02-06 12:03:30,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:30,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 12:03:30,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:30,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 12:03:30,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 12:03:30,536 INFO L87 Difference]: Start difference. First operand 495 states and 612 transitions. Second operand has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:31,788 INFO L93 Difference]: Finished difference Result 566 states and 658 transitions. [2025-02-06 12:03:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 12:03:31,789 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2025-02-06 12:03:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:31,790 INFO L225 Difference]: With dead ends: 566 [2025-02-06 12:03:31,790 INFO L226 Difference]: Without dead ends: 566 [2025-02-06 12:03:31,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=479, Invalid=2071, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 12:03:31,791 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 1238 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:31,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 2207 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 12:03:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-06 12:03:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 498. [2025-02-06 12:03:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 436 states have (on average 1.3876146788990826) internal successors, (605), 491 states have internal predecessors, (605), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 615 transitions. [2025-02-06 12:03:31,798 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 615 transitions. Word has length 122 [2025-02-06 12:03:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:31,798 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 615 transitions. [2025-02-06 12:03:31,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 615 transitions. [2025-02-06 12:03:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 12:03:31,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:31,799 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:31,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 12:03:31,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:31,999 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:32,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash 301833239, now seen corresponding path program 1 times [2025-02-06 12:03:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549216849] [2025-02-06 12:03:32,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:32,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 12:03:32,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 12:03:32,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:32,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549216849] [2025-02-06 12:03:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549216849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:32,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798737579] [2025-02-06 12:03:32,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:32,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:32,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:32,495 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:32,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 12:03:32,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 12:03:33,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 12:03:33,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:33,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:33,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:03:33,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:33,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:33,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798737579] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:33,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:33,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-06 12:03:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138139826] [2025-02-06 12:03:33,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:33,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:03:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:33,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:03:33,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:03:33,491 INFO L87 Difference]: Start difference. First operand 498 states and 615 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:33,558 INFO L93 Difference]: Finished difference Result 469 states and 533 transitions. [2025-02-06 12:03:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:03:33,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2025-02-06 12:03:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:33,559 INFO L225 Difference]: With dead ends: 469 [2025-02-06 12:03:33,560 INFO L226 Difference]: Without dead ends: 469 [2025-02-06 12:03:33,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:03:33,560 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 36 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:33,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1288 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-06 12:03:33,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 410. [2025-02-06 12:03:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 350 states have (on average 1.3342857142857143) internal successors, (467), 405 states have internal predecessors, (467), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 473 transitions. [2025-02-06 12:03:33,564 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 473 transitions. Word has length 123 [2025-02-06 12:03:33,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:33,564 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 473 transitions. [2025-02-06 12:03:33,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 473 transitions. [2025-02-06 12:03:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 12:03:33,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:33,565 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:33,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-06 12:03:33,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:33,765 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:33,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1939623151, now seen corresponding path program 1 times [2025-02-06 12:03:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:33,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467244180] [2025-02-06 12:03:33,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:33,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 12:03:33,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 12:03:33,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:33,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-02-06 12:03:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467244180] [2025-02-06 12:03:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467244180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:33,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:33,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670945153] [2025-02-06 12:03:33,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:33,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:33,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:33,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:33,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:33,923 INFO L87 Difference]: Start difference. First operand 410 states and 473 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:33,929 INFO L93 Difference]: Finished difference Result 409 states and 472 transitions. [2025-02-06 12:03:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:33,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2025-02-06 12:03:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:33,930 INFO L225 Difference]: With dead ends: 409 [2025-02-06 12:03:33,930 INFO L226 Difference]: Without dead ends: 409 [2025-02-06 12:03:33,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:33,930 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 171 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:33,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 236 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-02-06 12:03:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2025-02-06 12:03:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 350 states have (on average 1.3314285714285714) internal successors, (466), 404 states have internal predecessors, (466), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 472 transitions. [2025-02-06 12:03:33,937 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 472 transitions. Word has length 123 [2025-02-06 12:03:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:33,938 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 472 transitions. [2025-02-06 12:03:33,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 472 transitions. [2025-02-06 12:03:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 12:03:33,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:33,939 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:33,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-06 12:03:33,939 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:33,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1224442, now seen corresponding path program 1 times [2025-02-06 12:03:33,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:33,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546385837] [2025-02-06 12:03:33,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:33,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:33,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 12:03:33,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 12:03:33,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:33,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-02-06 12:03:34,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:34,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546385837] [2025-02-06 12:03:34,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546385837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:34,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:34,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:34,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70465848] [2025-02-06 12:03:34,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:34,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:34,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:34,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:34,090 INFO L87 Difference]: Start difference. First operand 409 states and 472 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:34,122 INFO L93 Difference]: Finished difference Result 408 states and 471 transitions. [2025-02-06 12:03:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:34,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2025-02-06 12:03:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:34,124 INFO L225 Difference]: With dead ends: 408 [2025-02-06 12:03:34,124 INFO L226 Difference]: Without dead ends: 408 [2025-02-06 12:03:34,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:34,124 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:34,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 219 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:34,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-02-06 12:03:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-02-06 12:03:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 350 states have (on average 1.3285714285714285) internal successors, (465), 403 states have internal predecessors, (465), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 471 transitions. [2025-02-06 12:03:34,129 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 471 transitions. Word has length 124 [2025-02-06 12:03:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:34,130 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 471 transitions. [2025-02-06 12:03:34,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 471 transitions. [2025-02-06 12:03:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 12:03:34,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:34,131 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:34,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-06 12:03:34,131 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-06 12:03:34,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash 37957679, now seen corresponding path program 1 times [2025-02-06 12:03:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145995092] [2025-02-06 12:03:34,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:34,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 12:03:34,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 12:03:34,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:34,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:35,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145995092] [2025-02-06 12:03:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145995092] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975460693] [2025-02-06 12:03:35,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:35,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:35,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:35,901 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:35,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 12:03:36,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 12:03:36,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 12:03:36,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:36,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:36,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-06 12:03:36,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:36,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:03:36,694 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:03:36,719 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2025-02-06 12:03:36,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 38 [2025-02-06 12:03:36,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:36,785 INFO L349 Elim1Store]: treesize reduction 92, result has 22.7 percent of original size [2025-02-06 12:03:36,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 39 [2025-02-06 12:03:37,137 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-02-06 12:03:37,185 INFO L349 Elim1Store]: treesize reduction 68, result has 39.3 percent of original size [2025-02-06 12:03:37,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 93 [2025-02-06 12:03:37,506 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 15 treesize of output 1 [2025-02-06 12:03:38,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 12:03:41,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 119 [2025-02-06 12:03:43,566 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 12:03:43,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 12:03:43,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 114 [2025-02-06 12:03:44,301 INFO L349 Elim1Store]: treesize reduction 72, result has 54.1 percent of original size [2025-02-06 12:03:44,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 109 treesize of output 183