./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/uthash-2.0.2/uthash_BER_test10-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:46:16,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:46:16,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 07:46:16,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:46:16,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:46:16,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:46:16,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:46:16,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:46:16,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:46:16,994 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:46:16,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:46:16,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:46:16,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:46:16,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:46:16,995 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:46:16,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:46:16,995 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:46:16,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:46:16,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:46:16,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:46:16,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:46:16,998 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 [2025-02-08 07:46:17,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:46:17,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:46:17,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:46:17,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:46:17,237 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:46:17,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2025-02-08 07:46:18,389 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83c23a9d2/7b84095fbad242558dcbc1f184a5e5f2/FLAGc81ea76ac [2025-02-08 07:46:18,780 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:46:18,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2025-02-08 07:46:18,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83c23a9d2/7b84095fbad242558dcbc1f184a5e5f2/FLAGc81ea76ac [2025-02-08 07:46:18,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83c23a9d2/7b84095fbad242558dcbc1f184a5e5f2 [2025-02-08 07:46:18,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:46:18,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:46:18,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:46:18,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:46:18,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:46:18,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:46:18" (1/1) ... [2025-02-08 07:46:18,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c50fd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:18, skipping insertion in model container [2025-02-08 07:46:18,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:46:18" (1/1) ... [2025-02-08 07:46:19,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:46:19,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-08 07:46:19,313 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-08 07:46:19,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-08 07:46:19,322 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-08 07:46:19,326 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-08 07:46:19,351 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-08 07:46:19,353 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-08 07:46:19,354 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-08 07:46:19,361 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-08 07:46:19,383 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-08 07:46:19,383 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-08 07:46:19,386 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-08 07:46:19,386 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-08 07:46:19,395 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-08 07:46:19,395 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-08 07:46:19,396 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-08 07:46:19,396 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-08 07:46:19,403 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-08 07:46:19,403 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-08 07:46:19,404 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-08 07:46:19,404 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-08 07:46:19,413 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-08 07:46:19,414 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-08 07:46:19,415 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-08 07:46:19,415 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-08 07:46:19,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:46:19,439 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:46:19,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:46:19,581 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:46:19,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19 WrapperNode [2025-02-08 07:46:19,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:46:19,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:46:19,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:46:19,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:46:19,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,734 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3338 [2025-02-08 07:46:19,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:46:19,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:46:19,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:46:19,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:46:19,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,884 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [106, 2, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 86 writes are split as follows [4, 0, 82]. [2025-02-08 07:46:19,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:46:19,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:46:19,976 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:46:19,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:46:19,977 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (1/1) ... [2025-02-08 07:46:19,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:46:19,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:46:20,003 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-08 07:46:20,007 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-08 07:46:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-08 07:46:20,025 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-08 07:46:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 07:46:20,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 07:46:20,026 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 07:46:20,026 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 07:46:20,026 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 07:46:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:46:20,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:46:20,245 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:46:20,247 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:46:23,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 07:46:23,561 INFO L? ?]: Removed 2486 outVars from TransFormulas that were not future-live. [2025-02-08 07:46:23,561 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:46:23,656 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:46:23,656 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 07:46:23,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:46:23 BoogieIcfgContainer [2025-02-08 07:46:23,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:46:23,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:46:23,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:46:23,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:46:23,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:46:18" (1/3) ... [2025-02-08 07:46:23,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a4410e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:46:23, skipping insertion in model container [2025-02-08 07:46:23,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:46:19" (2/3) ... [2025-02-08 07:46:23,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a4410e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:46:23, skipping insertion in model container [2025-02-08 07:46:23,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:46:23" (3/3) ... [2025-02-08 07:46:23,664 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-1.i [2025-02-08 07:46:23,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:46:23,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test10-1.i that has 6 procedures, 2680 locations, 1 initial locations, 84 loop locations, and 986 error locations. [2025-02-08 07:46:23,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:46:23,747 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;@66d7e9b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:46:23,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2025-02-08 07:46:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 2670 states, 1671 states have (on average 1.9593058049072412) internal successors, (3274), 2655 states have internal predecessors, (3274), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 07:46:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:46:23,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:23,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:46:23,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr983REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:23,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash 110495, now seen corresponding path program 1 times [2025-02-08 07:46:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:23,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459203897] [2025-02-08 07:46:23,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:23,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:23,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:46:23,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:46:23,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:23,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:23,979 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-08 07:46:23,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:23,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459203897] [2025-02-08 07:46:23,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459203897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:23,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:23,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:46:23,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725110547] [2025-02-08 07:46:23,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:23,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:46:23,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:24,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:46:24,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:46:24,007 INFO L87 Difference]: Start difference. First operand has 2670 states, 1671 states have (on average 1.9593058049072412) internal successors, (3274), 2655 states have internal predecessors, (3274), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 07:46:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:25,520 INFO L93 Difference]: Finished difference Result 3260 states and 3830 transitions. [2025-02-08 07:46:25,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:46:25,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:46:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:25,551 INFO L225 Difference]: With dead ends: 3260 [2025-02-08 07:46:25,551 INFO L226 Difference]: Without dead ends: 3255 [2025-02-08 07:46:25,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-08 07:46:25,554 INFO L435 NwaCegarLoop]: 2096 mSDtfsCounter, 2890 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:25,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 2614 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:46:25,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2025-02-08 07:46:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 2907. [2025-02-08 07:46:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2907 states, 1938 states have (on average 1.8570691434468525) internal successors, (3599), 2891 states have internal predecessors, (3599), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 07:46:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 3627 transitions. [2025-02-08 07:46:25,699 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 3627 transitions. Word has length 2 [2025-02-08 07:46:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:25,699 INFO L471 AbstractCegarLoop]: Abstraction has 2907 states and 3627 transitions. [2025-02-08 07:46:25,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 07:46:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3627 transitions. [2025-02-08 07:46:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:46:25,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:25,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:46:25,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:46:25,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr984REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 110496, now seen corresponding path program 1 times [2025-02-08 07:46:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861704039] [2025-02-08 07:46:25,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:25,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:46:25,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:46:25,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:25,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:46:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861704039] [2025-02-08 07:46:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861704039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:25,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:25,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:46:25,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406533645] [2025-02-08 07:46:25,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:25,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:46:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:25,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:46:25,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:46:25,785 INFO L87 Difference]: Start difference. First operand 2907 states and 3627 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 07:46:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:27,287 INFO L93 Difference]: Finished difference Result 4093 states and 5117 transitions. [2025-02-08 07:46:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:46:27,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:46:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:27,304 INFO L225 Difference]: With dead ends: 4093 [2025-02-08 07:46:27,304 INFO L226 Difference]: Without dead ends: 4093 [2025-02-08 07:46:27,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-08 07:46:27,306 INFO L435 NwaCegarLoop]: 2640 mSDtfsCounter, 1484 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 4646 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:27,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 4646 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:46:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2025-02-08 07:46:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 3765. [2025-02-08 07:46:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 2794 states have (on average 1.8192555476020043) internal successors, (5083), 3746 states have internal predecessors, (5083), 19 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 07:46:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5117 transitions. [2025-02-08 07:46:27,390 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5117 transitions. Word has length 2 [2025-02-08 07:46:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:27,390 INFO L471 AbstractCegarLoop]: Abstraction has 3765 states and 5117 transitions. [2025-02-08 07:46:27,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 07:46:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5117 transitions. [2025-02-08 07:46:27,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 07:46:27,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:27,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:46:27,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:46:27,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr980REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:27,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1220234457, now seen corresponding path program 1 times [2025-02-08 07:46:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:27,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639068264] [2025-02-08 07:46:27,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:27,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 07:46:27,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 07:46:27,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:27,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:27,575 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-08 07:46:27,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:27,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639068264] [2025-02-08 07:46:27,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639068264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:27,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:27,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:46:27,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560753294] [2025-02-08 07:46:27,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:27,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:46:27,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:27,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:46:27,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:46:27,578 INFO L87 Difference]: Start difference. First operand 3765 states and 5117 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-08 07:46:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:30,724 INFO L93 Difference]: Finished difference Result 7049 states and 8625 transitions. [2025-02-08 07:46:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:46:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-02-08 07:46:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:30,747 INFO L225 Difference]: With dead ends: 7049 [2025-02-08 07:46:30,747 INFO L226 Difference]: Without dead ends: 7049 [2025-02-08 07:46:30,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-08 07:46:30,750 INFO L435 NwaCegarLoop]: 2471 mSDtfsCounter, 9629 mSDsluCounter, 3152 mSDsCounter, 0 mSdLazyCounter, 4354 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9632 SdHoareTripleChecker+Valid, 5623 SdHoareTripleChecker+Invalid, 4416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 4354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:30,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9632 Valid, 5623 Invalid, 4416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 4354 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-08 07:46:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7049 states. [2025-02-08 07:46:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7049 to 4791. [2025-02-08 07:46:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4791 states, 3820 states have (on average 1.8515706806282723) internal successors, (7073), 4766 states have internal predecessors, (7073), 25 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 07:46:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4791 states to 4791 states and 7119 transitions. [2025-02-08 07:46:30,863 INFO L78 Accepts]: Start accepts. Automaton has 4791 states and 7119 transitions. Word has length 7 [2025-02-08 07:46:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:30,863 INFO L471 AbstractCegarLoop]: Abstraction has 4791 states and 7119 transitions. [2025-02-08 07:46:30,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-08 07:46:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4791 states and 7119 transitions. [2025-02-08 07:46:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:46:30,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:30,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:46:30,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:46:30,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr977REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:30,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash -827434155, now seen corresponding path program 1 times [2025-02-08 07:46:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:30,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325310646] [2025-02-08 07:46:30,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:30,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:46:30,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:46:30,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:30,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:30,952 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-08 07:46:30,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325310646] [2025-02-08 07:46:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325310646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:46:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158155620] [2025-02-08 07:46:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:30,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:46:30,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:30,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:46:30,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:46:30,953 INFO L87 Difference]: Start difference. First operand 4791 states and 7119 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-08 07:46:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:32,054 INFO L93 Difference]: Finished difference Result 5888 states and 8398 transitions. [2025-02-08 07:46:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:46:32,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-02-08 07:46:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:32,070 INFO L225 Difference]: With dead ends: 5888 [2025-02-08 07:46:32,070 INFO L226 Difference]: Without dead ends: 5888 [2025-02-08 07:46:32,070 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-08 07:46:32,072 INFO L435 NwaCegarLoop]: 3358 mSDtfsCounter, 2861 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2871 SdHoareTripleChecker+Valid, 4457 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:32,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2871 Valid, 4457 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:46:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5888 states. [2025-02-08 07:46:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5888 to 4699. [2025-02-08 07:46:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4699 states, 3820 states have (on average 1.7952879581151833) internal successors, (6858), 4674 states have internal predecessors, (6858), 25 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 07:46:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 6904 transitions. [2025-02-08 07:46:32,151 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 6904 transitions. Word has length 8 [2025-02-08 07:46:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:32,151 INFO L471 AbstractCegarLoop]: Abstraction has 4699 states and 6904 transitions. [2025-02-08 07:46:32,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-08 07:46:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 6904 transitions. [2025-02-08 07:46:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:46:32,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:32,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:46:32,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:46:32,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr978REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:32,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:32,153 INFO L85 PathProgramCache]: Analyzing trace with hash -827434154, now seen corresponding path program 1 times [2025-02-08 07:46:32,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:32,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992662050] [2025-02-08 07:46:32,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:32,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:32,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:46:32,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:46:32,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:32,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:32,225 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-08 07:46:32,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:32,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992662050] [2025-02-08 07:46:32,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992662050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:32,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:32,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:46:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537858977] [2025-02-08 07:46:32,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:32,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:46:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:32,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:46:32,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:46:32,229 INFO L87 Difference]: Start difference. First operand 4699 states and 6904 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-08 07:46:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:33,548 INFO L93 Difference]: Finished difference Result 7478 states and 10901 transitions. [2025-02-08 07:46:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:46:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-02-08 07:46:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:33,566 INFO L225 Difference]: With dead ends: 7478 [2025-02-08 07:46:33,566 INFO L226 Difference]: Without dead ends: 7478 [2025-02-08 07:46:33,566 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-08 07:46:33,567 INFO L435 NwaCegarLoop]: 3712 mSDtfsCounter, 2338 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 5401 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:33,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2342 Valid, 5401 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 07:46:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7478 states. [2025-02-08 07:46:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7478 to 5245. [2025-02-08 07:46:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5245 states, 4376 states have (on average 1.7861060329067642) internal successors, (7816), 5220 states have internal predecessors, (7816), 25 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 07:46:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5245 states to 5245 states and 7862 transitions. [2025-02-08 07:46:33,642 INFO L78 Accepts]: Start accepts. Automaton has 5245 states and 7862 transitions. Word has length 8 [2025-02-08 07:46:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:33,642 INFO L471 AbstractCegarLoop]: Abstraction has 5245 states and 7862 transitions. [2025-02-08 07:46:33,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-08 07:46:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5245 states and 7862 transitions. [2025-02-08 07:46:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 07:46:33,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:33,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:46:33,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 07:46:33,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr345REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:33,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash -967251340, now seen corresponding path program 1 times [2025-02-08 07:46:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:33,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219378761] [2025-02-08 07:46:33,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:33,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 07:46:33,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 07:46:33,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:33,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:33,718 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-08 07:46:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219378761] [2025-02-08 07:46:33,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219378761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:33,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:33,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:46:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078086456] [2025-02-08 07:46:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:33,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:46:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:33,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:46:33,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:46:33,720 INFO L87 Difference]: Start difference. First operand 5245 states and 7862 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 07:46:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:34,107 INFO L93 Difference]: Finished difference Result 7263 states and 10657 transitions. [2025-02-08 07:46:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:46:34,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-02-08 07:46:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:34,123 INFO L225 Difference]: With dead ends: 7263 [2025-02-08 07:46:34,123 INFO L226 Difference]: Without dead ends: 7263 [2025-02-08 07:46:34,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 07:46:34,124 INFO L435 NwaCegarLoop]: 3331 mSDtfsCounter, 1457 mSDsluCounter, 6072 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 9403 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:34,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 9403 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 07:46:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7263 states. [2025-02-08 07:46:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7263 to 5248. [2025-02-08 07:46:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5248 states, 4379 states have (on average 1.7855674811600821) internal successors, (7819), 5223 states have internal predecessors, (7819), 25 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 07:46:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5248 states to 5248 states and 7865 transitions. [2025-02-08 07:46:34,196 INFO L78 Accepts]: Start accepts. Automaton has 5248 states and 7865 transitions. Word has length 11 [2025-02-08 07:46:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:34,196 INFO L471 AbstractCegarLoop]: Abstraction has 5248 states and 7865 transitions. [2025-02-08 07:46:34,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 07:46:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 5248 states and 7865 transitions. [2025-02-08 07:46:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 07:46:34,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:34,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:46:34,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 07:46:34,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr967REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:34,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash -64379323, now seen corresponding path program 1 times [2025-02-08 07:46:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:34,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279657385] [2025-02-08 07:46:34,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:34,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 07:46:34,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 07:46:34,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:34,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:34,272 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-08 07:46:34,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:34,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279657385] [2025-02-08 07:46:34,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279657385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:34,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:34,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:46:34,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419042604] [2025-02-08 07:46:34,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:34,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:46:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:34,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:46:34,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:46:34,274 INFO L87 Difference]: Start difference. First operand 5248 states and 7865 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-08 07:46:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:35,310 INFO L93 Difference]: Finished difference Result 5323 states and 7971 transitions. [2025-02-08 07:46:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:46:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-02-08 07:46:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:35,319 INFO L225 Difference]: With dead ends: 5323 [2025-02-08 07:46:35,320 INFO L226 Difference]: Without dead ends: 5323 [2025-02-08 07:46:35,320 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-08 07:46:35,320 INFO L435 NwaCegarLoop]: 1919 mSDtfsCounter, 3123 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3133 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:35,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3133 Valid, 3718 Invalid, 2270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:46:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2025-02-08 07:46:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 5225. [2025-02-08 07:46:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5225 states, 4379 states have (on average 1.775062799725965) internal successors, (7773), 5200 states have internal predecessors, (7773), 25 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 07:46:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5225 states to 5225 states and 7819 transitions. [2025-02-08 07:46:35,374 INFO L78 Accepts]: Start accepts. Automaton has 5225 states and 7819 transitions. Word has length 20 [2025-02-08 07:46:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:35,374 INFO L471 AbstractCegarLoop]: Abstraction has 5225 states and 7819 transitions. [2025-02-08 07:46:35,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-08 07:46:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5225 states and 7819 transitions. [2025-02-08 07:46:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 07:46:35,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:35,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:46:35,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:46:35,378 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr968REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:35,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash -64379322, now seen corresponding path program 1 times [2025-02-08 07:46:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:35,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674503780] [2025-02-08 07:46:35,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:35,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:35,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 07:46:35,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 07:46:35,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:35,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:35,462 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-08 07:46:35,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:35,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674503780] [2025-02-08 07:46:35,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674503780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:35,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:35,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:46:35,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710418410] [2025-02-08 07:46:35,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:35,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:46:35,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:35,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:46:35,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:46:35,464 INFO L87 Difference]: Start difference. First operand 5225 states and 7819 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08 07:46:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:35,639 INFO L93 Difference]: Finished difference Result 5087 states and 7613 transitions. [2025-02-08 07:46:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:46:35,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-02-08 07:46:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:35,649 INFO L225 Difference]: With dead ends: 5087 [2025-02-08 07:46:35,649 INFO L226 Difference]: Without dead ends: 5087 [2025-02-08 07:46:35,650 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-08 07:46:35,650 INFO L435 NwaCegarLoop]: 2759 mSDtfsCounter, 60 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5465 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:35,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5465 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:46:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5087 states. [2025-02-08 07:46:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5087 to 5087. [2025-02-08 07:46:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5087 states, 4253 states have (on average 1.7792146719962378) internal successors, (7567), 5062 states have internal predecessors, (7567), 25 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 07:46:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5087 states to 5087 states and 7613 transitions. [2025-02-08 07:46:35,706 INFO L78 Accepts]: Start accepts. Automaton has 5087 states and 7613 transitions. Word has length 20 [2025-02-08 07:46:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:35,707 INFO L471 AbstractCegarLoop]: Abstraction has 5087 states and 7613 transitions. [2025-02-08 07:46:35,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08 07:46:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5087 states and 7613 transitions. [2025-02-08 07:46:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 07:46:35,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:35,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:46:35,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 07:46:35,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr659REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:35,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash -831640542, now seen corresponding path program 1 times [2025-02-08 07:46:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:35,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204551888] [2025-02-08 07:46:35,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:35,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:35,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 07:46:35,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 07:46:35,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:35,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:35,789 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-08 07:46:35,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204551888] [2025-02-08 07:46:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204551888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:35,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:35,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:46:35,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494516079] [2025-02-08 07:46:35,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:35,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:46:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:35,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:46:35,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:46:35,791 INFO L87 Difference]: Start difference. First operand 5087 states and 7613 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-08 07:46:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:36,128 INFO L93 Difference]: Finished difference Result 7004 states and 10278 transitions. [2025-02-08 07:46:36,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:46:36,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-02-08 07:46:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:36,164 INFO L225 Difference]: With dead ends: 7004 [2025-02-08 07:46:36,164 INFO L226 Difference]: Without dead ends: 7004 [2025-02-08 07:46:36,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 07:46:36,165 INFO L435 NwaCegarLoop]: 2818 mSDtfsCounter, 1320 mSDsluCounter, 5443 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 8261 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:36,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 8261 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 07:46:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7004 states. [2025-02-08 07:46:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7004 to 5097. [2025-02-08 07:46:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5097 states, 4263 states have (on average 1.7773868167956839) internal successors, (7577), 5072 states have internal predecessors, (7577), 25 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 07:46:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5097 states to 5097 states and 7623 transitions. [2025-02-08 07:46:36,212 INFO L78 Accepts]: Start accepts. Automaton has 5097 states and 7623 transitions. Word has length 20 [2025-02-08 07:46:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:36,212 INFO L471 AbstractCegarLoop]: Abstraction has 5097 states and 7623 transitions. [2025-02-08 07:46:36,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-08 07:46:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 5097 states and 7623 transitions. [2025-02-08 07:46:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 07:46:36,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:36,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:46:36,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:46:36,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr944REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:36,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1995880754, now seen corresponding path program 1 times [2025-02-08 07:46:36,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:36,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895297602] [2025-02-08 07:46:36,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:36,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 07:46:36,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 07:46:36,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:36,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:36,285 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-08 07:46:36,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:36,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895297602] [2025-02-08 07:46:36,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895297602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:36,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:36,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:46:36,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657231422] [2025-02-08 07:46:36,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:36,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:46:36,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:36,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:46:36,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:46:36,286 INFO L87 Difference]: Start difference. First operand 5097 states and 7623 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-08 07:46:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:36,513 INFO L93 Difference]: Finished difference Result 5074 states and 7579 transitions. [2025-02-08 07:46:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:46:36,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2025-02-08 07:46:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:36,521 INFO L225 Difference]: With dead ends: 5074 [2025-02-08 07:46:36,522 INFO L226 Difference]: Without dead ends: 5074 [2025-02-08 07:46:36,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 07:46:36,523 INFO L435 NwaCegarLoop]: 2721 mSDtfsCounter, 45 mSDsluCounter, 5419 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8140 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:36,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8140 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:46:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2025-02-08 07:46:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 5074. [2025-02-08 07:46:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5074 states, 4247 states have (on average 1.7737226277372262) internal successors, (7533), 5049 states have internal predecessors, (7533), 25 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 07:46:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 7579 transitions. [2025-02-08 07:46:36,571 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 7579 transitions. Word has length 21 [2025-02-08 07:46:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:36,571 INFO L471 AbstractCegarLoop]: Abstraction has 5074 states and 7579 transitions. [2025-02-08 07:46:36,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-08 07:46:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 7579 transitions. [2025-02-08 07:46:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 07:46:36,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:36,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:46:36,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:46:36,572 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr930REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:36,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash 345669700, now seen corresponding path program 1 times [2025-02-08 07:46:36,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:36,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322712998] [2025-02-08 07:46:36,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:36,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 07:46:36,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 07:46:36,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:36,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:36,688 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-08 07:46:36,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322712998] [2025-02-08 07:46:36,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322712998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:36,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:36,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:46:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455846591] [2025-02-08 07:46:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:36,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:46:36,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:36,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:46:36,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:46:36,689 INFO L87 Difference]: Start difference. First operand 5074 states and 7579 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-08 07:46:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:38,247 INFO L93 Difference]: Finished difference Result 7401 states and 10762 transitions. [2025-02-08 07:46:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:46:38,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2025-02-08 07:46:38,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:38,259 INFO L225 Difference]: With dead ends: 7401 [2025-02-08 07:46:38,259 INFO L226 Difference]: Without dead ends: 7401 [2025-02-08 07:46:38,259 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-08 07:46:38,259 INFO L435 NwaCegarLoop]: 2196 mSDtfsCounter, 2337 mSDsluCounter, 3465 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2341 SdHoareTripleChecker+Valid, 5661 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:38,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2341 Valid, 5661 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2707 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 07:46:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7401 states. [2025-02-08 07:46:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7401 to 5070. [2025-02-08 07:46:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5070 states, 4247 states have (on average 1.7718389451377443) internal successors, (7525), 5045 states have internal predecessors, (7525), 25 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 07:46:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5070 states to 5070 states and 7571 transitions. [2025-02-08 07:46:38,318 INFO L78 Accepts]: Start accepts. Automaton has 5070 states and 7571 transitions. Word has length 35 [2025-02-08 07:46:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:38,318 INFO L471 AbstractCegarLoop]: Abstraction has 5070 states and 7571 transitions. [2025-02-08 07:46:38,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-08 07:46:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 5070 states and 7571 transitions. [2025-02-08 07:46:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-08 07:46:38,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:38,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:46:38,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:46:38,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr915REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:38,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1138968900, now seen corresponding path program 1 times [2025-02-08 07:46:38,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:38,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312980036] [2025-02-08 07:46:38,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:38,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 07:46:38,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 07:46:38,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:38,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:38,478 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-08 07:46:38,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:38,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312980036] [2025-02-08 07:46:38,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312980036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:38,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:38,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:46:38,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533494220] [2025-02-08 07:46:38,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:38,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:46:38,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:38,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:46:38,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:46:38,480 INFO L87 Difference]: Start difference. First operand 5070 states and 7571 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-08 07:46:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:38,711 INFO L93 Difference]: Finished difference Result 5058 states and 7551 transitions. [2025-02-08 07:46:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:46:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2025-02-08 07:46:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:38,721 INFO L225 Difference]: With dead ends: 5058 [2025-02-08 07:46:38,721 INFO L226 Difference]: Without dead ends: 5058 [2025-02-08 07:46:38,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 07:46:38,722 INFO L435 NwaCegarLoop]: 2719 mSDtfsCounter, 21 mSDsluCounter, 5407 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8126 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:38,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8126 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:46:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5058 states. [2025-02-08 07:46:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5058 to 5058. [2025-02-08 07:46:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5058 states, 4235 states have (on average 1.7721369539551357) internal successors, (7505), 5033 states have internal predecessors, (7505), 25 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 07:46:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 7551 transitions. [2025-02-08 07:46:38,789 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 7551 transitions. Word has length 70 [2025-02-08 07:46:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:38,789 INFO L471 AbstractCegarLoop]: Abstraction has 5058 states and 7551 transitions. [2025-02-08 07:46:38,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-08 07:46:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 7551 transitions. [2025-02-08 07:46:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 07:46:38,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:38,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:46:38,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:46:38,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr915REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:38,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1305437052, now seen corresponding path program 1 times [2025-02-08 07:46:38,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:38,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31836922] [2025-02-08 07:46:38,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:38,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:38,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 07:46:38,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 07:46:38,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:38,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:38,925 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-08 07:46:38,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:38,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31836922] [2025-02-08 07:46:38,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31836922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:38,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:38,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:46:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439043852] [2025-02-08 07:46:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:46:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:38,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:46:38,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:46:38,927 INFO L87 Difference]: Start difference. First operand 5058 states and 7551 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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-08 07:46:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:39,186 INFO L93 Difference]: Finished difference Result 6572 states and 9740 transitions. [2025-02-08 07:46:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:46:39,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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 78 [2025-02-08 07:46:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:39,198 INFO L225 Difference]: With dead ends: 6572 [2025-02-08 07:46:39,198 INFO L226 Difference]: Without dead ends: 6572 [2025-02-08 07:46:39,198 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-08 07:46:39,199 INFO L435 NwaCegarLoop]: 2735 mSDtfsCounter, 1088 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 5406 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:39,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 5406 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:46:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6572 states. [2025-02-08 07:46:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6572 to 5915. [2025-02-08 07:46:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5915 states, 5088 states have (on average 1.7545204402515724) internal successors, (8927), 5886 states have internal predecessors, (8927), 29 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 07:46:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 8981 transitions. [2025-02-08 07:46:39,269 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 8981 transitions. Word has length 78 [2025-02-08 07:46:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:39,269 INFO L471 AbstractCegarLoop]: Abstraction has 5915 states and 8981 transitions. [2025-02-08 07:46:39,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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-08 07:46:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 8981 transitions. [2025-02-08 07:46:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 07:46:39,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:39,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:46:39,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:46:39,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr886REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:39,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash -653002849, now seen corresponding path program 1 times [2025-02-08 07:46:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:39,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25166074] [2025-02-08 07:46:39,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:39,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 07:46:39,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 07:46:39,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:39,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:39,682 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-08 07:46:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25166074] [2025-02-08 07:46:39,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25166074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:39,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:39,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:46:39,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378546260] [2025-02-08 07:46:39,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:39,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:46:39,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:39,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:46:39,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:46:39,684 INFO L87 Difference]: Start difference. First operand 5915 states and 8981 transitions. Second operand has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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-08 07:46:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:41,397 INFO L93 Difference]: Finished difference Result 5831 states and 8782 transitions. [2025-02-08 07:46:41,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:46:41,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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 81 [2025-02-08 07:46:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:41,404 INFO L225 Difference]: With dead ends: 5831 [2025-02-08 07:46:41,404 INFO L226 Difference]: Without dead ends: 5831 [2025-02-08 07:46:41,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 07:46:41,405 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 5288 mSDsluCounter, 2801 mSDsCounter, 0 mSdLazyCounter, 3985 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5298 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 4093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:41,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5298 Valid, 4253 Invalid, 4093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3985 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 07:46:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5831 states. [2025-02-08 07:46:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5831 to 5275. [2025-02-08 07:46:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5275 states, 4532 states have (on average 1.7100617828773168) internal successors, (7750), 5246 states have internal predecessors, (7750), 29 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 07:46:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 7804 transitions. [2025-02-08 07:46:41,446 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 7804 transitions. Word has length 81 [2025-02-08 07:46:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:41,447 INFO L471 AbstractCegarLoop]: Abstraction has 5275 states and 7804 transitions. [2025-02-08 07:46:41,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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-08 07:46:41,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 7804 transitions. [2025-02-08 07:46:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 07:46:41,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:41,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:46:41,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:46:41,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr879REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:41,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash 255123335, now seen corresponding path program 1 times [2025-02-08 07:46:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:41,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368556342] [2025-02-08 07:46:41,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:41,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:41,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 07:46:41,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 07:46:41,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:41,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:41,639 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-08 07:46:41,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:41,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368556342] [2025-02-08 07:46:41,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368556342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:41,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:41,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:46:41,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730271978] [2025-02-08 07:46:41,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:41,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:46:41,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:41,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:46:41,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:46:41,641 INFO L87 Difference]: Start difference. First operand 5275 states and 7804 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:46:42,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:42,905 INFO L93 Difference]: Finished difference Result 5274 states and 7802 transitions. [2025-02-08 07:46:42,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:46:42,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-08 07:46:42,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:42,913 INFO L225 Difference]: With dead ends: 5274 [2025-02-08 07:46:42,913 INFO L226 Difference]: Without dead ends: 5274 [2025-02-08 07:46:42,913 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-08 07:46:42,914 INFO L435 NwaCegarLoop]: 2645 mSDtfsCounter, 2 mSDsluCounter, 5453 mSDsCounter, 0 mSdLazyCounter, 2933 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8098 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:42,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8098 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2933 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:46:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5274 states. [2025-02-08 07:46:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5274 to 5274. [2025-02-08 07:46:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5274 states, 4532 states have (on average 1.7096204766107679) internal successors, (7748), 5245 states have internal predecessors, (7748), 29 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 07:46:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5274 states to 5274 states and 7802 transitions. [2025-02-08 07:46:42,966 INFO L78 Accepts]: Start accepts. Automaton has 5274 states and 7802 transitions. Word has length 86 [2025-02-08 07:46:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:42,966 INFO L471 AbstractCegarLoop]: Abstraction has 5274 states and 7802 transitions. [2025-02-08 07:46:42,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:46:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5274 states and 7802 transitions. [2025-02-08 07:46:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 07:46:42,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:42,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:46:42,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 07:46:42,967 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr880REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:42,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:42,968 INFO L85 PathProgramCache]: Analyzing trace with hash 255123336, now seen corresponding path program 1 times [2025-02-08 07:46:42,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:42,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666063442] [2025-02-08 07:46:42,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:42,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:42,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 07:46:43,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 07:46:43,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:43,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:43,334 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-08 07:46:43,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:43,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666063442] [2025-02-08 07:46:43,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666063442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:43,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:43,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:46:43,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404384534] [2025-02-08 07:46:43,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:43,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:46:43,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:43,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:46:43,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:46:43,336 INFO L87 Difference]: Start difference. First operand 5274 states and 7802 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:46:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:44,810 INFO L93 Difference]: Finished difference Result 5273 states and 7800 transitions. [2025-02-08 07:46:44,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:46:44,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-08 07:46:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:44,816 INFO L225 Difference]: With dead ends: 5273 [2025-02-08 07:46:44,816 INFO L226 Difference]: Without dead ends: 5273 [2025-02-08 07:46:44,816 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-08 07:46:44,817 INFO L435 NwaCegarLoop]: 2645 mSDtfsCounter, 1 mSDsluCounter, 5427 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8072 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:44,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8072 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:46:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5273 states. [2025-02-08 07:46:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5273 to 5273. [2025-02-08 07:46:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 4530 states have (on average 1.709933774834437) internal successors, (7746), 5244 states have internal predecessors, (7746), 29 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 07:46:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 7800 transitions. [2025-02-08 07:46:44,866 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 7800 transitions. Word has length 86 [2025-02-08 07:46:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:44,866 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 7800 transitions. [2025-02-08 07:46:44,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:46:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 7800 transitions. [2025-02-08 07:46:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 07:46:44,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:44,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:46:44,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:46:44,867 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr875REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:44,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1316859204, now seen corresponding path program 1 times [2025-02-08 07:46:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:44,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515937064] [2025-02-08 07:46:44,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:44,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:44,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:46:44,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:46:44,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:44,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:45,162 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-08 07:46:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515937064] [2025-02-08 07:46:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515937064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:45,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:46:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876262257] [2025-02-08 07:46:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:45,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:46:45,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:45,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:46:45,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:46:45,165 INFO L87 Difference]: Start difference. First operand 5273 states and 7800 transitions. Second operand has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-08 07:46:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:46,672 INFO L93 Difference]: Finished difference Result 5291 states and 7835 transitions. [2025-02-08 07:46:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:46:46,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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 94 [2025-02-08 07:46:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:46,680 INFO L225 Difference]: With dead ends: 5291 [2025-02-08 07:46:46,680 INFO L226 Difference]: Without dead ends: 5291 [2025-02-08 07:46:46,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:46:46,681 INFO L435 NwaCegarLoop]: 2616 mSDtfsCounter, 24 mSDsluCounter, 8308 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10924 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:46,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10924 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:46:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2025-02-08 07:46:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 5282. [2025-02-08 07:46:46,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5282 states, 4538 states have (on average 1.7093433230498016) internal successors, (7757), 5251 states have internal predecessors, (7757), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (39), 27 states have call predecessors, (39), 25 states have call successors, (39) [2025-02-08 07:46:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5282 states to 5282 states and 7825 transitions. [2025-02-08 07:46:46,769 INFO L78 Accepts]: Start accepts. Automaton has 5282 states and 7825 transitions. Word has length 94 [2025-02-08 07:46:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:46,769 INFO L471 AbstractCegarLoop]: Abstraction has 5282 states and 7825 transitions. [2025-02-08 07:46:46,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-08 07:46:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5282 states and 7825 transitions. [2025-02-08 07:46:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 07:46:46,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:46,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:46:46,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:46:46,770 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr876REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:46,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1316859205, now seen corresponding path program 1 times [2025-02-08 07:46:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:46,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755978519] [2025-02-08 07:46:46,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:46,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:46,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:46:46,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:46:46,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:46,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:47,191 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-08 07:46:47,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:47,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755978519] [2025-02-08 07:46:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755978519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:46:47,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:46:47,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:46:47,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339776669] [2025-02-08 07:46:47,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:46:47,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:46:47,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:47,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:46:47,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:46:47,192 INFO L87 Difference]: Start difference. First operand 5282 states and 7825 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-08 07:46:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:48,761 INFO L93 Difference]: Finished difference Result 5282 states and 7823 transitions. [2025-02-08 07:46:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:46:48,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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 94 [2025-02-08 07:46:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:48,777 INFO L225 Difference]: With dead ends: 5282 [2025-02-08 07:46:48,777 INFO L226 Difference]: Without dead ends: 5282 [2025-02-08 07:46:48,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:46:48,778 INFO L435 NwaCegarLoop]: 2623 mSDtfsCounter, 19 mSDsluCounter, 7720 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10343 SdHoareTripleChecker+Invalid, 3425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:48,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10343 Invalid, 3425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3416 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 07:46:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2025-02-08 07:46:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5282. [2025-02-08 07:46:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5282 states, 4538 states have (on average 1.7089026002644336) internal successors, (7755), 5251 states have internal predecessors, (7755), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (39), 27 states have call predecessors, (39), 25 states have call successors, (39) [2025-02-08 07:46:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5282 states to 5282 states and 7823 transitions. [2025-02-08 07:46:48,836 INFO L78 Accepts]: Start accepts. Automaton has 5282 states and 7823 transitions. Word has length 94 [2025-02-08 07:46:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:48,836 INFO L471 AbstractCegarLoop]: Abstraction has 5282 states and 7823 transitions. [2025-02-08 07:46:48,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-08 07:46:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5282 states and 7823 transitions. [2025-02-08 07:46:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 07:46:48,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:48,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:46:48,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 07:46:48,838 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr875REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:48,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:48,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1951206384, now seen corresponding path program 1 times [2025-02-08 07:46:48,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:48,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814634397] [2025-02-08 07:46:48,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:48,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:48,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 07:46:48,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 07:46:48,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:48,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:49,194 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-08 07:46:49,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814634397] [2025-02-08 07:46:49,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814634397] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:46:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704925739] [2025-02-08 07:46:49,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:49,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:46:49,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:46:49,197 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-08 07:46:49,199 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-08 07:46:49,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 07:46:49,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 07:46:49,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:49,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:49,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 07:46:49,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:46:49,453 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-08 07:46:49,565 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 07:46:49,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 07:46:49,595 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 19 treesize of output 1 [2025-02-08 07:46:49,654 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 22 treesize of output 10 [2025-02-08 07:46:49,780 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:46:49,780 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:46:49,822 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 31 treesize of output 13 [2025-02-08 07:46:49,845 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-08 07:46:49,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:46:49,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_671) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 07:46:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704925739] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:46:49,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:46:49,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-02-08 07:46:49,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489189736] [2025-02-08 07:46:49,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:46:49,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 07:46:49,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:49,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 07:46:49,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-02-08 07:46:49,874 INFO L87 Difference]: Start difference. First operand 5282 states and 7823 transitions. Second operand has 19 states, 16 states have (on average 9.375) internal successors, (150), 18 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:46:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:46:55,076 INFO L93 Difference]: Finished difference Result 5289 states and 7829 transitions. [2025-02-08 07:46:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:46:55,076 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.375) internal successors, (150), 18 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-02-08 07:46:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:46:55,082 INFO L225 Difference]: With dead ends: 5289 [2025-02-08 07:46:55,083 INFO L226 Difference]: Without dead ends: 5289 [2025-02-08 07:46:55,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-02-08 07:46:55,083 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2666 mSDsluCounter, 23102 mSDsCounter, 0 mSdLazyCounter, 13620 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2680 SdHoareTripleChecker+Valid, 24903 SdHoareTripleChecker+Invalid, 13647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 13620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:46:55,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2680 Valid, 24903 Invalid, 13647 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 13620 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-02-08 07:46:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5289 states. [2025-02-08 07:46:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5289 to 5286. [2025-02-08 07:46:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5286 states, 4542 states have (on average 1.7080581241743724) internal successors, (7758), 5254 states have internal predecessors, (7758), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-08 07:46:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 7814 transitions. [2025-02-08 07:46:55,131 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 7814 transitions. Word has length 95 [2025-02-08 07:46:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:46:55,132 INFO L471 AbstractCegarLoop]: Abstraction has 5286 states and 7814 transitions. [2025-02-08 07:46:55,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.375) internal successors, (150), 18 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:46:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 7814 transitions. [2025-02-08 07:46:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 07:46:55,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:46:55,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:46:55,142 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-08 07:46:55,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:46:55,334 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr876REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:46:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:46:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1951206383, now seen corresponding path program 1 times [2025-02-08 07:46:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:46:55,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055925526] [2025-02-08 07:46:55,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:46:55,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 07:46:55,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 07:46:55,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:55,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:55,839 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-08 07:46:55,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:46:55,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055925526] [2025-02-08 07:46:55,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055925526] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:46:55,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746467629] [2025-02-08 07:46:55,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:46:55,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:46:55,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:46:55,843 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-08 07:46:55,844 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-08 07:46:56,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 07:46:56,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 07:46:56,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:46:56,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:46:56,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 07:46:56,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:46:56,162 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-08 07:46:56,278 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-08 07:46:56,284 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:46:56,285 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-08 07:46:56,300 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 19 treesize of output 1 [2025-02-08 07:46:56,303 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 13 treesize of output 9 [2025-02-08 07:46:56,349 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 22 treesize of output 10 [2025-02-08 07:46:56,353 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 9 treesize of output 3 [2025-02-08 07:46:56,421 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:46:56,422 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:46:56,426 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 30 treesize of output 13 [2025-02-08 07:46:56,448 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 31 treesize of output 13 [2025-02-08 07:46:56,451 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 9 treesize of output 3 [2025-02-08 07:46:56,455 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-08 07:46:56,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:46:56,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746467629] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:46:56,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:46:56,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-02-08 07:46:56,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204147112] [2025-02-08 07:46:56,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:46:56,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:46:56,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:46:56,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:46:56,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=243, Unknown=11, NotChecked=0, Total=306 [2025-02-08 07:46:56,556 INFO L87 Difference]: Start difference. First operand 5286 states and 7814 transitions. Second operand has 15 states, 12 states have (on average 12.0) internal successors, (144), 15 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:47:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:47:01,206 INFO L93 Difference]: Finished difference Result 5288 states and 7827 transitions. [2025-02-08 07:47:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:47:01,206 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 12.0) internal successors, (144), 15 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-02-08 07:47:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:47:01,213 INFO L225 Difference]: With dead ends: 5288 [2025-02-08 07:47:01,213 INFO L226 Difference]: Without dead ends: 5288 [2025-02-08 07:47:01,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=368, Unknown=13, NotChecked=0, Total=462 [2025-02-08 07:47:01,213 INFO L435 NwaCegarLoop]: 1807 mSDtfsCounter, 2662 mSDsluCounter, 13835 mSDsCounter, 0 mSdLazyCounter, 11928 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 15642 SdHoareTripleChecker+Invalid, 11953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 11928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:47:01,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2676 Valid, 15642 Invalid, 11953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 11928 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-08 07:47:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2025-02-08 07:47:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 5276. [2025-02-08 07:47:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 4534 states have (on average 1.7086457873842082) internal successors, (7747), 5246 states have internal predecessors, (7747), 29 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 07:47:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 7801 transitions. [2025-02-08 07:47:01,286 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 7801 transitions. Word has length 95 [2025-02-08 07:47:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:47:01,287 INFO L471 AbstractCegarLoop]: Abstraction has 5276 states and 7801 transitions. [2025-02-08 07:47:01,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 12.0) internal successors, (144), 15 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:47:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 7801 transitions. [2025-02-08 07:47:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 07:47:01,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:47:01,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:47:01,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:47:01,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:47:01,489 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:47:01,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:47:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash 324210832, now seen corresponding path program 1 times [2025-02-08 07:47:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:47:01,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431991405] [2025-02-08 07:47:01,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:47:01,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 07:47:01,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 07:47:01,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:01,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:01,859 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-08 07:47:01,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:47:01,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431991405] [2025-02-08 07:47:01,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431991405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:47:01,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:47:01,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 07:47:01,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217749633] [2025-02-08 07:47:01,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:47:01,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:47:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:47:01,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:47:01,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:47:01,862 INFO L87 Difference]: Start difference. First operand 5276 states and 7801 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-08 07:47:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:47:04,657 INFO L93 Difference]: Finished difference Result 5295 states and 7835 transitions. [2025-02-08 07:47:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:47:04,658 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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 97 [2025-02-08 07:47:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:47:04,663 INFO L225 Difference]: With dead ends: 5295 [2025-02-08 07:47:04,663 INFO L226 Difference]: Without dead ends: 5295 [2025-02-08 07:47:04,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-08 07:47:04,664 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2684 mSDsluCounter, 14217 mSDsCounter, 0 mSdLazyCounter, 8814 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 16018 SdHoareTripleChecker+Invalid, 8838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:47:04,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2698 Valid, 16018 Invalid, 8838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 8814 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-08 07:47:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2025-02-08 07:47:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5291. [2025-02-08 07:47:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 4548 states have (on average 1.7071240105540897) internal successors, (7764), 5259 states have internal predecessors, (7764), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-08 07:47:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 7820 transitions. [2025-02-08 07:47:04,708 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 7820 transitions. Word has length 97 [2025-02-08 07:47:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:47:04,708 INFO L471 AbstractCegarLoop]: Abstraction has 5291 states and 7820 transitions. [2025-02-08 07:47:04,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-08 07:47:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 7820 transitions. [2025-02-08 07:47:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 07:47:04,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:47:04,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:47:04,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 07:47:04,709 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr872REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:47:04,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:47:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash 324210833, now seen corresponding path program 1 times [2025-02-08 07:47:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:47:04,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49817545] [2025-02-08 07:47:04,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:47:04,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 07:47:04,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 07:47:04,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:04,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:05,163 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-08 07:47:05,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:47:05,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49817545] [2025-02-08 07:47:05,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49817545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:47:05,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:47:05,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 07:47:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188175043] [2025-02-08 07:47:05,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:47:05,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:47:05,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:47:05,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:47:05,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:47:05,166 INFO L87 Difference]: Start difference. First operand 5291 states and 7820 transitions. Second operand has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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-08 07:47:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:47:08,946 INFO L93 Difference]: Finished difference Result 5294 states and 7833 transitions. [2025-02-08 07:47:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 07:47:08,949 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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 97 [2025-02-08 07:47:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:47:08,955 INFO L225 Difference]: With dead ends: 5294 [2025-02-08 07:47:08,955 INFO L226 Difference]: Without dead ends: 5294 [2025-02-08 07:47:08,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:47:08,958 INFO L435 NwaCegarLoop]: 1808 mSDtfsCounter, 2695 mSDsluCounter, 12390 mSDsCounter, 0 mSdLazyCounter, 10543 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2709 SdHoareTripleChecker+Valid, 14198 SdHoareTripleChecker+Invalid, 10565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 10543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:47:08,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2709 Valid, 14198 Invalid, 10565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 10543 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-08 07:47:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2025-02-08 07:47:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 5291. [2025-02-08 07:47:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 4548 states have (on average 1.7066842568161829) internal successors, (7762), 5259 states have internal predecessors, (7762), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-08 07:47:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 7818 transitions. [2025-02-08 07:47:09,001 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 7818 transitions. Word has length 97 [2025-02-08 07:47:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:47:09,001 INFO L471 AbstractCegarLoop]: Abstraction has 5291 states and 7818 transitions. [2025-02-08 07:47:09,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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-08 07:47:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 7818 transitions. [2025-02-08 07:47:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:47:09,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:47:09,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:47:09,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 07:47:09,002 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:47:09,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:47:09,003 INFO L85 PathProgramCache]: Analyzing trace with hash -299055548, now seen corresponding path program 1 times [2025-02-08 07:47:09,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:47:09,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003926226] [2025-02-08 07:47:09,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:47:09,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:47:09,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:47:09,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:09,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:09,362 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-08 07:47:09,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:47:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003926226] [2025-02-08 07:47:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003926226] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:47:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455769219] [2025-02-08 07:47:09,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:09,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:47:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:47:09,365 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-08 07:47:09,368 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-08 07:47:09,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:47:09,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:47:09,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:09,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:09,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 07:47:09,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:47:09,590 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-08 07:47:09,675 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 07:47:09,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 07:47:09,701 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 19 treesize of output 1 [2025-02-08 07:47:09,761 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 22 treesize of output 10 [2025-02-08 07:47:09,864 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:47:09,865 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:47:09,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:47:09,928 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:47:09,941 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 31 treesize of output 13 [2025-02-08 07:47:09,964 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-08 07:47:09,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:47:10,002 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1096 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-08 07:47:10,018 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1099))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1096)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:47:10,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455769219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:47:10,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:47:10,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-02-08 07:47:10,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597154106] [2025-02-08 07:47:10,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:47:10,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 07:47:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:47:10,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 07:47:10,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=423, Unknown=13, NotChecked=86, Total=600 [2025-02-08 07:47:10,022 INFO L87 Difference]: Start difference. First operand 5291 states and 7818 transitions. Second operand has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:47:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:47:14,791 INFO L93 Difference]: Finished difference Result 5293 states and 7831 transitions. [2025-02-08 07:47:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:47:14,791 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2025-02-08 07:47:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:47:14,798 INFO L225 Difference]: With dead ends: 5293 [2025-02-08 07:47:14,798 INFO L226 Difference]: Without dead ends: 5293 [2025-02-08 07:47:14,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=546, Unknown=13, NotChecked=98, Total=756 [2025-02-08 07:47:14,800 INFO L435 NwaCegarLoop]: 1800 mSDtfsCounter, 2653 mSDsluCounter, 21337 mSDsCounter, 0 mSdLazyCounter, 12697 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 23137 SdHoareTripleChecker+Invalid, 12720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:47:14,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2667 Valid, 23137 Invalid, 12720 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 12697 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-08 07:47:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2025-02-08 07:47:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5290. [2025-02-08 07:47:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5290 states, 4548 states have (on average 1.7062445030782762) internal successors, (7760), 5258 states have internal predecessors, (7760), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-08 07:47:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7816 transitions. [2025-02-08 07:47:14,870 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7816 transitions. Word has length 98 [2025-02-08 07:47:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:47:14,870 INFO L471 AbstractCegarLoop]: Abstraction has 5290 states and 7816 transitions. [2025-02-08 07:47:14,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:47:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7816 transitions. [2025-02-08 07:47:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:47:14,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:47:14,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:47:14,880 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-08 07:47:15,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:47:15,072 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr872REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:47:15,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:47:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash -299055547, now seen corresponding path program 1 times [2025-02-08 07:47:15,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:47:15,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105266277] [2025-02-08 07:47:15,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:47:15,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:47:15,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:47:15,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:15,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:15,559 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-08 07:47:15,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:47:15,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105266277] [2025-02-08 07:47:15,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105266277] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:47:15,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256590346] [2025-02-08 07:47:15,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:15,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:47:15,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:47:15,562 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-08 07:47:15,563 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-08 07:47:15,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:47:15,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:47:15,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:15,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:15,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 07:47:15,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:47:15,794 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-08 07:47:15,873 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:47:15,874 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-08 07:47:15,878 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 8 treesize of output 1 [2025-02-08 07:47:15,883 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 19 treesize of output 1 [2025-02-08 07:47:15,888 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 13 treesize of output 9 [2025-02-08 07:47:15,929 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 22 treesize of output 10 [2025-02-08 07:47:15,935 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 9 treesize of output 3 [2025-02-08 07:47:16,025 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:47:16,025 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:47:16,030 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 30 treesize of output 13 [2025-02-08 07:47:16,084 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:47:16,085 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:47:16,088 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 30 treesize of output 13 [2025-02-08 07:47:16,099 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 31 treesize of output 13 [2025-02-08 07:47:16,102 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 9 treesize of output 3 [2025-02-08 07:47:16,105 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-08 07:47:16,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:47:16,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1250 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-02-08 07:47:16,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1250 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-02-08 07:47:16,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1256) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1257))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1256) .cse1 v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:47:16,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256590346] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:47:16,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:47:16,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-02-08 07:47:16,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990263776] [2025-02-08 07:47:16,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:47:16,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 07:47:16,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:47:16,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 07:47:16,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2025-02-08 07:47:16,190 INFO L87 Difference]: Start difference. First operand 5290 states and 7816 transitions. Second operand has 17 states, 14 states have (on average 10.642857142857142) internal successors, (149), 17 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:47:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:47:20,838 INFO L93 Difference]: Finished difference Result 5292 states and 7829 transitions. [2025-02-08 07:47:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:47:20,839 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.642857142857142) internal successors, (149), 17 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2025-02-08 07:47:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:47:20,844 INFO L225 Difference]: With dead ends: 5292 [2025-02-08 07:47:20,845 INFO L226 Difference]: Without dead ends: 5292 [2025-02-08 07:47:20,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=459, Unknown=3, NotChecked=138, Total=702 [2025-02-08 07:47:20,845 INFO L435 NwaCegarLoop]: 1806 mSDtfsCounter, 2662 mSDsluCounter, 13830 mSDsCounter, 0 mSdLazyCounter, 11887 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 15636 SdHoareTripleChecker+Invalid, 11911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 11887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:47:20,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2676 Valid, 15636 Invalid, 11911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 11887 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-08 07:47:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2025-02-08 07:47:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 5274. [2025-02-08 07:47:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5274 states, 4534 states have (on average 1.707763564181738) internal successors, (7743), 5244 states have internal predecessors, (7743), 29 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 07:47:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5274 states to 5274 states and 7797 transitions. [2025-02-08 07:47:20,889 INFO L78 Accepts]: Start accepts. Automaton has 5274 states and 7797 transitions. Word has length 98 [2025-02-08 07:47:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:47:20,890 INFO L471 AbstractCegarLoop]: Abstraction has 5274 states and 7797 transitions. [2025-02-08 07:47:20,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.642857142857142) internal successors, (149), 17 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:47:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5274 states and 7797 transitions. [2025-02-08 07:47:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 07:47:20,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:47:20,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:47:20,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 07:47:21,091 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,SelfDestructingSolverStorable23 [2025-02-08 07:47:21,091 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr867REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:47:21,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:47:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash -813613411, now seen corresponding path program 1 times [2025-02-08 07:47:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:47:21,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667932310] [2025-02-08 07:47:21,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:21,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:47:21,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 07:47:21,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 07:47:21,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:21,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:21,365 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-08 07:47:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:47:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667932310] [2025-02-08 07:47:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667932310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:47:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:47:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 07:47:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808859890] [2025-02-08 07:47:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:47:21,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 07:47:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:47:21,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 07:47:21,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 07:47:21,366 INFO L87 Difference]: Start difference. First operand 5274 states and 7797 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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-08 07:47:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:47:23,915 INFO L93 Difference]: Finished difference Result 5299 states and 7837 transitions. [2025-02-08 07:47:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 07:47:23,915 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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 100 [2025-02-08 07:47:23,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:47:23,921 INFO L225 Difference]: With dead ends: 5299 [2025-02-08 07:47:23,921 INFO L226 Difference]: Without dead ends: 5299 [2025-02-08 07:47:23,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-08 07:47:23,921 INFO L435 NwaCegarLoop]: 1806 mSDtfsCounter, 2684 mSDsluCounter, 12444 mSDsCounter, 0 mSdLazyCounter, 7791 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 14250 SdHoareTripleChecker+Invalid, 7814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:47:23,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2698 Valid, 14250 Invalid, 7814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 7791 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-08 07:47:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2025-02-08 07:47:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 5295. [2025-02-08 07:47:23,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 4554 states have (on average 1.7053140096618358) internal successors, (7766), 5263 states have internal predecessors, (7766), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-08 07:47:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 7822 transitions. [2025-02-08 07:47:23,989 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 7822 transitions. Word has length 100 [2025-02-08 07:47:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:47:23,989 INFO L471 AbstractCegarLoop]: Abstraction has 5295 states and 7822 transitions. [2025-02-08 07:47:23,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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-08 07:47:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 7822 transitions. [2025-02-08 07:47:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 07:47:23,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:47:23,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:47:23,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 07:47:23,993 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr868REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:47:23,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:47:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash -813613410, now seen corresponding path program 1 times [2025-02-08 07:47:23,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:47:23,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580781202] [2025-02-08 07:47:23,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:23,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:47:24,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 07:47:24,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 07:47:24,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:24,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:24,452 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-08 07:47:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:47:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580781202] [2025-02-08 07:47:24,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580781202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:47:24,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:47:24,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 07:47:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568303650] [2025-02-08 07:47:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:47:24,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 07:47:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:47:24,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 07:47:24,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-08 07:47:24,454 INFO L87 Difference]: Start difference. First operand 5295 states and 7822 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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-08 07:47:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:47:27,409 INFO L93 Difference]: Finished difference Result 5298 states and 7835 transitions. [2025-02-08 07:47:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:47:27,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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 100 [2025-02-08 07:47:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:47:27,415 INFO L225 Difference]: With dead ends: 5298 [2025-02-08 07:47:27,415 INFO L226 Difference]: Without dead ends: 5298 [2025-02-08 07:47:27,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:47:27,415 INFO L435 NwaCegarLoop]: 1807 mSDtfsCounter, 2678 mSDsluCounter, 9231 mSDsCounter, 0 mSdLazyCounter, 8267 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2692 SdHoareTripleChecker+Valid, 11038 SdHoareTripleChecker+Invalid, 8289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 8267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:47:27,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2692 Valid, 11038 Invalid, 8289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 8267 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-08 07:47:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2025-02-08 07:47:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 5295. [2025-02-08 07:47:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 4554 states have (on average 1.704874835309618) internal successors, (7764), 5263 states have internal predecessors, (7764), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-08 07:47:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 7820 transitions. [2025-02-08 07:47:27,451 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 7820 transitions. Word has length 100 [2025-02-08 07:47:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:47:27,451 INFO L471 AbstractCegarLoop]: Abstraction has 5295 states and 7820 transitions. [2025-02-08 07:47:27,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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-08 07:47:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 7820 transitions. [2025-02-08 07:47:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 07:47:27,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:47:27,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:47:27,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 07:47:27,452 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr867REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:47:27,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:47:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1398719383, now seen corresponding path program 1 times [2025-02-08 07:47:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:47:27,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343498908] [2025-02-08 07:47:27,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:27,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:47:27,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 07:47:27,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 07:47:27,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:27,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:27,816 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-08 07:47:27,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:47:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343498908] [2025-02-08 07:47:27,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343498908] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:47:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857828488] [2025-02-08 07:47:27,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:27,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:47:27,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:47:27,819 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-08 07:47:27,821 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-08 07:47:27,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 07:47:28,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 07:47:28,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:28,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:28,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 07:47:28,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:47:28,040 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-08 07:47:28,109 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 07:47:28,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 07:47:28,125 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 19 treesize of output 1 [2025-02-08 07:47:28,183 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 22 treesize of output 10 [2025-02-08 07:47:28,281 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:47:28,281 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:47:28,341 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:47:28,342 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:47:28,386 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:47:28,386 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:47:28,396 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 31 treesize of output 13 [2025-02-08 07:47:28,416 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-08 07:47:28,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:47:28,449 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-08 07:47:28,454 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1562 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1562))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:47:28,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1562 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1562))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:47:28,477 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1562 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1566))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1562)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:47:28,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857828488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:47:28,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:47:28,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-02-08 07:47:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973289953] [2025-02-08 07:47:28,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:47:28,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 07:47:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:47:28,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 07:47:28,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=510, Unknown=11, NotChecked=196, Total=812 [2025-02-08 07:47:28,480 INFO L87 Difference]: Start difference. First operand 5295 states and 7820 transitions. Second operand has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 23 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:47:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:47:33,438 INFO L93 Difference]: Finished difference Result 5297 states and 7833 transitions. [2025-02-08 07:47:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:47:33,439 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 23 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2025-02-08 07:47:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:47:33,444 INFO L225 Difference]: With dead ends: 5297 [2025-02-08 07:47:33,444 INFO L226 Difference]: Without dead ends: 5297 [2025-02-08 07:47:33,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=645, Unknown=11, NotChecked=220, Total=992 [2025-02-08 07:47:33,444 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 2656 mSDsluCounter, 24848 mSDsCounter, 0 mSdLazyCounter, 14645 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2670 SdHoareTripleChecker+Valid, 26647 SdHoareTripleChecker+Invalid, 14669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 14645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:47:33,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2670 Valid, 26647 Invalid, 14669 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 14645 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-08 07:47:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2025-02-08 07:47:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 5294. [2025-02-08 07:47:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5294 states, 4554 states have (on average 1.7044356609574) internal successors, (7762), 5262 states have internal predecessors, (7762), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-08 07:47:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 7818 transitions. [2025-02-08 07:47:33,483 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 7818 transitions. Word has length 101 [2025-02-08 07:47:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:47:33,483 INFO L471 AbstractCegarLoop]: Abstraction has 5294 states and 7818 transitions. [2025-02-08 07:47:33,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 23 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:47:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 7818 transitions. [2025-02-08 07:47:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 07:47:33,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:47:33,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:47:33,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 07:47:33,684 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,SelfDestructingSolverStorable26 [2025-02-08 07:47:33,685 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr868REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-08 07:47:33,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:47:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1398719382, now seen corresponding path program 1 times [2025-02-08 07:47:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:47:33,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877940100] [2025-02-08 07:47:33,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:47:33,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 07:47:33,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 07:47:33,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:33,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:34,258 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-08 07:47:34,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:47:34,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877940100] [2025-02-08 07:47:34,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877940100] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:47:34,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164553252] [2025-02-08 07:47:34,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:47:34,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:47:34,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:47:34,260 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-08 07:47:34,261 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-08 07:47:34,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 07:47:34,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 07:47:34,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:47:34,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:47:34,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 07:47:34,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:47:34,483 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-08 07:47:34,555 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-08 07:47:34,559 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:47:34,559 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-08 07:47:34,575 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 19 treesize of output 1 [2025-02-08 07:47:34,581 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 19 treesize of output 1 [2025-02-08 07:47:34,623 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 22 treesize of output 10 [2025-02-08 07:47:34,625 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 9 treesize of output 3 [2025-02-08 07:47:34,700 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:47:34,700 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:47:34,705 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 30 treesize of output 13 [2025-02-08 07:47:34,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:47:34,747 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:47:34,753 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 30 treesize of output 13 [2025-02-08 07:47:34,793 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:47:34,793 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:47:34,796 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 41 treesize of output 22 [2025-02-08 07:47:34,826 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 31 treesize of output 13 [2025-02-08 07:47:34,830 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 30 treesize of output 12 [2025-02-08 07:47:34,848 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-08 07:47:34,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:47:35,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1730 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_1730))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1729 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_1729))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1730 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_1730))) (or (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1729 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_1729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))))))) is different from false [2025-02-08 07:47:35,133 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1730 (Array Int Int)) (v_ArrVal_1738 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1738))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1737) .cse5 v_ArrVal_1730))) (or (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1729 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1729))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))) (forall ((v_ArrVal_1730 (Array Int Int)) (v_ArrVal_1738 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1738))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1737) .cse8 v_ArrVal_1730))) (or (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1729 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))))))) is different from false [2025-02-08 07:47:35,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164553252] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:47:35,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:47:35,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2025-02-08 07:47:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600839455] [2025-02-08 07:47:35,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:47:35,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 07:47:35,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:47:35,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 07:47:35,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=652, Unknown=10, NotChecked=106, Total=870 [2025-02-08 07:47:35,137 INFO L87 Difference]: Start difference. First operand 5294 states and 7818 transitions. Second operand has 23 states, 20 states have (on average 8.1) internal successors, (162), 23 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)