./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-c00e63d-m [2025-02-06 12:08:10,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:08:11,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:08:11,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:08:11,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:08:11,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:08:11,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:08:11,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:08:11,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:08:11,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:08:11,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:08:11,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:08:11,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:08:11,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:08:11,098 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:08:11,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:08:11,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:08:11,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:08:11,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:08:11,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:08:11,099 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:08:11,099 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:08:11,099 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:08:11,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:08:11,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:08:11,099 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:08:11,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:08:11,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:08:11,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:08:11,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:08:11,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:08:11,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:08:11,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:08:11,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:08:11,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:08:11,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:08:11,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:08:11,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:08:11,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:08:11,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:08:11,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:08:11,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:08:11,101 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-06 12:08:11,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:08:11,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:08:11,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:08:11,461 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:08:11,461 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:08:11,463 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-06 12:08:12,909 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c98fc459f/3049363453f14db9920a4fffc6f8b8e3/FLAGb3fe69a2b [2025-02-06 12:08:13,370 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:08:13,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2025-02-06 12:08:13,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c98fc459f/3049363453f14db9920a4fffc6f8b8e3/FLAGb3fe69a2b [2025-02-06 12:08:13,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c98fc459f/3049363453f14db9920a4fffc6f8b8e3 [2025-02-06 12:08:13,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:08:13,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:08:13,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:08:13,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:08:13,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:08:13,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:08:13" (1/1) ... [2025-02-06 12:08:13,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd3c4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:13, skipping insertion in model container [2025-02-06 12:08:13,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:08:13" (1/1) ... [2025-02-06 12:08:13,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:08:14,047 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,080 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,084 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,090 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,095 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,128 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,130 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,132 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,145 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,168 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,168 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,170 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,171 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,187 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,188 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,189 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,190 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,203 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,203 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,205 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,205 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,217 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,218 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,221 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,221 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:08:14,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:08:14,256 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:08:14,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:08:14,465 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:08:14,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14 WrapperNode [2025-02-06 12:08:14,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:08:14,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:08:14,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:08:14,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:08:14,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,639 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3338 [2025-02-06 12:08:14,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:08:14,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:08:14,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:08:14,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:08:14,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,849 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 82, 4]. [2025-02-06 12:08:14,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:08:14,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:08:14,981 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:08:14,981 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:08:14,983 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (1/1) ... [2025-02-06 12:08:14,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:08:15,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:15,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:08:15,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:08:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-06 12:08:15,054 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 12:08:15,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 12:08:15,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 12:08:15,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 12:08:15,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:08:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:08:15,341 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:08:15,343 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:08:19,476 INFO L1309 $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-06 12:08:19,810 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2025-02-06 12:08:19,811 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:08:19,952 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:08:19,952 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 12:08:19,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:08:19 BoogieIcfgContainer [2025-02-06 12:08:19,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:08:19,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:08:19,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:08:19,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:08:19,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:08:13" (1/3) ... [2025-02-06 12:08:19,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9081f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:08:19, skipping insertion in model container [2025-02-06 12:08:19,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:08:14" (2/3) ... [2025-02-06 12:08:19,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9081f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:08:19, skipping insertion in model container [2025-02-06 12:08:19,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:08:19" (3/3) ... [2025-02-06 12:08:19,965 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-1.i [2025-02-06 12:08:19,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:08:19,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test10-1.i that has 6 procedures, 2681 locations, 1 initial locations, 84 loop locations, and 986 error locations. [2025-02-06 12:08:20,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:08:20,099 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;@4433c1a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:08:20,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2025-02-06 12:08:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 2671 states, 1673 states have (on average 1.9581589958158996) internal successors, (3276), 2657 states have internal predecessors, (3276), 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-06 12:08:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:08:20,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:20,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:08:20,120 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-06 12:08:20,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:20,126 INFO L85 PathProgramCache]: Analyzing trace with hash 3428796, now seen corresponding path program 1 times [2025-02-06 12:08:20,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:20,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313427072] [2025-02-06 12:08:20,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:20,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:20,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:08:20,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:08:20,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:20,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:20,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313427072] [2025-02-06 12:08:20,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313427072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:20,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:20,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:08:20,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750569424] [2025-02-06 12:08:20,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:20,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:08:20,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:20,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:08:20,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:20,402 INFO L87 Difference]: Start difference. First operand has 2671 states, 1673 states have (on average 1.9581589958158996) internal successors, (3276), 2657 states have internal predecessors, (3276), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:22,294 INFO L93 Difference]: Finished difference Result 3261 states and 3832 transitions. [2025-02-06 12:08:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:08:22,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:08:22,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:22,330 INFO L225 Difference]: With dead ends: 3261 [2025-02-06 12:08:22,330 INFO L226 Difference]: Without dead ends: 3259 [2025-02-06 12:08:22,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:22,334 INFO L435 NwaCegarLoop]: 2098 mSDtfsCounter, 2890 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:22,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 2617 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 12:08:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2025-02-06 12:08:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 2911. [2025-02-06 12:08:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 1941 states have (on average 1.8562596599690881) internal successors, (3603), 2895 states have internal predecessors, (3603), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 12:08:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 3635 transitions. [2025-02-06 12:08:22,518 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 3635 transitions. Word has length 3 [2025-02-06 12:08:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:22,519 INFO L471 AbstractCegarLoop]: Abstraction has 2911 states and 3635 transitions. [2025-02-06 12:08:22,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 3635 transitions. [2025-02-06 12:08:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:08:22,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:22,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:08:22,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:08:22,520 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-06 12:08:22,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash 3428797, now seen corresponding path program 1 times [2025-02-06 12:08:22,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:22,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885650957] [2025-02-06 12:08:22,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:22,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:22,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:08:22,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:08:22,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:22,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:22,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:22,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885650957] [2025-02-06 12:08:22,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885650957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:22,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:08:22,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125796254] [2025-02-06 12:08:22,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:22,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:08:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:22,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:08:22,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:22,651 INFO L87 Difference]: Start difference. First operand 2911 states and 3635 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:24,465 INFO L93 Difference]: Finished difference Result 4097 states and 5125 transitions. [2025-02-06 12:08:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:08:24,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:08:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:24,481 INFO L225 Difference]: With dead ends: 4097 [2025-02-06 12:08:24,482 INFO L226 Difference]: Without dead ends: 4097 [2025-02-06 12:08:24,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:24,483 INFO L435 NwaCegarLoop]: 2648 mSDtfsCounter, 1484 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 4661 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:24,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 4661 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 12:08:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2025-02-06 12:08:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 3769. [2025-02-06 12:08:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3769 states, 2797 states have (on average 1.8187343582409725) internal successors, (5087), 3750 states have internal predecessors, (5087), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 12:08:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 5125 transitions. [2025-02-06 12:08:24,572 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 5125 transitions. Word has length 3 [2025-02-06 12:08:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:24,572 INFO L471 AbstractCegarLoop]: Abstraction has 3769 states and 5125 transitions. [2025-02-06 12:08:24,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 5125 transitions. [2025-02-06 12:08:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 12:08:24,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:24,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:08:24,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:08:24,574 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-06 12:08:24,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash 978052379, now seen corresponding path program 1 times [2025-02-06 12:08:24,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:24,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947004261] [2025-02-06 12:08:24,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:24,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:24,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:08:24,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:08:24,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:24,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:24,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:24,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947004261] [2025-02-06 12:08:24,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947004261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:24,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:24,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:24,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235972520] [2025-02-06 12:08:24,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:24,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:08:24,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:24,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:08:24,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:08:24,827 INFO L87 Difference]: Start difference. First operand 3769 states and 5125 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-06 12:08:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:29,396 INFO L93 Difference]: Finished difference Result 7053 states and 8633 transitions. [2025-02-06 12:08:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:08:29,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-06 12:08:29,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:29,419 INFO L225 Difference]: With dead ends: 7053 [2025-02-06 12:08:29,419 INFO L226 Difference]: Without dead ends: 7053 [2025-02-06 12:08:29,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:08:29,420 INFO L435 NwaCegarLoop]: 2479 mSDtfsCounter, 6213 mSDsluCounter, 5275 mSDsCounter, 0 mSdLazyCounter, 6213 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6216 SdHoareTripleChecker+Valid, 7754 SdHoareTripleChecker+Invalid, 6260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 6213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:29,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6216 Valid, 7754 Invalid, 6260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 6213 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-06 12:08:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7053 states. [2025-02-06 12:08:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7053 to 4795. [2025-02-06 12:08:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4795 states, 3823 states have (on average 1.851164007324091) internal successors, (7077), 4770 states have internal predecessors, (7077), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:08:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4795 states to 4795 states and 7127 transitions. [2025-02-06 12:08:29,526 INFO L78 Accepts]: Start accepts. Automaton has 4795 states and 7127 transitions. Word has length 8 [2025-02-06 12:08:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:29,526 INFO L471 AbstractCegarLoop]: Abstraction has 4795 states and 7127 transitions. [2025-02-06 12:08:29,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-06 12:08:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4795 states and 7127 transitions. [2025-02-06 12:08:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:08:29,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:29,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:08:29,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:08:29,527 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-06 12:08:29,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash 254856018, now seen corresponding path program 1 times [2025-02-06 12:08:29,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:29,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132774714] [2025-02-06 12:08:29,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:29,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:08:29,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:08:29,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:29,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:29,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:29,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132774714] [2025-02-06 12:08:29,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132774714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:29,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:29,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:08:29,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094959318] [2025-02-06 12:08:29,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:29,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:08:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:29,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:08:29,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:29,586 INFO L87 Difference]: Start difference. First operand 4795 states and 7127 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:30,961 INFO L93 Difference]: Finished difference Result 5892 states and 8406 transitions. [2025-02-06 12:08:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:08:30,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:08:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:30,977 INFO L225 Difference]: With dead ends: 5892 [2025-02-06 12:08:30,978 INFO L226 Difference]: Without dead ends: 5892 [2025-02-06 12:08:30,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:30,978 INFO L435 NwaCegarLoop]: 3366 mSDtfsCounter, 2861 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2871 SdHoareTripleChecker+Valid, 4472 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:30,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2871 Valid, 4472 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:08:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2025-02-06 12:08:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 4703. [2025-02-06 12:08:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4703 states, 3823 states have (on average 1.7949254512163222) internal successors, (6862), 4678 states have internal predecessors, (6862), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:08:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 6912 transitions. [2025-02-06 12:08:31,085 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 6912 transitions. Word has length 9 [2025-02-06 12:08:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:31,085 INFO L471 AbstractCegarLoop]: Abstraction has 4703 states and 6912 transitions. [2025-02-06 12:08:31,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 6912 transitions. [2025-02-06 12:08:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:08:31,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:31,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:08:31,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:08:31,087 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-06 12:08:31,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash 254856019, now seen corresponding path program 1 times [2025-02-06 12:08:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:31,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939721687] [2025-02-06 12:08:31,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:31,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:08:31,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:08:31,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:31,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939721687] [2025-02-06 12:08:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939721687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:31,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:31,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:08:31,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962546059] [2025-02-06 12:08:31,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:31,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:08:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:31,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:08:31,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:31,205 INFO L87 Difference]: Start difference. First operand 4703 states and 6912 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:32,727 INFO L93 Difference]: Finished difference Result 7482 states and 10909 transitions. [2025-02-06 12:08:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:08:32,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:08:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:32,747 INFO L225 Difference]: With dead ends: 7482 [2025-02-06 12:08:32,747 INFO L226 Difference]: Without dead ends: 7482 [2025-02-06 12:08:32,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:32,748 INFO L435 NwaCegarLoop]: 3720 mSDtfsCounter, 2338 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 5416 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:32,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2342 Valid, 5416 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 12:08:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7482 states. [2025-02-06 12:08:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7482 to 5249. [2025-02-06 12:08:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5249 states, 4379 states have (on average 1.7857958437999544) internal successors, (7820), 5224 states have internal predecessors, (7820), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:08:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5249 states to 5249 states and 7870 transitions. [2025-02-06 12:08:32,847 INFO L78 Accepts]: Start accepts. Automaton has 5249 states and 7870 transitions. Word has length 9 [2025-02-06 12:08:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:32,848 INFO L471 AbstractCegarLoop]: Abstraction has 5249 states and 7870 transitions. [2025-02-06 12:08:32,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 5249 states and 7870 transitions. [2025-02-06 12:08:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 12:08:32,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:32,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:08:32,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:08:32,850 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-06 12:08:32,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:32,850 INFO L85 PathProgramCache]: Analyzing trace with hash -780199562, now seen corresponding path program 1 times [2025-02-06 12:08:32,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:32,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889030070] [2025-02-06 12:08:32,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:32,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:08:32,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:08:32,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:32,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:32,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-06 12:08:32,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:32,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889030070] [2025-02-06 12:08:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889030070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:32,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:32,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:32,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745121654] [2025-02-06 12:08:32,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:32,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:32,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:32,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:32,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:32,955 INFO L87 Difference]: Start difference. First operand 5249 states and 7870 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:33,450 INFO L93 Difference]: Finished difference Result 7267 states and 10665 transitions. [2025-02-06 12:08:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:08:33,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-02-06 12:08:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:33,469 INFO L225 Difference]: With dead ends: 7267 [2025-02-06 12:08:33,469 INFO L226 Difference]: Without dead ends: 7267 [2025-02-06 12:08:33,469 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-06 12:08:33,470 INFO L435 NwaCegarLoop]: 3111 mSDtfsCounter, 1457 mSDsluCounter, 5860 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 8971 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:33,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 8971 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:08:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7267 states. [2025-02-06 12:08:33,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7267 to 5252. [2025-02-06 12:08:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5252 states, 4382 states have (on average 1.785257873117298) internal successors, (7823), 5227 states have internal predecessors, (7823), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:08:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 7873 transitions. [2025-02-06 12:08:33,561 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 7873 transitions. Word has length 12 [2025-02-06 12:08:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:33,561 INFO L471 AbstractCegarLoop]: Abstraction has 5252 states and 7873 transitions. [2025-02-06 12:08:33,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 7873 transitions. [2025-02-06 12:08:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 12:08:33,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:33,562 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-06 12:08:33,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:08:33,562 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-06 12:08:33,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1296824834, now seen corresponding path program 1 times [2025-02-06 12:08:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990919291] [2025-02-06 12:08:33,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:33,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:08:33,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:08:33,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:33,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:33,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:33,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990919291] [2025-02-06 12:08:33,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990919291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:33,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:08:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019710899] [2025-02-06 12:08:33,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:33,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:33,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:33,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:33,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:33,664 INFO L87 Difference]: Start difference. First operand 5252 states and 7873 transitions. Second operand has 4 states, 3 states have (on average 7.0) 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-06 12:08:34,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:34,960 INFO L93 Difference]: Finished difference Result 5327 states and 7979 transitions. [2025-02-06 12:08:34,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:08:34,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) 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-06 12:08:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:34,973 INFO L225 Difference]: With dead ends: 5327 [2025-02-06 12:08:34,974 INFO L226 Difference]: Without dead ends: 5327 [2025-02-06 12:08:34,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:08:34,975 INFO L435 NwaCegarLoop]: 1927 mSDtfsCounter, 3123 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3133 SdHoareTripleChecker+Valid, 3740 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:34,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3133 Valid, 3740 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 12:08:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5327 states. [2025-02-06 12:08:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5327 to 5229. [2025-02-06 12:08:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5229 states, 4382 states have (on average 1.7747603833865815) internal successors, (7777), 5204 states have internal predecessors, (7777), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:08:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 7827 transitions. [2025-02-06 12:08:35,073 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 7827 transitions. Word has length 21 [2025-02-06 12:08:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:35,073 INFO L471 AbstractCegarLoop]: Abstraction has 5229 states and 7827 transitions. [2025-02-06 12:08:35,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) 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-06 12:08:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 7827 transitions. [2025-02-06 12:08:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 12:08:35,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:35,074 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-06 12:08:35,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:08:35,074 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-06 12:08:35,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1296824835, now seen corresponding path program 1 times [2025-02-06 12:08:35,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:35,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673391415] [2025-02-06 12:08:35,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:35,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:08:35,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:08:35,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:35,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:35,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673391415] [2025-02-06 12:08:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673391415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:35,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:08:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161893979] [2025-02-06 12:08:35,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:35,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:08:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:35,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:08:35,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:35,182 INFO L87 Difference]: Start difference. First operand 5229 states and 7827 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-06 12:08:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:35,398 INFO L93 Difference]: Finished difference Result 5091 states and 7621 transitions. [2025-02-06 12:08:35,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:08:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-06 12:08:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:35,413 INFO L225 Difference]: With dead ends: 5091 [2025-02-06 12:08:35,413 INFO L226 Difference]: Without dead ends: 5091 [2025-02-06 12:08:35,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:35,414 INFO L435 NwaCegarLoop]: 2767 mSDtfsCounter, 60 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5481 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-06 12:08:35,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5481 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:08:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2025-02-06 12:08:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 5091. [2025-02-06 12:08:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5091 states, 4256 states have (on average 1.7789003759398496) internal successors, (7571), 5066 states have internal predecessors, (7571), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:08:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 7621 transitions. [2025-02-06 12:08:35,498 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 7621 transitions. Word has length 21 [2025-02-06 12:08:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:35,499 INFO L471 AbstractCegarLoop]: Abstraction has 5091 states and 7621 transitions. [2025-02-06 12:08:35,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-06 12:08:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 7621 transitions. [2025-02-06 12:08:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 12:08:35,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:35,500 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-06 12:08:35,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:08:35,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr660REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:08:35,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash 529563616, now seen corresponding path program 1 times [2025-02-06 12:08:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295409449] [2025-02-06 12:08:35,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:35,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:08:35,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:08:35,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:35,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:35,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:35,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295409449] [2025-02-06 12:08:35,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295409449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:35,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:35,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:35,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429000274] [2025-02-06 12:08:35,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:35,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:35,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:35,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:35,621 INFO L87 Difference]: Start difference. First operand 5091 states and 7621 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-06 12:08:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:35,991 INFO L93 Difference]: Finished difference Result 7008 states and 10286 transitions. [2025-02-06 12:08:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:08:35,991 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-06 12:08:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:36,008 INFO L225 Difference]: With dead ends: 7008 [2025-02-06 12:08:36,009 INFO L226 Difference]: Without dead ends: 7008 [2025-02-06 12:08:36,009 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-06 12:08:36,009 INFO L435 NwaCegarLoop]: 3047 mSDtfsCounter, 1320 mSDsluCounter, 5680 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 8727 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:36,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 8727 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:08:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2025-02-06 12:08:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 5101. [2025-02-06 12:08:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5101 states, 4266 states have (on average 1.7770745428973278) internal successors, (7581), 5076 states have internal predecessors, (7581), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:08:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5101 states to 5101 states and 7631 transitions. [2025-02-06 12:08:36,092 INFO L78 Accepts]: Start accepts. Automaton has 5101 states and 7631 transitions. Word has length 21 [2025-02-06 12:08:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:36,092 INFO L471 AbstractCegarLoop]: Abstraction has 5101 states and 7631 transitions. [2025-02-06 12:08:36,092 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-06 12:08:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5101 states and 7631 transitions. [2025-02-06 12:08:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 12:08:36,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:36,093 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] [2025-02-06 12:08:36,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:08:36,093 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-06 12:08:36,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:36,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1546742448, now seen corresponding path program 1 times [2025-02-06 12:08:36,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:36,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458249242] [2025-02-06 12:08:36,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:36,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:36,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:08:36,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:08:36,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:36,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458249242] [2025-02-06 12:08:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458249242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422760568] [2025-02-06 12:08:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:36,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:36,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:36,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:36,170 INFO L87 Difference]: Start difference. First operand 5101 states and 7631 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:36,456 INFO L93 Difference]: Finished difference Result 5078 states and 7587 transitions. [2025-02-06 12:08:36,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:08:36,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2025-02-06 12:08:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:36,471 INFO L225 Difference]: With dead ends: 5078 [2025-02-06 12:08:36,472 INFO L226 Difference]: Without dead ends: 5078 [2025-02-06 12:08:36,472 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-06 12:08:36,473 INFO L435 NwaCegarLoop]: 2729 mSDtfsCounter, 45 mSDsluCounter, 5435 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8164 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-06 12:08:36,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8164 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:08:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2025-02-06 12:08:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5078. [2025-02-06 12:08:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5078 states, 4250 states have (on average 1.7734117647058822) internal successors, (7537), 5053 states have internal predecessors, (7537), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:08:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 7587 transitions. [2025-02-06 12:08:36,566 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 7587 transitions. Word has length 22 [2025-02-06 12:08:36,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:36,566 INFO L471 AbstractCegarLoop]: Abstraction has 5078 states and 7587 transitions. [2025-02-06 12:08:36,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 7587 transitions. [2025-02-06 12:08:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:08:36,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:36,567 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] [2025-02-06 12:08:36,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:08:36,567 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-06 12:08:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 15554502, now seen corresponding path program 1 times [2025-02-06 12:08:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:36,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681838412] [2025-02-06 12:08:36,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:36,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 12:08:36,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 12:08:36,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:36,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:36,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:36,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681838412] [2025-02-06 12:08:36,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681838412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:36,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:08:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718752271] [2025-02-06 12:08:36,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:36,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:36,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:36,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:36,768 INFO L87 Difference]: Start difference. First operand 5078 states and 7587 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:38,992 INFO L93 Difference]: Finished difference Result 7405 states and 10770 transitions. [2025-02-06 12:08:38,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:08:38,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-06 12:08:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:39,009 INFO L225 Difference]: With dead ends: 7405 [2025-02-06 12:08:39,009 INFO L226 Difference]: Without dead ends: 7405 [2025-02-06 12:08:39,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:08:39,010 INFO L435 NwaCegarLoop]: 2199 mSDtfsCounter, 2337 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2341 SdHoareTripleChecker+Valid, 5678 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:39,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2341 Valid, 5678 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 12:08:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7405 states. [2025-02-06 12:08:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7405 to 5074. [2025-02-06 12:08:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5074 states, 4250 states have (on average 1.7715294117647058) internal successors, (7529), 5049 states have internal predecessors, (7529), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:08:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 7579 transitions. [2025-02-06 12:08:39,106 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 7579 transitions. Word has length 36 [2025-02-06 12:08:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:39,106 INFO L471 AbstractCegarLoop]: Abstraction has 5074 states and 7579 transitions. [2025-02-06 12:08:39,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 7579 transitions. [2025-02-06 12:08:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 12:08:39,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:39,110 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] [2025-02-06 12:08:39,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:08:39,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr916REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:08:39,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash -94687070, now seen corresponding path program 1 times [2025-02-06 12:08:39,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:39,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121856530] [2025-02-06 12:08:39,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:39,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:39,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 12:08:39,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 12:08:39,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:39,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:39,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:39,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121856530] [2025-02-06 12:08:39,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121856530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:39,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:39,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:39,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707622074] [2025-02-06 12:08:39,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:39,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:08:39,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:39,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:08:39,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:08:39,315 INFO L87 Difference]: Start difference. First operand 5074 states and 7579 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:39,586 INFO L93 Difference]: Finished difference Result 5062 states and 7559 transitions. [2025-02-06 12:08:39,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:08:39,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 12:08:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:39,596 INFO L225 Difference]: With dead ends: 5062 [2025-02-06 12:08:39,597 INFO L226 Difference]: Without dead ends: 5062 [2025-02-06 12:08:39,597 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-06 12:08:39,597 INFO L435 NwaCegarLoop]: 2727 mSDtfsCounter, 21 mSDsluCounter, 5423 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8150 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-06 12:08:39,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8150 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:08:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2025-02-06 12:08:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 5062. [2025-02-06 12:08:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5062 states, 4238 states have (on average 1.7718263331760264) internal successors, (7509), 5037 states have internal predecessors, (7509), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:08:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 7559 transitions. [2025-02-06 12:08:39,658 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 7559 transitions. Word has length 71 [2025-02-06 12:08:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:39,658 INFO L471 AbstractCegarLoop]: Abstraction has 5062 states and 7559 transitions. [2025-02-06 12:08:39,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 7559 transitions. [2025-02-06 12:08:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 12:08:39,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:39,661 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] [2025-02-06 12:08:39,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:08:39,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr916REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:08:39,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:39,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1681797798, now seen corresponding path program 1 times [2025-02-06 12:08:39,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:39,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057342195] [2025-02-06 12:08:39,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:39,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:39,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-06 12:08:39,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 12:08:39,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:39,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:39,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057342195] [2025-02-06 12:08:39,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057342195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:39,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:39,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:08:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802507489] [2025-02-06 12:08:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:39,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:08:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:39,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:08:39,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:39,797 INFO L87 Difference]: Start difference. First operand 5062 states and 7559 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:40,073 INFO L93 Difference]: Finished difference Result 6576 states and 9748 transitions. [2025-02-06 12:08:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:08:40,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-06 12:08:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:40,086 INFO L225 Difference]: With dead ends: 6576 [2025-02-06 12:08:40,086 INFO L226 Difference]: Without dead ends: 6576 [2025-02-06 12:08:40,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:08:40,086 INFO L435 NwaCegarLoop]: 2743 mSDtfsCounter, 1088 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 5422 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-06 12:08:40,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 5422 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:08:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2025-02-06 12:08:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 5919. [2025-02-06 12:08:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5919 states, 5091 states have (on average 1.7542722451384796) internal successors, (8931), 5890 states have internal predecessors, (8931), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 12:08:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5919 states to 5919 states and 8989 transitions. [2025-02-06 12:08:40,164 INFO L78 Accepts]: Start accepts. Automaton has 5919 states and 8989 transitions. Word has length 79 [2025-02-06 12:08:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:40,164 INFO L471 AbstractCegarLoop]: Abstraction has 5919 states and 8989 transitions. [2025-02-06 12:08:40,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5919 states and 8989 transitions. [2025-02-06 12:08:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 12:08:40,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:40,165 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] [2025-02-06 12:08:40,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:08:40,165 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-06 12:08:40,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1644076863, now seen corresponding path program 1 times [2025-02-06 12:08:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:40,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656706164] [2025-02-06 12:08:40,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:40,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 12:08:40,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 12:08:40,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:40,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:40,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:40,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656706164] [2025-02-06 12:08:40,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656706164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:40,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:40,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:08:40,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894106176] [2025-02-06 12:08:40,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:40,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:08:40,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:40,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:08:40,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:08:40,795 INFO L87 Difference]: Start difference. First operand 5919 states and 8989 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:43,134 INFO L93 Difference]: Finished difference Result 5835 states and 8790 transitions. [2025-02-06 12:08:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:08:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 82 [2025-02-06 12:08:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:43,141 INFO L225 Difference]: With dead ends: 5835 [2025-02-06 12:08:43,141 INFO L226 Difference]: Without dead ends: 5835 [2025-02-06 12:08:43,142 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-06 12:08:43,142 INFO L435 NwaCegarLoop]: 1460 mSDtfsCounter, 2659 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 4021 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2669 SdHoareTripleChecker+Valid, 4335 SdHoareTripleChecker+Invalid, 4114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:43,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2669 Valid, 4335 Invalid, 4114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4021 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 12:08:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2025-02-06 12:08:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5279. [2025-02-06 12:08:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5279 states, 4535 states have (on average 1.7098125689084895) internal successors, (7754), 5250 states have internal predecessors, (7754), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 12:08:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 7812 transitions. [2025-02-06 12:08:43,211 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 7812 transitions. Word has length 82 [2025-02-06 12:08:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:43,211 INFO L471 AbstractCegarLoop]: Abstraction has 5279 states and 7812 transitions. [2025-02-06 12:08:43,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 7812 transitions. [2025-02-06 12:08:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 12:08:43,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:43,212 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] [2025-02-06 12:08:43,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:08:43,212 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-06 12:08:43,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1120449564, now seen corresponding path program 1 times [2025-02-06 12:08:43,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:43,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844453491] [2025-02-06 12:08:43,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:43,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:43,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 12:08:43,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 12:08:43,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:43,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:43,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:43,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844453491] [2025-02-06 12:08:43,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844453491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:43,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:43,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073063586] [2025-02-06 12:08:43,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:43,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:08:43,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:43,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:08:43,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:08:43,523 INFO L87 Difference]: Start difference. First operand 5279 states and 7812 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:45,025 INFO L93 Difference]: Finished difference Result 5278 states and 7810 transitions. [2025-02-06 12:08:45,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:08:45,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2025-02-06 12:08:45,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:45,032 INFO L225 Difference]: With dead ends: 5278 [2025-02-06 12:08:45,032 INFO L226 Difference]: Without dead ends: 5278 [2025-02-06 12:08:45,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:08:45,033 INFO L435 NwaCegarLoop]: 2653 mSDtfsCounter, 2 mSDsluCounter, 5474 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8127 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:45,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8127 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 12:08:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2025-02-06 12:08:45,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 5278. [2025-02-06 12:08:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5278 states, 4535 states have (on average 1.7093715545755237) internal successors, (7752), 5249 states have internal predecessors, (7752), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 12:08:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 7810 transitions. [2025-02-06 12:08:45,103 INFO L78 Accepts]: Start accepts. Automaton has 5278 states and 7810 transitions. Word has length 87 [2025-02-06 12:08:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:45,103 INFO L471 AbstractCegarLoop]: Abstraction has 5278 states and 7810 transitions. [2025-02-06 12:08:45,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5278 states and 7810 transitions. [2025-02-06 12:08:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 12:08:45,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:45,106 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] [2025-02-06 12:08:45,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:08:45,106 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-06 12:08:45,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1120449563, now seen corresponding path program 1 times [2025-02-06 12:08:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98489213] [2025-02-06 12:08:45,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:45,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 12:08:45,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 12:08:45,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:45,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:45,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98489213] [2025-02-06 12:08:45,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98489213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:45,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:45,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:08:45,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150837227] [2025-02-06 12:08:45,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:45,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:08:45,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:45,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:08:45,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:08:45,616 INFO L87 Difference]: Start difference. First operand 5278 states and 7810 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:47,555 INFO L93 Difference]: Finished difference Result 5277 states and 7808 transitions. [2025-02-06 12:08:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:08:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2025-02-06 12:08:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:47,562 INFO L225 Difference]: With dead ends: 5277 [2025-02-06 12:08:47,562 INFO L226 Difference]: Without dead ends: 5277 [2025-02-06 12:08:47,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:08:47,563 INFO L435 NwaCegarLoop]: 2653 mSDtfsCounter, 1 mSDsluCounter, 5448 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8101 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:47,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8101 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 12:08:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5277 states. [2025-02-06 12:08:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5277 to 5277. [2025-02-06 12:08:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5277 states, 4533 states have (on average 1.7096845356276196) internal successors, (7750), 5248 states have internal predecessors, (7750), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 12:08:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 7808 transitions. [2025-02-06 12:08:47,628 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 7808 transitions. Word has length 87 [2025-02-06 12:08:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:47,628 INFO L471 AbstractCegarLoop]: Abstraction has 5277 states and 7808 transitions. [2025-02-06 12:08:47,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:08:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 7808 transitions. [2025-02-06 12:08:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:08:47,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:47,629 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-06 12:08:47,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:08:47,630 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-06 12:08:47,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1518537985, now seen corresponding path program 1 times [2025-02-06 12:08:47,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:47,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307579578] [2025-02-06 12:08:47,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:47,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:47,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:08:47,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:08:47,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:47,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307579578] [2025-02-06 12:08:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307579578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:47,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:08:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052966110] [2025-02-06 12:08:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:47,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:08:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:47,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:08:47,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:08:47,921 INFO L87 Difference]: Start difference. First operand 5277 states and 7808 transitions. Second operand has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:08:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:49,750 INFO L93 Difference]: Finished difference Result 5295 states and 7843 transitions. [2025-02-06 12:08:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:08:49,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 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 95 [2025-02-06 12:08:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:49,760 INFO L225 Difference]: With dead ends: 5295 [2025-02-06 12:08:49,760 INFO L226 Difference]: Without dead ends: 5295 [2025-02-06 12:08:49,761 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-06 12:08:49,761 INFO L435 NwaCegarLoop]: 2617 mSDtfsCounter, 27 mSDsluCounter, 8310 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10927 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:49,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10927 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 12:08:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2025-02-06 12:08:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5286. [2025-02-06 12:08:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5286 states, 4541 states have (on average 1.7090949130147544) internal successors, (7761), 5255 states have internal predecessors, (7761), 29 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (43), 28 states have call predecessors, (43), 29 states have call successors, (43) [2025-02-06 12:08:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 7833 transitions. [2025-02-06 12:08:49,825 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 7833 transitions. Word has length 95 [2025-02-06 12:08:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:49,825 INFO L471 AbstractCegarLoop]: Abstraction has 5286 states and 7833 transitions. [2025-02-06 12:08:49,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:08:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 7833 transitions. [2025-02-06 12:08:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:08:49,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:49,826 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-06 12:08:49,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:08:49,827 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-06 12:08:49,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1518537986, now seen corresponding path program 1 times [2025-02-06 12:08:49,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:49,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673865397] [2025-02-06 12:08:49,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:49,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:08:49,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:08:49,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:49,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:50,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:50,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673865397] [2025-02-06 12:08:50,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673865397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:08:50,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:08:50,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:08:50,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512692212] [2025-02-06 12:08:50,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:08:50,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:08:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:50,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:08:50,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:08:50,346 INFO L87 Difference]: Start difference. First operand 5286 states and 7833 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:08:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:08:52,522 INFO L93 Difference]: Finished difference Result 5286 states and 7831 transitions. [2025-02-06 12:08:52,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:08:52,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 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 95 [2025-02-06 12:08:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:08:52,533 INFO L225 Difference]: With dead ends: 5286 [2025-02-06 12:08:52,533 INFO L226 Difference]: Without dead ends: 5286 [2025-02-06 12:08:52,533 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-06 12:08:52,534 INFO L435 NwaCegarLoop]: 2624 mSDtfsCounter, 22 mSDsluCounter, 7721 mSDsCounter, 0 mSdLazyCounter, 3447 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10345 SdHoareTripleChecker+Invalid, 3456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:08:52,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10345 Invalid, 3456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3447 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 12:08:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5286 states. [2025-02-06 12:08:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5286 to 5286. [2025-02-06 12:08:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5286 states, 4541 states have (on average 1.708654481391764) internal successors, (7759), 5255 states have internal predecessors, (7759), 29 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (43), 28 states have call predecessors, (43), 29 states have call successors, (43) [2025-02-06 12:08:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 7831 transitions. [2025-02-06 12:08:52,604 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 7831 transitions. Word has length 95 [2025-02-06 12:08:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:08:52,605 INFO L471 AbstractCegarLoop]: Abstraction has 5286 states and 7831 transitions. [2025-02-06 12:08:52,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:08:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 7831 transitions. [2025-02-06 12:08:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 12:08:52,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:08:52,606 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] [2025-02-06 12:08:52,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:08:52,606 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-06 12:08:52,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:08:52,607 INFO L85 PathProgramCache]: Analyzing trace with hash -4260410, now seen corresponding path program 1 times [2025-02-06 12:08:52,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:08:52,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824927913] [2025-02-06 12:08:52,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:52,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:08:52,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:08:52,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:08:52,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:52,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:53,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:08:53,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824927913] [2025-02-06 12:08:53,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824927913] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:53,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730465040] [2025-02-06 12:08:53,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:08:53,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:08:53,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:08:53,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:08:53,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:08:53,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:08:53,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:08:53,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:08:53,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:08:53,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 12:08:53,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:08:53,561 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:08:53,563 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-06 12:08:53,601 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-06 12:08:53,685 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-06 12:08:53,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:08:53,879 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-06 12:08:53,922 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-06 12:08:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:08:53,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:08:53,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-06 12:08:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730465040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:08:53,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:08:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-02-06 12:08:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527707398] [2025-02-06 12:08:53,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:08:53,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:08:53,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:08:53,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:08:53,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-02-06 12:08:53,996 INFO L87 Difference]: Start difference. First operand 5286 states and 7831 transitions. Second operand has 19 states, 16 states have (on average 7.5625) internal successors, (121), 18 states have internal predecessors, (121), 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-06 12:09:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:00,106 INFO L93 Difference]: Finished difference Result 5293 states and 7837 transitions. [2025-02-06 12:09:00,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:09:00,107 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.5625) internal successors, (121), 18 states have internal predecessors, (121), 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 96 [2025-02-06 12:09:00,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:00,115 INFO L225 Difference]: With dead ends: 5293 [2025-02-06 12:09:00,115 INFO L226 Difference]: Without dead ends: 5293 [2025-02-06 12:09:00,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 92 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-06 12:09:00,116 INFO L435 NwaCegarLoop]: 1802 mSDtfsCounter, 2698 mSDsluCounter, 21361 mSDsCounter, 0 mSdLazyCounter, 12786 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2716 SdHoareTripleChecker+Valid, 23163 SdHoareTripleChecker+Invalid, 12812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 12786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:00,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2716 Valid, 23163 Invalid, 12812 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 12786 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-02-06 12:09:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2025-02-06 12:09:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5290. [2025-02-06 12:09:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5290 states, 4545 states have (on average 1.7078107810781078) internal successors, (7762), 5258 states have internal predecessors, (7762), 29 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (31), 28 states have call predecessors, (31), 29 states have call successors, (31) [2025-02-06 12:09:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7822 transitions. [2025-02-06 12:09:00,158 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7822 transitions. Word has length 96 [2025-02-06 12:09:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:00,158 INFO L471 AbstractCegarLoop]: Abstraction has 5290 states and 7822 transitions. [2025-02-06 12:09:00,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.5625) internal successors, (121), 18 states have internal predecessors, (121), 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-06 12:09:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7822 transitions. [2025-02-06 12:09:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 12:09:00,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:00,159 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] [2025-02-06 12:09:00,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:09:00,360 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-06 12:09:00,360 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-06 12:09:00,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash -4260409, now seen corresponding path program 1 times [2025-02-06 12:09:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:00,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808956837] [2025-02-06 12:09:00,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:00,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:00,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:09:00,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:09:00,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:00,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:01,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808956837] [2025-02-06 12:09:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808956837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:09:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578994785] [2025-02-06 12:09:01,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:01,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:09:01,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:09:01,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:09:01,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:09:01,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:09:01,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:09:01,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:01,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:01,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 12:09:01,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:09:01,584 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:09:01,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:09:01,591 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-06 12:09:01,603 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-06 12:09:01,609 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-06 12:09:01,667 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-06 12:09:01,670 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-06 12:09:01,759 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:09:01,760 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-06 12:09:01,764 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-06 12:09:01,791 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-06 12:09:01,795 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-06 12:09:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:01,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:09:01,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_813 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:09:01,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578994785] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:09:01,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:09:01,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-02-06 12:09:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196473688] [2025-02-06 12:09:01,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:09:01,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:09:01,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:01,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:09:01,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-02-06 12:09:01,874 INFO L87 Difference]: Start difference. First operand 5290 states and 7822 transitions. Second operand has 15 states, 12 states have (on average 9.583333333333334) internal successors, (115), 15 states have internal predecessors, (115), 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-06 12:09:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:07,098 INFO L93 Difference]: Finished difference Result 5292 states and 7835 transitions. [2025-02-06 12:09:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:09:07,098 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.583333333333334) internal successors, (115), 15 states have internal predecessors, (115), 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 96 [2025-02-06 12:09:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:07,105 INFO L225 Difference]: With dead ends: 5292 [2025-02-06 12:09:07,105 INFO L226 Difference]: Without dead ends: 5292 [2025-02-06 12:09:07,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-02-06 12:09:07,106 INFO L435 NwaCegarLoop]: 1808 mSDtfsCounter, 2680 mSDsluCounter, 14171 mSDsCounter, 0 mSdLazyCounter, 11604 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 15979 SdHoareTripleChecker+Invalid, 11631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 11604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:07,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2698 Valid, 15979 Invalid, 11631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 11604 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-02-06 12:09:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2025-02-06 12:09:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 5280. [2025-02-06 12:09:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5280 states, 4537 states have (on average 1.7083976195724047) internal successors, (7751), 5250 states have internal predecessors, (7751), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 12:09:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5280 states to 5280 states and 7809 transitions. [2025-02-06 12:09:07,148 INFO L78 Accepts]: Start accepts. Automaton has 5280 states and 7809 transitions. Word has length 96 [2025-02-06 12:09:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:07,148 INFO L471 AbstractCegarLoop]: Abstraction has 5280 states and 7809 transitions. [2025-02-06 12:09:07,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.583333333333334) internal successors, (115), 15 states have internal predecessors, (115), 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-06 12:09:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5280 states and 7809 transitions. [2025-02-06 12:09:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:09:07,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:07,149 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-06 12:09:07,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:09:07,350 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-06 12:09:07,350 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr872REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:09:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -122472493, now seen corresponding path program 1 times [2025-02-06 12:09:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111135254] [2025-02-06 12:09:07,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:07,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:09:07,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:09:07,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:07,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:08,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:08,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111135254] [2025-02-06 12:09:08,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111135254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:08,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:08,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:09:08,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414576325] [2025-02-06 12:09:08,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:08,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:09:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:08,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:09:08,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:09:08,061 INFO L87 Difference]: Start difference. First operand 5280 states and 7809 transitions. Second operand has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:09:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:12,399 INFO L93 Difference]: Finished difference Result 5299 states and 7843 transitions. [2025-02-06 12:09:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:09:12,399 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 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 98 [2025-02-06 12:09:12,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:12,408 INFO L225 Difference]: With dead ends: 5299 [2025-02-06 12:09:12,408 INFO L226 Difference]: Without dead ends: 5299 [2025-02-06 12:09:12,408 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-06 12:09:12,409 INFO L435 NwaCegarLoop]: 1809 mSDtfsCounter, 2700 mSDsluCounter, 10643 mSDsCounter, 0 mSdLazyCounter, 9666 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2718 SdHoareTripleChecker+Valid, 12452 SdHoareTripleChecker+Invalid, 9688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:12,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2718 Valid, 12452 Invalid, 9688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 9666 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 12:09:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2025-02-06 12:09:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 5295. [2025-02-06 12:09:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 4551 states have (on average 1.7068776093166338) internal successors, (7768), 5263 states have internal predecessors, (7768), 29 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (31), 28 states have call predecessors, (31), 29 states have call successors, (31) [2025-02-06 12:09:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 7828 transitions. [2025-02-06 12:09:12,471 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 7828 transitions. Word has length 98 [2025-02-06 12:09:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:12,472 INFO L471 AbstractCegarLoop]: Abstraction has 5295 states and 7828 transitions. [2025-02-06 12:09:12,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:09:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 7828 transitions. [2025-02-06 12:09:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:09:12,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:12,473 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-06 12:09:12,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:09:12,473 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:09:12,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:12,474 INFO L85 PathProgramCache]: Analyzing trace with hash -122472494, now seen corresponding path program 1 times [2025-02-06 12:09:12,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:12,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224564571] [2025-02-06 12:09:12,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:12,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:09:12,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:09:12,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:12,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:13,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224564571] [2025-02-06 12:09:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224564571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:13,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:09:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978647471] [2025-02-06 12:09:13,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:13,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:09:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:13,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:09:13,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:09:13,018 INFO L87 Difference]: Start difference. First operand 5295 states and 7828 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:09:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:16,577 INFO L93 Difference]: Finished difference Result 5298 states and 7841 transitions. [2025-02-06 12:09:16,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:09:16,578 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 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 98 [2025-02-06 12:09:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:16,586 INFO L225 Difference]: With dead ends: 5298 [2025-02-06 12:09:16,586 INFO L226 Difference]: Without dead ends: 5298 [2025-02-06 12:09:16,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:09:16,589 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 2701 mSDsluCounter, 14251 mSDsCounter, 0 mSdLazyCounter, 8849 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2719 SdHoareTripleChecker+Valid, 16054 SdHoareTripleChecker+Invalid, 8873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:16,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2719 Valid, 16054 Invalid, 8873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 8849 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-06 12:09:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2025-02-06 12:09:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 5295. [2025-02-06 12:09:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 4551 states have (on average 1.7064381454625357) internal successors, (7766), 5263 states have internal predecessors, (7766), 29 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (31), 28 states have call predecessors, (31), 29 states have call successors, (31) [2025-02-06 12:09:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 7826 transitions. [2025-02-06 12:09:16,657 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 7826 transitions. Word has length 98 [2025-02-06 12:09:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:16,657 INFO L471 AbstractCegarLoop]: Abstraction has 5295 states and 7826 transitions. [2025-02-06 12:09:16,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:09:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 7826 transitions. [2025-02-06 12:09:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:09:16,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:16,658 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] [2025-02-06 12:09:16,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:09:16,659 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr872REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:09:16,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:16,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1930089710, now seen corresponding path program 1 times [2025-02-06 12:09:16,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:16,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656259731] [2025-02-06 12:09:16,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:16,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:09:16,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:09:16,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:16,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:17,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656259731] [2025-02-06 12:09:17,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656259731] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:09:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134732196] [2025-02-06 12:09:17,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:17,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:09:17,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:09:17,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:09:17,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:09:17,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:09:17,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:09:17,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:17,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:17,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 12:09:17,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:09:17,749 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:09:17,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:09:17,757 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-06 12:09:17,778 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-06 12:09:17,786 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-06 12:09:17,869 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-06 12:09:17,873 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-06 12:09:17,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:09:17,977 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-06 12:09:17,982 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-06 12:09:18,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:09:18,046 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-06 12:09:18,052 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-06 12:09:18,069 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-06 12:09:18,073 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-06 12:09:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:18,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:09:18,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1096 (Array Int Int)) (v_ArrVal_1095 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1096 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-02-06 12:09:18,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1096 (Array Int Int)) (v_ArrVal_1095 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1101))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1102) .cse0 v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1102) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1101) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-02-06 12:09:18,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134732196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:09:18,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:09:18,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2025-02-06 12:09:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436460807] [2025-02-06 12:09:18,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:09:18,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:09:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:18,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:09:18,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=425, Unknown=11, NotChecked=86, Total=600 [2025-02-06 12:09:18,247 INFO L87 Difference]: Start difference. First operand 5295 states and 7826 transitions. Second operand has 20 states, 17 states have (on average 7.470588235294118) internal successors, (127), 20 states have internal predecessors, (127), 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)