./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:50:32,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:50:32,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:50:32,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:50:32,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:50:32,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:50:32,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:50:32,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:50:32,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:50:32,500 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:50:32,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:50:32,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:50:32,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:50:32,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:50:32,501 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:50:32,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:50:32,501 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:50:32,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:50:32,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:50:32,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:50:32,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:50:32,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:50:32,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:50:32,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:50:32,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:50:32,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:50:32,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:50:32,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:50:32,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:50:32,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:50:32,504 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/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 -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2025-03-09 00:50:32,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:50:32,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:50:32,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:50:32,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:50:32,741 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:50:32,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2025-03-09 00:50:33,890 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67518c449/2415edfc17fe463abb6a1b1a7b15280e/FLAGb88d1ac4a [2025-03-09 00:50:34,243 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:50:34,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2025-03-09 00:50:34,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67518c449/2415edfc17fe463abb6a1b1a7b15280e/FLAGb88d1ac4a [2025-03-09 00:50:34,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67518c449/2415edfc17fe463abb6a1b1a7b15280e [2025-03-09 00:50:34,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:50:34,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:50:34,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:50:34,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:50:34,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:50:34,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:50:34" (1/1) ... [2025-03-09 00:50:34,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fd6c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:34, skipping insertion in model container [2025-03-09 00:50:34,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:50:34" (1/1) ... [2025-03-09 00:50:34,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:50:34,900 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,929 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,931 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,937 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,944 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,968 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,971 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,973 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,981 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,996 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,996 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,997 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:34,998 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,007 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,010 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,012 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,012 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,022 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,022 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,027 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,027 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,043 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,043 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,044 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,044 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:50:35,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:50:35,067 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:50:35,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:50:35,209 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:50:35,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35 WrapperNode [2025-03-09 00:50:35,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:50:35,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:50:35,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:50:35,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:50:35,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,315 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3338 [2025-03-09 00:50:35,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:50:35,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:50:35,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:50:35,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:50:35,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,444 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 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, 4, 82]. [2025-03-09 00:50:35,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:50:35,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:50:35,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:50:35,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:50:35,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (1/1) ... [2025-03-09 00:50:35,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:50:35,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:50:35,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:50:35,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:50:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-09 00:50:35,637 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-09 00:50:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:50:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:50:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:50:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 00:50:35,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 00:50:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:50:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-09 00:50:35,638 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 00:50:35,638 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 00:50:35,638 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:50:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:50:35,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:50:35,862 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:50:35,864 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:50:38,791 INFO L1307 $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-03-09 00:50:39,044 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2025-03-09 00:50:39,044 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:50:39,139 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:50:39,139 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-09 00:50:39,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:50:39 BoogieIcfgContainer [2025-03-09 00:50:39,139 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:50:39,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:50:39,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:50:39,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:50:39,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:50:34" (1/3) ... [2025-03-09 00:50:39,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103801d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:50:39, skipping insertion in model container [2025-03-09 00:50:39,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:50:35" (2/3) ... [2025-03-09 00:50:39,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103801d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:50:39, skipping insertion in model container [2025-03-09 00:50:39,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:50:39" (3/3) ... [2025-03-09 00:50:39,148 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2025-03-09 00:50:39,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:50:39,160 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test10-1.i that has 6 procedures, 2646 locations, 1 initial locations, 78 loop locations, and 986 error locations. [2025-03-09 00:50:39,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:50:39,227 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;@3103aa0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:50:39,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2025-03-09 00:50:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 2636 states, 1638 states have (on average 1.9786324786324787) internal successors, (3241), 2622 states have internal predecessors, (3241), 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-03-09 00:50:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:50:39,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:39,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:50:39,238 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-03-09 00:50:39,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash 3394041, now seen corresponding path program 1 times [2025-03-09 00:50:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:39,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326247242] [2025-03-09 00:50:39,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:39,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:50:39,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:50:39,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:39,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:39,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:39,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326247242] [2025-03-09 00:50:39,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326247242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:39,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:39,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:50:39,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149012200] [2025-03-09 00:50:39,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:39,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:50:39,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:39,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:50:39,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:50:39,419 INFO L87 Difference]: Start difference. First operand has 2636 states, 1638 states have (on average 1.9786324786324787) internal successors, (3241), 2622 states have internal predecessors, (3241), 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-03-09 00:50:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:40,852 INFO L93 Difference]: Finished difference Result 3219 states and 3790 transitions. [2025-03-09 00:50:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:50:40,854 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-03-09 00:50:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:40,884 INFO L225 Difference]: With dead ends: 3219 [2025-03-09 00:50:40,886 INFO L226 Difference]: Without dead ends: 3217 [2025-03-09 00:50:40,888 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-03-09 00:50:40,890 INFO L435 NwaCegarLoop]: 2063 mSDtfsCounter, 2855 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2865 SdHoareTripleChecker+Valid, 2575 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.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:40,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2865 Valid, 2575 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:50:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2025-03-09 00:50:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 2871. [2025-03-09 00:50:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 1901 states have (on average 1.8742766964755393) internal successors, (3563), 2855 states have internal predecessors, (3563), 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-03-09 00:50:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3595 transitions. [2025-03-09 00:50:41,032 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3595 transitions. Word has length 3 [2025-03-09 00:50:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:41,032 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 3595 transitions. [2025-03-09 00:50:41,032 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-03-09 00:50:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3595 transitions. [2025-03-09 00:50:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:50:41,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:41,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:50:41,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:50:41,033 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-03-09 00:50:41,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:41,034 INFO L85 PathProgramCache]: Analyzing trace with hash 3394042, now seen corresponding path program 1 times [2025-03-09 00:50:41,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:41,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644245702] [2025-03-09 00:50:41,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:41,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:41,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:50:41,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:50:41,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:41,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:41,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:41,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644245702] [2025-03-09 00:50:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644245702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:41,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:41,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:50:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109293340] [2025-03-09 00:50:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:41,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:50:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:41,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:50:41,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:50:41,127 INFO L87 Difference]: Start difference. First operand 2871 states and 3595 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-03-09 00:50:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:42,583 INFO L93 Difference]: Finished difference Result 4036 states and 5064 transitions. [2025-03-09 00:50:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:50:42,583 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-03-09 00:50:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:42,596 INFO L225 Difference]: With dead ends: 4036 [2025-03-09 00:50:42,597 INFO L226 Difference]: Without dead ends: 4036 [2025-03-09 00:50:42,597 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-03-09 00:50:42,597 INFO L435 NwaCegarLoop]: 2613 mSDtfsCounter, 1463 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 4591 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.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:42,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 4591 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:50:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2025-03-09 00:50:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 3708. [2025-03-09 00:50:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 2736 states have (on average 1.8369883040935673) internal successors, (5026), 3689 states have internal predecessors, (5026), 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-03-09 00:50:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 5064 transitions. [2025-03-09 00:50:42,697 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 5064 transitions. Word has length 3 [2025-03-09 00:50:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:42,697 INFO L471 AbstractCegarLoop]: Abstraction has 3708 states and 5064 transitions. [2025-03-09 00:50:42,697 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-03-09 00:50:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 5064 transitions. [2025-03-09 00:50:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 00:50:42,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:42,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:50:42,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:50:42,697 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-03-09 00:50:42,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash -754862443, now seen corresponding path program 1 times [2025-03-09 00:50:42,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:42,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179392582] [2025-03-09 00:50:42,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:42,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:42,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 00:50:42,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 00:50:42,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:42,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:42,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179392582] [2025-03-09 00:50:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179392582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:42,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:50:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666396824] [2025-03-09 00:50:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:42,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:50:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:42,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:50:42,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:50:42,926 INFO L87 Difference]: Start difference. First operand 3708 states and 5064 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:46,577 INFO L93 Difference]: Finished difference Result 6952 states and 8532 transitions. [2025-03-09 00:50:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:50:46,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 00:50:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:46,596 INFO L225 Difference]: With dead ends: 6952 [2025-03-09 00:50:46,597 INFO L226 Difference]: Without dead ends: 6952 [2025-03-09 00:50:46,597 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-03-09 00:50:46,597 INFO L435 NwaCegarLoop]: 2423 mSDtfsCounter, 6139 mSDsluCounter, 5170 mSDsCounter, 0 mSdLazyCounter, 6213 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6142 SdHoareTripleChecker+Valid, 7593 SdHoareTripleChecker+Invalid, 6260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 6213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:46,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6142 Valid, 7593 Invalid, 6260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 6213 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-09 00:50:46,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6952 states. [2025-03-09 00:50:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6952 to 4715. [2025-03-09 00:50:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4715 states, 3743 states have (on average 1.8693561314453646) internal successors, (6997), 4690 states have internal predecessors, (6997), 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-03-09 00:50:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 7047 transitions. [2025-03-09 00:50:46,700 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 7047 transitions. Word has length 7 [2025-03-09 00:50:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:46,700 INFO L471 AbstractCegarLoop]: Abstraction has 4715 states and 7047 transitions. [2025-03-09 00:50:46,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 7047 transitions. [2025-03-09 00:50:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 00:50:46,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:46,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:50:46,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:50:46,701 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-03-09 00:50:46,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:46,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1925895946, now seen corresponding path program 1 times [2025-03-09 00:50:46,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:46,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569630596] [2025-03-09 00:50:46,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:46,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:46,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:50:46,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:50:46,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:46,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:46,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569630596] [2025-03-09 00:50:46,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569630596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:46,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:46,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:50:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589218943] [2025-03-09 00:50:46,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:46,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:50:46,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:46,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:50:46,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:50:46,772 INFO L87 Difference]: Start difference. First operand 4715 states and 7047 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:47,846 INFO L93 Difference]: Finished difference Result 5791 states and 8305 transitions. [2025-03-09 00:50:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:50:47,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 00:50:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:47,861 INFO L225 Difference]: With dead ends: 5791 [2025-03-09 00:50:47,862 INFO L226 Difference]: Without dead ends: 5791 [2025-03-09 00:50:47,862 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-03-09 00:50:47,862 INFO L435 NwaCegarLoop]: 3310 mSDtfsCounter, 2826 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2836 SdHoareTripleChecker+Valid, 4395 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:47,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2836 Valid, 4395 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:50:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2025-03-09 00:50:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 4623. [2025-03-09 00:50:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4623 states, 3743 states have (on average 1.8119155757413838) internal successors, (6782), 4598 states have internal predecessors, (6782), 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-03-09 00:50:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6832 transitions. [2025-03-09 00:50:47,925 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6832 transitions. Word has length 8 [2025-03-09 00:50:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:47,925 INFO L471 AbstractCegarLoop]: Abstraction has 4623 states and 6832 transitions. [2025-03-09 00:50:47,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6832 transitions. [2025-03-09 00:50:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 00:50:47,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:47,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:50:47,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:50:47,926 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-03-09 00:50:47,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:47,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1925895945, now seen corresponding path program 1 times [2025-03-09 00:50:47,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:47,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983955302] [2025-03-09 00:50:47,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:47,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:47,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:50:47,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:50:47,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:47,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983955302] [2025-03-09 00:50:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983955302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:47,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:47,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:50:47,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873743722] [2025-03-09 00:50:47,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:47,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:50:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:47,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:50:47,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:50:47,987 INFO L87 Difference]: Start difference. First operand 4623 states and 6832 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:49,207 INFO L93 Difference]: Finished difference Result 7346 states and 10773 transitions. [2025-03-09 00:50:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:50:49,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 00:50:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:49,225 INFO L225 Difference]: With dead ends: 7346 [2025-03-09 00:50:49,225 INFO L226 Difference]: Without dead ends: 7346 [2025-03-09 00:50:49,225 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-03-09 00:50:49,226 INFO L435 NwaCegarLoop]: 3667 mSDtfsCounter, 2307 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 5331 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.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:49,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 5331 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 00:50:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7346 states. [2025-03-09 00:50:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7346 to 5155. [2025-03-09 00:50:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 4285 states have (on average 1.8030338389731622) internal successors, (7726), 5130 states have internal predecessors, (7726), 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-03-09 00:50:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7776 transitions. [2025-03-09 00:50:49,303 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7776 transitions. Word has length 8 [2025-03-09 00:50:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:49,303 INFO L471 AbstractCegarLoop]: Abstraction has 5155 states and 7776 transitions. [2025-03-09 00:50:49,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7776 transitions. [2025-03-09 00:50:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 00:50:49,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:49,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:50:49,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:50:49,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr346REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:50:49,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1294427171, now seen corresponding path program 1 times [2025-03-09 00:50:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:49,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211663689] [2025-03-09 00:50:49,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:49,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:50:49,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:50:49,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:49,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:49,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:49,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:49,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211663689] [2025-03-09 00:50:49,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211663689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:49,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:49,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:50:49,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190328304] [2025-03-09 00:50:49,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:49,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:50:49,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:49,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:50:49,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:50:49,396 INFO L87 Difference]: Start difference. First operand 5155 states and 7776 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-03-09 00:50:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:49,782 INFO L93 Difference]: Finished difference Result 7142 states and 10540 transitions. [2025-03-09 00:50:49,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:50:49,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-09 00:50:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:49,815 INFO L225 Difference]: With dead ends: 7142 [2025-03-09 00:50:49,815 INFO L226 Difference]: Without dead ends: 7142 [2025-03-09 00:50:49,815 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-03-09 00:50:49,815 INFO L435 NwaCegarLoop]: 3074 mSDtfsCounter, 1443 mSDsluCounter, 5788 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 8862 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.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:49,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 8862 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:50:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7142 states. [2025-03-09 00:50:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7142 to 5157. [2025-03-09 00:50:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5157 states, 4287 states have (on average 1.8026592022393282) internal successors, (7728), 5132 states have internal predecessors, (7728), 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-03-09 00:50:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5157 states to 5157 states and 7778 transitions. [2025-03-09 00:50:49,894 INFO L78 Accepts]: Start accepts. Automaton has 5157 states and 7778 transitions. Word has length 10 [2025-03-09 00:50:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:49,894 INFO L471 AbstractCegarLoop]: Abstraction has 5157 states and 7778 transitions. [2025-03-09 00:50:49,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-03-09 00:50:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5157 states and 7778 transitions. [2025-03-09 00:50:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 00:50:49,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:49,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:50:49,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:50:49,895 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-03-09 00:50:49,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash 180417095, now seen corresponding path program 1 times [2025-03-09 00:50:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:49,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779504908] [2025-03-09 00:50:49,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:49,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:50:49,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:50:49,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:49,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779504908] [2025-03-09 00:50:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779504908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:49,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:50:49,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664976867] [2025-03-09 00:50:49,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:49,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:50:49,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:49,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:50:49,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:50:49,971 INFO L87 Difference]: Start difference. First operand 5157 states and 7778 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-03-09 00:50:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:50,985 INFO L93 Difference]: Finished difference Result 5232 states and 7884 transitions. [2025-03-09 00:50:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:50:50,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2025-03-09 00:50:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:50,995 INFO L225 Difference]: With dead ends: 5232 [2025-03-09 00:50:50,995 INFO L226 Difference]: Without dead ends: 5232 [2025-03-09 00:50:50,995 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-03-09 00:50:50,996 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 3089 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 3667 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:50,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 3667 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:50:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5232 states. [2025-03-09 00:50:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5232 to 5134. [2025-03-09 00:50:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5134 states, 4287 states have (on average 1.7919290879402845) internal successors, (7682), 5109 states have internal predecessors, (7682), 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-03-09 00:50:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5134 states to 5134 states and 7732 transitions. [2025-03-09 00:50:51,087 INFO L78 Accepts]: Start accepts. Automaton has 5134 states and 7732 transitions. Word has length 19 [2025-03-09 00:50:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:51,088 INFO L471 AbstractCegarLoop]: Abstraction has 5134 states and 7732 transitions. [2025-03-09 00:50:51,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-03-09 00:50:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 5134 states and 7732 transitions. [2025-03-09 00:50:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 00:50:51,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:51,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:50:51,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:50:51,088 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-03-09 00:50:51,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:51,089 INFO L85 PathProgramCache]: Analyzing trace with hash 180417096, now seen corresponding path program 1 times [2025-03-09 00:50:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:51,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885138747] [2025-03-09 00:50:51,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:51,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:51,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:50:51,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:50:51,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:51,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:51,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885138747] [2025-03-09 00:50:51,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885138747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:51,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:51,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:50:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774866359] [2025-03-09 00:50:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:51,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:50:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:51,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:50:51,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:50:51,169 INFO L87 Difference]: Start difference. First operand 5134 states and 7732 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-03-09 00:50:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:51,338 INFO L93 Difference]: Finished difference Result 4996 states and 7526 transitions. [2025-03-09 00:50:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:50:51,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-03-09 00:50:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:51,347 INFO L225 Difference]: With dead ends: 4996 [2025-03-09 00:50:51,347 INFO L226 Difference]: Without dead ends: 4996 [2025-03-09 00:50:51,348 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-03-09 00:50:51,348 INFO L435 NwaCegarLoop]: 2732 mSDtfsCounter, 60 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5411 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:51,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5411 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:50:51,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2025-03-09 00:50:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 4996. [2025-03-09 00:50:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4996 states, 4161 states have (on average 1.7966834895457822) internal successors, (7476), 4971 states have internal predecessors, (7476), 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-03-09 00:50:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 7526 transitions. [2025-03-09 00:50:51,399 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 7526 transitions. Word has length 19 [2025-03-09 00:50:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:51,400 INFO L471 AbstractCegarLoop]: Abstraction has 4996 states and 7526 transitions. [2025-03-09 00:50:51,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-03-09 00:50:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 7526 transitions. [2025-03-09 00:50:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 00:50:51,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:51,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:50:51,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:50:51,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr659REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:50:51,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:51,401 INFO L85 PathProgramCache]: Analyzing trace with hash 155882248, now seen corresponding path program 1 times [2025-03-09 00:50:51,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:51,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901467040] [2025-03-09 00:50:51,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:51,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:51,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:50:51,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:50:51,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:51,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:51,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:51,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901467040] [2025-03-09 00:50:51,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901467040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:51,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:51,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:50:51,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760868260] [2025-03-09 00:50:51,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:51,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:50:51,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:51,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:50:51,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:50:51,477 INFO L87 Difference]: Start difference. First operand 4996 states and 7526 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-03-09 00:50:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:51,838 INFO L93 Difference]: Finished difference Result 6883 states and 10161 transitions. [2025-03-09 00:50:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:50:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2025-03-09 00:50:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:51,849 INFO L225 Difference]: With dead ends: 6883 [2025-03-09 00:50:51,849 INFO L226 Difference]: Without dead ends: 6883 [2025-03-09 00:50:51,849 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-03-09 00:50:51,849 INFO L435 NwaCegarLoop]: 3011 mSDtfsCounter, 1306 mSDsluCounter, 5609 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 8620 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:51,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 8620 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:50:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states. [2025-03-09 00:50:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 5006. [2025-03-09 00:50:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5006 states, 4171 states have (on average 1.794773435626948) internal successors, (7486), 4981 states have internal predecessors, (7486), 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-03-09 00:50:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 7536 transitions. [2025-03-09 00:50:51,922 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 7536 transitions. Word has length 19 [2025-03-09 00:50:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:51,923 INFO L471 AbstractCegarLoop]: Abstraction has 5006 states and 7536 transitions. [2025-03-09 00:50:51,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-03-09 00:50:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 7536 transitions. [2025-03-09 00:50:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 00:50:51,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:51,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:50:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:50:51,923 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-03-09 00:50:51,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:51,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1297840874, now seen corresponding path program 1 times [2025-03-09 00:50:51,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:51,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134089524] [2025-03-09 00:50:51,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:51,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 00:50:51,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 00:50:51,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:51,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:51,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:51,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134089524] [2025-03-09 00:50:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134089524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:51,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:50:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757465298] [2025-03-09 00:50:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:50:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:51,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:50:51,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:50:51,998 INFO L87 Difference]: Start difference. First operand 5006 states and 7536 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:52,219 INFO L93 Difference]: Finished difference Result 4983 states and 7492 transitions. [2025-03-09 00:50:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:50:52,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-09 00:50:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:52,228 INFO L225 Difference]: With dead ends: 4983 [2025-03-09 00:50:52,228 INFO L226 Difference]: Without dead ends: 4983 [2025-03-09 00:50:52,229 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-03-09 00:50:52,229 INFO L435 NwaCegarLoop]: 2694 mSDtfsCounter, 45 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8059 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-03-09 00:50:52,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8059 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:50:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2025-03-09 00:50:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 4983. [2025-03-09 00:50:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4983 states, 4155 states have (on average 1.7910950661853189) internal successors, (7442), 4958 states have internal predecessors, (7442), 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-03-09 00:50:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 7492 transitions. [2025-03-09 00:50:52,279 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 7492 transitions. Word has length 20 [2025-03-09 00:50:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:52,279 INFO L471 AbstractCegarLoop]: Abstraction has 4983 states and 7492 transitions. [2025-03-09 00:50:52,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 7492 transitions. [2025-03-09 00:50:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 00:50:52,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:52,280 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] [2025-03-09 00:50:52,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:50:52,280 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-03-09 00:50:52,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:52,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1662614112, now seen corresponding path program 1 times [2025-03-09 00:50:52,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:52,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798027797] [2025-03-09 00:50:52,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:52,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:52,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:50:52,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:50:52,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:52,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:52,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:52,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798027797] [2025-03-09 00:50:52,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798027797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:52,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:52,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:50:52,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502262857] [2025-03-09 00:50:52,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:52,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:50:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:52,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:50:52,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:50:52,412 INFO L87 Difference]: Start difference. First operand 4983 states and 7492 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:53,850 INFO L93 Difference]: Finished difference Result 7268 states and 10633 transitions. [2025-03-09 00:50:53,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:50:53,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-09 00:50:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:53,860 INFO L225 Difference]: With dead ends: 7268 [2025-03-09 00:50:53,860 INFO L226 Difference]: Without dead ends: 7268 [2025-03-09 00:50:53,860 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-03-09 00:50:53,860 INFO L435 NwaCegarLoop]: 2168 mSDtfsCounter, 2307 mSDsluCounter, 3411 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 5579 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:53,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 5579 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:50:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states. [2025-03-09 00:50:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 4979. [2025-03-09 00:50:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4979 states, 4155 states have (on average 1.7891696750902526) internal successors, (7434), 4954 states have internal predecessors, (7434), 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-03-09 00:50:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4979 states to 4979 states and 7484 transitions. [2025-03-09 00:50:53,914 INFO L78 Accepts]: Start accepts. Automaton has 4979 states and 7484 transitions. Word has length 34 [2025-03-09 00:50:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:53,915 INFO L471 AbstractCegarLoop]: Abstraction has 4979 states and 7484 transitions. [2025-03-09 00:50:53,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 7484 transitions. [2025-03-09 00:50:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 00:50:53,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:53,916 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] [2025-03-09 00:50:53,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:50:53,916 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-03-09 00:50:53,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1637404949, now seen corresponding path program 1 times [2025-03-09 00:50:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139687369] [2025-03-09 00:50:53,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:53,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 00:50:53,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 00:50:53,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:53,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:54,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:54,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139687369] [2025-03-09 00:50:54,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139687369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:54,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:54,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:50:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527333955] [2025-03-09 00:50:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:54,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:50:54,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:54,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:50:54,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:50:54,040 INFO L87 Difference]: Start difference. First operand 4979 states and 7484 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-03-09 00:50:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:54,250 INFO L93 Difference]: Finished difference Result 4967 states and 7464 transitions. [2025-03-09 00:50:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:50:54,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2025-03-09 00:50:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:54,258 INFO L225 Difference]: With dead ends: 4967 [2025-03-09 00:50:54,259 INFO L226 Difference]: Without dead ends: 4967 [2025-03-09 00:50:54,259 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-03-09 00:50:54,259 INFO L435 NwaCegarLoop]: 2692 mSDtfsCounter, 21 mSDsluCounter, 5353 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8045 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-03-09 00:50:54,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8045 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:50:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4967 states. [2025-03-09 00:50:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 4967. [2025-03-09 00:50:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4967 states, 4143 states have (on average 1.7895244991552015) internal successors, (7414), 4942 states have internal predecessors, (7414), 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-03-09 00:50:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4967 states to 4967 states and 7464 transitions. [2025-03-09 00:50:54,305 INFO L78 Accepts]: Start accepts. Automaton has 4967 states and 7464 transitions. Word has length 68 [2025-03-09 00:50:54,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:54,305 INFO L471 AbstractCegarLoop]: Abstraction has 4967 states and 7464 transitions. [2025-03-09 00:50:54,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-03-09 00:50:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4967 states and 7464 transitions. [2025-03-09 00:50:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 00:50:54,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:54,307 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] [2025-03-09 00:50:54,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:50:54,307 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-03-09 00:50:54,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash 652935901, now seen corresponding path program 1 times [2025-03-09 00:50:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988672053] [2025-03-09 00:50:54,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:54,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 00:50:54,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 00:50:54,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:54,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:54,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988672053] [2025-03-09 00:50:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988672053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:54,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:50:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496291204] [2025-03-09 00:50:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:54,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:50:54,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:54,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:50:54,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:50:54,423 INFO L87 Difference]: Start difference. First operand 4967 states and 7464 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:54,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:54,665 INFO L93 Difference]: Finished difference Result 6457 states and 9629 transitions. [2025-03-09 00:50:54,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:50:54,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-09 00:50:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:54,674 INFO L225 Difference]: With dead ends: 6457 [2025-03-09 00:50:54,674 INFO L226 Difference]: Without dead ends: 6457 [2025-03-09 00:50:54,675 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-03-09 00:50:54,675 INFO L435 NwaCegarLoop]: 2706 mSDtfsCounter, 1077 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 5350 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-03-09 00:50:54,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 5350 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:50:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2025-03-09 00:50:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 5810. [2025-03-09 00:50:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5810 states, 4982 states have (on average 1.7707747892412686) internal successors, (8822), 5781 states have internal predecessors, (8822), 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-03-09 00:50:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5810 states to 5810 states and 8880 transitions. [2025-03-09 00:50:54,736 INFO L78 Accepts]: Start accepts. Automaton has 5810 states and 8880 transitions. Word has length 76 [2025-03-09 00:50:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:54,736 INFO L471 AbstractCegarLoop]: Abstraction has 5810 states and 8880 transitions. [2025-03-09 00:50:54,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 5810 states and 8880 transitions. [2025-03-09 00:50:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 00:50:54,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:54,737 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-03-09 00:50:54,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:50:54,737 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-03-09 00:50:54,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash -292842370, now seen corresponding path program 1 times [2025-03-09 00:50:54,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:54,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641250284] [2025-03-09 00:50:54,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:54,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:54,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 00:50:54,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 00:50:54,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:54,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:55,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:55,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641250284] [2025-03-09 00:50:55,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641250284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:55,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:50:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925542302] [2025-03-09 00:50:55,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:55,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:50:55,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:55,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:50:55,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:50:55,151 INFO L87 Difference]: Start difference. First operand 5810 states and 8880 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 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-03-09 00:50:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:56,463 INFO L93 Difference]: Finished difference Result 5726 states and 8681 transitions. [2025-03-09 00:50:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:50:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 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-03-09 00:50:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:56,468 INFO L225 Difference]: With dead ends: 5726 [2025-03-09 00:50:56,468 INFO L226 Difference]: Without dead ends: 5726 [2025-03-09 00:50:56,468 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-03-09 00:50:56,468 INFO L435 NwaCegarLoop]: 1424 mSDtfsCounter, 5238 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5248 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:56,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5248 Valid, 2796 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2651 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:50:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2025-03-09 00:50:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5184. [2025-03-09 00:50:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4440 states have (on average 1.725) internal successors, (7659), 5155 states have internal predecessors, (7659), 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-03-09 00:50:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 7717 transitions. [2025-03-09 00:50:56,504 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 7717 transitions. Word has length 79 [2025-03-09 00:50:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:56,505 INFO L471 AbstractCegarLoop]: Abstraction has 5184 states and 7717 transitions. [2025-03-09 00:50:56,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 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-03-09 00:50:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 7717 transitions. [2025-03-09 00:50:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 00:50:56,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:56,505 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] [2025-03-09 00:50:56,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:50:56,506 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-03-09 00:50:56,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2060811752, now seen corresponding path program 1 times [2025-03-09 00:50:56,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:56,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863415253] [2025-03-09 00:50:56,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:56,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 00:50:56,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 00:50:56,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:56,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:56,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:56,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863415253] [2025-03-09 00:50:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863415253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:56,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:50:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136404115] [2025-03-09 00:50:56,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:56,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:50:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:56,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:50:56,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:50:56,681 INFO L87 Difference]: Start difference. First operand 5184 states and 7717 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:57,809 INFO L93 Difference]: Finished difference Result 5183 states and 7715 transitions. [2025-03-09 00:50:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:50:57,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-09 00:50:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:57,814 INFO L225 Difference]: With dead ends: 5183 [2025-03-09 00:50:57,814 INFO L226 Difference]: Without dead ends: 5183 [2025-03-09 00:50:57,815 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-03-09 00:50:57,815 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 2 mSDsluCounter, 5369 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7987 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:57,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7987 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:50:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2025-03-09 00:50:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 5183. [2025-03-09 00:50:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 4440 states have (on average 1.7245495495495495) internal successors, (7657), 5154 states have internal predecessors, (7657), 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-03-09 00:50:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 7715 transitions. [2025-03-09 00:50:57,857 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 7715 transitions. Word has length 84 [2025-03-09 00:50:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:57,857 INFO L471 AbstractCegarLoop]: Abstraction has 5183 states and 7715 transitions. [2025-03-09 00:50:57,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 7715 transitions. [2025-03-09 00:50:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 00:50:57,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:57,858 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] [2025-03-09 00:50:57,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:50:57,858 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-03-09 00:50:57,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2060811753, now seen corresponding path program 1 times [2025-03-09 00:50:57,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:57,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717317670] [2025-03-09 00:50:57,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:57,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 00:50:57,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 00:50:57,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:57,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:58,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:58,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717317670] [2025-03-09 00:50:58,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717317670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:58,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:58,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:50:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079268984] [2025-03-09 00:50:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:58,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:50:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:58,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:50:58,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:50:58,184 INFO L87 Difference]: Start difference. First operand 5183 states and 7715 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:50:59,637 INFO L93 Difference]: Finished difference Result 5182 states and 7713 transitions. [2025-03-09 00:50:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:50:59,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-09 00:50:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:50:59,643 INFO L225 Difference]: With dead ends: 5182 [2025-03-09 00:50:59,643 INFO L226 Difference]: Without dead ends: 5182 [2025-03-09 00:50:59,643 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-03-09 00:50:59,644 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1 mSDsluCounter, 5343 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7961 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.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:50:59,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7961 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:50:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2025-03-09 00:50:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 5182. [2025-03-09 00:50:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 4438 states have (on average 1.724876070301938) internal successors, (7655), 5153 states have internal predecessors, (7655), 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-03-09 00:50:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 7713 transitions. [2025-03-09 00:50:59,689 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 7713 transitions. Word has length 84 [2025-03-09 00:50:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:50:59,689 INFO L471 AbstractCegarLoop]: Abstraction has 5182 states and 7713 transitions. [2025-03-09 00:50:59,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:50:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 7713 transitions. [2025-03-09 00:50:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 00:50:59,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:50:59,690 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] [2025-03-09 00:50:59,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:50:59,690 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-03-09 00:50:59,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:50:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash 690376773, now seen corresponding path program 1 times [2025-03-09 00:50:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:50:59,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516442503] [2025-03-09 00:50:59,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:50:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:50:59,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 00:50:59,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 00:50:59,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:50:59,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:50:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:50:59,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:50:59,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516442503] [2025-03-09 00:50:59,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516442503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:50:59,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:50:59,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:50:59,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062711681] [2025-03-09 00:50:59,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:50:59,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:50:59,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:50:59,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:50:59,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:50:59,878 INFO L87 Difference]: Start difference. First operand 5182 states and 7713 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-03-09 00:51:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:01,672 INFO L93 Difference]: Finished difference Result 5200 states and 7748 transitions. [2025-03-09 00:51:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:51:01,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 92 [2025-03-09 00:51:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:01,679 INFO L225 Difference]: With dead ends: 5200 [2025-03-09 00:51:01,679 INFO L226 Difference]: Without dead ends: 5200 [2025-03-09 00:51:01,679 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-03-09 00:51:01,680 INFO L435 NwaCegarLoop]: 2582 mSDtfsCounter, 27 mSDsluCounter, 9916 mSDsCounter, 0 mSdLazyCounter, 3854 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12498 SdHoareTripleChecker+Invalid, 3865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:01,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12498 Invalid, 3865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3854 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:51:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2025-03-09 00:51:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5191. [2025-03-09 00:51:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 4446 states have (on average 1.7242465137201979) internal successors, (7666), 5160 states have internal predecessors, (7666), 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-03-09 00:51:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7738 transitions. [2025-03-09 00:51:01,727 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7738 transitions. Word has length 92 [2025-03-09 00:51:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:01,727 INFO L471 AbstractCegarLoop]: Abstraction has 5191 states and 7738 transitions. [2025-03-09 00:51:01,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-03-09 00:51:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7738 transitions. [2025-03-09 00:51:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 00:51:01,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:01,728 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] [2025-03-09 00:51:01,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:51:01,728 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-03-09 00:51:01,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash 690376774, now seen corresponding path program 1 times [2025-03-09 00:51:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827923979] [2025-03-09 00:51:01,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:01,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 00:51:01,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 00:51:01,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:01,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:02,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:02,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827923979] [2025-03-09 00:51:02,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827923979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:51:02,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:51:02,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:51:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562432498] [2025-03-09 00:51:02,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:51:02,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:51:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:02,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:51:02,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:51:02,099 INFO L87 Difference]: Start difference. First operand 5191 states and 7738 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-03-09 00:51:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:03,624 INFO L93 Difference]: Finished difference Result 5191 states and 7736 transitions. [2025-03-09 00:51:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:51:03,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 92 [2025-03-09 00:51:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:03,631 INFO L225 Difference]: With dead ends: 5191 [2025-03-09 00:51:03,632 INFO L226 Difference]: Without dead ends: 5191 [2025-03-09 00:51:03,632 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-03-09 00:51:03,632 INFO L435 NwaCegarLoop]: 2589 mSDtfsCounter, 22 mSDsluCounter, 7581 mSDsCounter, 0 mSdLazyCounter, 3447 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10170 SdHoareTripleChecker+Invalid, 3456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:03,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10170 Invalid, 3456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3447 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-09 00:51:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5191 states. [2025-03-09 00:51:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5191 to 5191. [2025-03-09 00:51:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 4446 states have (on average 1.7237966711650923) internal successors, (7664), 5160 states have internal predecessors, (7664), 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-03-09 00:51:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7736 transitions. [2025-03-09 00:51:03,709 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7736 transitions. Word has length 92 [2025-03-09 00:51:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:03,710 INFO L471 AbstractCegarLoop]: Abstraction has 5191 states and 7736 transitions. [2025-03-09 00:51:03,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-03-09 00:51:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7736 transitions. [2025-03-09 00:51:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 00:51:03,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:03,710 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] [2025-03-09 00:51:03,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:51:03,711 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-03-09 00:51:03,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 133985044, now seen corresponding path program 1 times [2025-03-09 00:51:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:03,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799915645] [2025-03-09 00:51:03,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:03,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:51:03,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:51:03,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:03,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:04,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:04,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799915645] [2025-03-09 00:51:04,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799915645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:04,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305989845] [2025-03-09 00:51:04,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:04,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:51:04,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:51:04,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:51:04,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:51:04,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:51:04,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:51:04,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:04,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:04,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 00:51:04,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:51:04,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:51:04,434 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 00:51:04,435 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-03-09 00:51:04,468 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-03-09 00:51:04,530 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-03-09 00:51:04,658 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:04,659 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-03-09 00:51:04,701 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-03-09 00:51:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:04,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:51:04,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305989845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:04,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:51:04,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-03-09 00:51:04,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308737809] [2025-03-09 00:51:04,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:51:04,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:51:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:04,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:51:04,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=320, Unknown=4, NotChecked=0, Total=380 [2025-03-09 00:51:04,786 INFO L87 Difference]: Start difference. First operand 5191 states and 7736 transitions. Second operand has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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-03-09 00:51:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:08,285 INFO L93 Difference]: Finished difference Result 5198 states and 7742 transitions. [2025-03-09 00:51:08,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:51:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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 93 [2025-03-09 00:51:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:08,295 INFO L225 Difference]: With dead ends: 5198 [2025-03-09 00:51:08,296 INFO L226 Difference]: Without dead ends: 5198 [2025-03-09 00:51:08,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=465, Unknown=4, NotChecked=0, Total=552 [2025-03-09 00:51:08,296 INFO L435 NwaCegarLoop]: 1766 mSDtfsCounter, 2638 mSDsluCounter, 15666 mSDsCounter, 0 mSdLazyCounter, 9862 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2656 SdHoareTripleChecker+Valid, 17432 SdHoareTripleChecker+Invalid, 9888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 9862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:08,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2656 Valid, 17432 Invalid, 9888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 9862 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-09 00:51:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5198 states. [2025-03-09 00:51:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5198 to 5195. [2025-03-09 00:51:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5195 states, 4450 states have (on average 1.7229213483146066) internal successors, (7667), 5163 states have internal predecessors, (7667), 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-03-09 00:51:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 7727 transitions. [2025-03-09 00:51:08,349 INFO L78 Accepts]: Start accepts. Automaton has 5195 states and 7727 transitions. Word has length 93 [2025-03-09 00:51:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:08,349 INFO L471 AbstractCegarLoop]: Abstraction has 5195 states and 7727 transitions. [2025-03-09 00:51:08,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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-03-09 00:51:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 5195 states and 7727 transitions. [2025-03-09 00:51:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 00:51:08,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:08,350 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] [2025-03-09 00:51:08,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:51:08,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:51:08,551 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-03-09 00:51:08,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash 133985045, now seen corresponding path program 1 times [2025-03-09 00:51:08,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:08,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357294416] [2025-03-09 00:51:08,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:08,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:08,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:51:08,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:51:08,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:08,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:09,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:09,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357294416] [2025-03-09 00:51:09,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357294416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:09,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245948885] [2025-03-09 00:51:09,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:09,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:51:09,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:51:09,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:51:09,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:51:09,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:51:09,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:51:09,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:09,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:09,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 00:51:09,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:51:09,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:51:09,449 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:51:09,450 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-03-09 00:51:09,454 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-03-09 00:51:09,467 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-03-09 00:51:09,470 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-03-09 00:51:09,518 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-03-09 00:51:09,522 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-03-09 00:51:09,602 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:09,603 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-03-09 00:51:09,609 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-03-09 00:51:09,627 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-03-09 00:51:09,630 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-03-09 00:51:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:09,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:51:09,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_814 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-09 00:51:09,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245948885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:09,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:51:09,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-09 00:51:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199538684] [2025-03-09 00:51:09,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:51:09,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:51:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:09,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:51:09,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-09 00:51:09,707 INFO L87 Difference]: Start difference. First operand 5195 states and 7727 transitions. Second operand has 15 states, 12 states have (on average 11.75) internal successors, (141), 15 states have internal predecessors, (141), 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-03-09 00:51:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:13,605 INFO L93 Difference]: Finished difference Result 5197 states and 7740 transitions. [2025-03-09 00:51:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:51:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.75) internal successors, (141), 15 states have internal predecessors, (141), 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 93 [2025-03-09 00:51:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:13,612 INFO L225 Difference]: With dead ends: 5197 [2025-03-09 00:51:13,612 INFO L226 Difference]: Without dead ends: 5197 [2025-03-09 00:51:13,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 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-03-09 00:51:13,612 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 2633 mSDsluCounter, 12469 mSDsCounter, 0 mSdLazyCounter, 10260 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 14241 SdHoareTripleChecker+Invalid, 10286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 10260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:13,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 14241 Invalid, 10286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 10260 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-09 00:51:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2025-03-09 00:51:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 5185. [2025-03-09 00:51:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5185 states, 4442 states have (on average 1.7235479513732552) internal successors, (7656), 5155 states have internal predecessors, (7656), 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-03-09 00:51:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 7714 transitions. [2025-03-09 00:51:13,668 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 7714 transitions. Word has length 93 [2025-03-09 00:51:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:13,668 INFO L471 AbstractCegarLoop]: Abstraction has 5185 states and 7714 transitions. [2025-03-09 00:51:13,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.75) internal successors, (141), 15 states have internal predecessors, (141), 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-03-09 00:51:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 7714 transitions. [2025-03-09 00:51:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 00:51:13,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:13,670 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-03-09 00:51:13,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 00:51:13,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-09 00:51:13,871 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:51:13,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1581021745, now seen corresponding path program 1 times [2025-03-09 00:51:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:13,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763897996] [2025-03-09 00:51:13,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:13,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 00:51:13,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 00:51:13,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:13,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:14,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:14,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763897996] [2025-03-09 00:51:14,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763897996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:51:14,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:51:14,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-09 00:51:14,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160694183] [2025-03-09 00:51:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:51:14,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:51:14,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:14,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:51:14,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:51:14,331 INFO L87 Difference]: Start difference. First operand 5185 states and 7714 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 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-03-09 00:51:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:17,534 INFO L93 Difference]: Finished difference Result 5204 states and 7748 transitions. [2025-03-09 00:51:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:51:17,534 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 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-03-09 00:51:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:17,540 INFO L225 Difference]: With dead ends: 5204 [2025-03-09 00:51:17,540 INFO L226 Difference]: Without dead ends: 5204 [2025-03-09 00:51:17,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-09 00:51:17,541 INFO L435 NwaCegarLoop]: 1766 mSDtfsCounter, 2649 mSDsluCounter, 17412 mSDsCounter, 0 mSdLazyCounter, 10831 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 19178 SdHoareTripleChecker+Invalid, 10854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 10831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:17,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2667 Valid, 19178 Invalid, 10854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 10831 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-09 00:51:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2025-03-09 00:51:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 5200. [2025-03-09 00:51:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 4456 states have (on average 1.7219479353680431) internal successors, (7673), 5168 states have internal predecessors, (7673), 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-03-09 00:51:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 7733 transitions. [2025-03-09 00:51:17,578 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 7733 transitions. Word has length 95 [2025-03-09 00:51:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:17,578 INFO L471 AbstractCegarLoop]: Abstraction has 5200 states and 7733 transitions. [2025-03-09 00:51:17,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 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-03-09 00:51:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 7733 transitions. [2025-03-09 00:51:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 00:51:17,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:17,579 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-03-09 00:51:17,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 00:51:17,579 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr872REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:51:17,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1581021744, now seen corresponding path program 1 times [2025-03-09 00:51:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:17,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217229694] [2025-03-09 00:51:17,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:17,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:17,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 00:51:17,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 00:51:17,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:17,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217229694] [2025-03-09 00:51:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217229694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:51:18,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:51:18,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 00:51:18,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090333214] [2025-03-09 00:51:18,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:51:18,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:51:18,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:18,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:51:18,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:51:18,057 INFO L87 Difference]: Start difference. First operand 5200 states and 7733 transitions. Second operand has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 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-03-09 00:51:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:20,812 INFO L93 Difference]: Finished difference Result 5203 states and 7746 transitions. [2025-03-09 00:51:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:51:20,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 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-03-09 00:51:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:20,821 INFO L225 Difference]: With dead ends: 5203 [2025-03-09 00:51:20,822 INFO L226 Difference]: Without dead ends: 5203 [2025-03-09 00:51:20,822 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-03-09 00:51:20,823 INFO L435 NwaCegarLoop]: 1773 mSDtfsCounter, 2648 mSDsluCounter, 9351 mSDsCounter, 0 mSdLazyCounter, 7959 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2666 SdHoareTripleChecker+Valid, 11124 SdHoareTripleChecker+Invalid, 7981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:20,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2666 Valid, 11124 Invalid, 7981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7959 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-09 00:51:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5203 states. [2025-03-09 00:51:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5203 to 5200. [2025-03-09 00:51:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 4456 states have (on average 1.7214991023339319) internal successors, (7671), 5168 states have internal predecessors, (7671), 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-03-09 00:51:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 7731 transitions. [2025-03-09 00:51:20,867 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 7731 transitions. Word has length 95 [2025-03-09 00:51:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:20,868 INFO L471 AbstractCegarLoop]: Abstraction has 5200 states and 7731 transitions. [2025-03-09 00:51:20,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 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-03-09 00:51:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 7731 transitions. [2025-03-09 00:51:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 00:51:20,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:20,869 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-03-09 00:51:20,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 00:51:20,869 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:51:20,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1526742176, now seen corresponding path program 1 times [2025-03-09 00:51:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:20,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802306741] [2025-03-09 00:51:20,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:20,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:20,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 00:51:20,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 00:51:20,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:20,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:21,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802306741] [2025-03-09 00:51:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802306741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:21,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542464100] [2025-03-09 00:51:21,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:21,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:51:21,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:51:21,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:51:21,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:51:21,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 00:51:21,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 00:51:21,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:21,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:21,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 00:51:21,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:51:21,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:51:21,658 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 00:51:21,658 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-03-09 00:51:21,680 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-03-09 00:51:21,728 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-03-09 00:51:21,819 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:21,820 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-03-09 00:51:21,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:21,883 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-03-09 00:51:21,892 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-03-09 00:51:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:21,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:51:21,949 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1096 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-09 00:51:21,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1099))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1096)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:51:21,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542464100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:21,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:51:21,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-09 00:51:21,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142457123] [2025-03-09 00:51:21,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:51:21,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:51:21,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:21,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:51:21,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=421, Unknown=15, NotChecked=86, Total=600 [2025-03-09 00:51:21,968 INFO L87 Difference]: Start difference. First operand 5200 states and 7731 transitions. Second operand has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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-03-09 00:51:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:25,961 INFO L93 Difference]: Finished difference Result 5202 states and 7744 transitions. [2025-03-09 00:51:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:51:25,961 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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-03-09 00:51:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:25,967 INFO L225 Difference]: With dead ends: 5202 [2025-03-09 00:51:25,967 INFO L226 Difference]: Without dead ends: 5202 [2025-03-09 00:51:25,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=544, Unknown=15, NotChecked=98, Total=756 [2025-03-09 00:51:25,968 INFO L435 NwaCegarLoop]: 1765 mSDtfsCounter, 2625 mSDsluCounter, 19141 mSDsCounter, 0 mSdLazyCounter, 11805 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2643 SdHoareTripleChecker+Valid, 20906 SdHoareTripleChecker+Invalid, 11830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 11805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:25,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2643 Valid, 20906 Invalid, 11830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 11805 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-09 00:51:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2025-03-09 00:51:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 5199. [2025-03-09 00:51:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5199 states, 4456 states have (on average 1.7210502692998204) internal successors, (7669), 5167 states have internal predecessors, (7669), 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-03-09 00:51:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 7729 transitions. [2025-03-09 00:51:26,012 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 7729 transitions. Word has length 96 [2025-03-09 00:51:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:26,013 INFO L471 AbstractCegarLoop]: Abstraction has 5199 states and 7729 transitions. [2025-03-09 00:51:26,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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-03-09 00:51:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 7729 transitions. [2025-03-09 00:51:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 00:51:26,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:26,014 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-03-09 00:51:26,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:51:26,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:51:26,215 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr872REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:51:26,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1526742177, now seen corresponding path program 1 times [2025-03-09 00:51:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032327247] [2025-03-09 00:51:26,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:26,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 00:51:26,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 00:51:26,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:26,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:26,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:26,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032327247] [2025-03-09 00:51:26,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032327247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369165372] [2025-03-09 00:51:26,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:26,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:51:26,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:51:26,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:51:26,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:51:26,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 00:51:27,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 00:51:27,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:27,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:27,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 00:51:27,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:51:27,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:51:27,107 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:51:27,107 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-03-09 00:51:27,111 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-03-09 00:51:27,117 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-03-09 00:51:27,121 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-03-09 00:51:27,161 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-03-09 00:51:27,164 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-03-09 00:51:27,234 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:27,235 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-03-09 00:51:27,242 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-03-09 00:51:27,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:27,290 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-03-09 00:51:27,293 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-03-09 00:51:27,307 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-03-09 00:51:27,309 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-03-09 00:51:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:27,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:51:27,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1250 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-03-09 00:51:27,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1256) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1257))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1256) .cse1 v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-09 00:51:27,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369165372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:27,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:51:27,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-03-09 00:51:27,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792681133] [2025-03-09 00:51:27,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:51:27,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:51:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:27,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:51:27,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=312, Unknown=7, NotChecked=74, Total=462 [2025-03-09 00:51:27,426 INFO L87 Difference]: Start difference. First operand 5199 states and 7729 transitions. Second operand has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:51:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:31,982 INFO L93 Difference]: Finished difference Result 5201 states and 7742 transitions. [2025-03-09 00:51:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:51:31,982 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2025-03-09 00:51:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:31,988 INFO L225 Difference]: With dead ends: 5201 [2025-03-09 00:51:31,988 INFO L226 Difference]: Without dead ends: 5201 [2025-03-09 00:51:31,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=491, Unknown=7, NotChecked=94, Total=702 [2025-03-09 00:51:31,989 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 2633 mSDsluCounter, 13508 mSDsCounter, 0 mSdLazyCounter, 11957 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 15279 SdHoareTripleChecker+Invalid, 11981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 11957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:31,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 15279 Invalid, 11981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 11957 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-09 00:51:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2025-03-09 00:51:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 5183. [2025-03-09 00:51:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 4442 states have (on average 1.7226474561008556) internal successors, (7652), 5153 states have internal predecessors, (7652), 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-03-09 00:51:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 7710 transitions. [2025-03-09 00:51:32,030 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 7710 transitions. Word has length 96 [2025-03-09 00:51:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:32,030 INFO L471 AbstractCegarLoop]: Abstraction has 5183 states and 7710 transitions. [2025-03-09 00:51:32,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:51:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 7710 transitions. [2025-03-09 00:51:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 00:51:32,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:32,031 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-03-09 00:51:32,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:51:32,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:51:32,232 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr867REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:51:32,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1604529954, now seen corresponding path program 1 times [2025-03-09 00:51:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:32,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696305916] [2025-03-09 00:51:32,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:32,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 00:51:32,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 00:51:32,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:32,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:32,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:32,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696305916] [2025-03-09 00:51:32,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696305916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:51:32,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:51:32,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 00:51:32,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877166994] [2025-03-09 00:51:32,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:51:32,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:51:32,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:32,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:51:32,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:51:32,499 INFO L87 Difference]: Start difference. First operand 5183 states and 7710 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-09 00:51:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:34,952 INFO L93 Difference]: Finished difference Result 5208 states and 7750 transitions. [2025-03-09 00:51:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:51:34,953 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-09 00:51:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:34,958 INFO L225 Difference]: With dead ends: 5208 [2025-03-09 00:51:34,958 INFO L226 Difference]: Without dead ends: 5208 [2025-03-09 00:51:34,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-09 00:51:34,958 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 2653 mSDsluCounter, 12195 mSDsCounter, 0 mSdLazyCounter, 7851 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2671 SdHoareTripleChecker+Valid, 13966 SdHoareTripleChecker+Invalid, 7874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:34,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2671 Valid, 13966 Invalid, 7874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 7851 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-09 00:51:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5208 states. [2025-03-09 00:51:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5208 to 5204. [2025-03-09 00:51:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5204 states, 4462 states have (on average 1.72008068130883) internal successors, (7675), 5172 states have internal predecessors, (7675), 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-03-09 00:51:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5204 states to 5204 states and 7735 transitions. [2025-03-09 00:51:35,019 INFO L78 Accepts]: Start accepts. Automaton has 5204 states and 7735 transitions. Word has length 98 [2025-03-09 00:51:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:35,019 INFO L471 AbstractCegarLoop]: Abstraction has 5204 states and 7735 transitions. [2025-03-09 00:51:35,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-09 00:51:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 5204 states and 7735 transitions. [2025-03-09 00:51:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 00:51:35,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:35,020 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-03-09 00:51:35,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 00:51:35,020 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr868REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:51:35,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1604529953, now seen corresponding path program 1 times [2025-03-09 00:51:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:35,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195248494] [2025-03-09 00:51:35,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:35,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 00:51:35,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 00:51:35,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:35,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:35,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195248494] [2025-03-09 00:51:35,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195248494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:51:35,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:51:35,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 00:51:35,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379291996] [2025-03-09 00:51:35,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:51:35,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:51:35,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:35,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:51:35,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:51:35,469 INFO L87 Difference]: Start difference. First operand 5204 states and 7735 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-09 00:51:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:38,790 INFO L93 Difference]: Finished difference Result 5207 states and 7748 transitions. [2025-03-09 00:51:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:51:38,790 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-09 00:51:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:38,796 INFO L225 Difference]: With dead ends: 5207 [2025-03-09 00:51:38,796 INFO L226 Difference]: Without dead ends: 5207 [2025-03-09 00:51:38,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:51:38,796 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 2665 mSDsluCounter, 10392 mSDsCounter, 0 mSdLazyCounter, 9662 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2683 SdHoareTripleChecker+Valid, 12164 SdHoareTripleChecker+Invalid, 9684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:38,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2683 Valid, 12164 Invalid, 9684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 9662 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-09 00:51:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2025-03-09 00:51:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 5204. [2025-03-09 00:51:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5204 states, 4462 states have (on average 1.7196324518153294) internal successors, (7673), 5172 states have internal predecessors, (7673), 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-03-09 00:51:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5204 states to 5204 states and 7733 transitions. [2025-03-09 00:51:38,831 INFO L78 Accepts]: Start accepts. Automaton has 5204 states and 7733 transitions. Word has length 98 [2025-03-09 00:51:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:38,831 INFO L471 AbstractCegarLoop]: Abstraction has 5204 states and 7733 transitions. [2025-03-09 00:51:38,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-09 00:51:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 5204 states and 7733 transitions. [2025-03-09 00:51:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-09 00:51:38,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:38,832 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-03-09 00:51:38,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 00:51:38,833 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr867REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:51:38,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash -524592019, now seen corresponding path program 1 times [2025-03-09 00:51:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741944937] [2025-03-09 00:51:38,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:38,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-09 00:51:38,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 00:51:38,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:38,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:39,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741944937] [2025-03-09 00:51:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741944937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212046537] [2025-03-09 00:51:39,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:39,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:51:39,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:51:39,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:51:39,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:51:39,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-09 00:51:39,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 00:51:39,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:39,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:39,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 00:51:39,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:51:39,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:51:39,431 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 00:51:39,434 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-03-09 00:51:39,450 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-03-09 00:51:39,497 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-03-09 00:51:39,583 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:39,583 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-03-09 00:51:39,631 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:39,632 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-03-09 00:51:39,670 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:39,670 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-03-09 00:51:39,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 31 treesize of output 13 [2025-03-09 00:51:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:39,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:51:39,718 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1563) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-09 00:51:39,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1562 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1562))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:51:39,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1562 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1562))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:51:39,770 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1562 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1566))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1562)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:51:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212046537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:39,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:51:39,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-03-09 00:51:39,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065509132] [2025-03-09 00:51:39,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:51:39,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:51:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:39,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:51:39,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=509, Unknown=8, NotChecked=196, Total=812 [2025-03-09 00:51:39,773 INFO L87 Difference]: Start difference. First operand 5204 states and 7733 transitions. Second operand has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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-03-09 00:51:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:44,636 INFO L93 Difference]: Finished difference Result 5206 states and 7746 transitions. [2025-03-09 00:51:44,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:51:44,637 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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 99 [2025-03-09 00:51:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:44,642 INFO L225 Difference]: With dead ends: 5206 [2025-03-09 00:51:44,642 INFO L226 Difference]: Without dead ends: 5206 [2025-03-09 00:51:44,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=643, Unknown=8, NotChecked=220, Total=992 [2025-03-09 00:51:44,642 INFO L435 NwaCegarLoop]: 1764 mSDtfsCounter, 2626 mSDsluCounter, 22644 mSDsCounter, 0 mSdLazyCounter, 13751 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2644 SdHoareTripleChecker+Valid, 24408 SdHoareTripleChecker+Invalid, 13776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 13751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:44,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2644 Valid, 24408 Invalid, 13776 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 13751 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-09 00:51:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2025-03-09 00:51:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 5203. [2025-03-09 00:51:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5203 states, 4462 states have (on average 1.7191842223218288) internal successors, (7671), 5171 states have internal predecessors, (7671), 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-03-09 00:51:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5203 states to 5203 states and 7731 transitions. [2025-03-09 00:51:44,702 INFO L78 Accepts]: Start accepts. Automaton has 5203 states and 7731 transitions. Word has length 99 [2025-03-09 00:51:44,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:44,702 INFO L471 AbstractCegarLoop]: Abstraction has 5203 states and 7731 transitions. [2025-03-09 00:51:44,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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-03-09 00:51:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5203 states and 7731 transitions. [2025-03-09 00:51:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-09 00:51:44,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:44,703 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-03-09 00:51:44,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:51:44,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 00:51:44,903 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr868REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:51:44,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:44,904 INFO L85 PathProgramCache]: Analyzing trace with hash -524592018, now seen corresponding path program 1 times [2025-03-09 00:51:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:44,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683058806] [2025-03-09 00:51:44,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-09 00:51:44,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 00:51:44,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:44,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:45,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:45,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683058806] [2025-03-09 00:51:45,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683058806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:45,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248546906] [2025-03-09 00:51:45,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:45,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:51:45,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:51:45,424 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:51:45,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:51:45,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-09 00:51:45,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 00:51:45,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:45,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:45,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 00:51:45,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:51:45,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:51:45,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:51:45,716 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-03-09 00:51:45,719 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-03-09 00:51:45,732 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-03-09 00:51:45,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:51:45,785 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-03-09 00:51:45,788 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-03-09 00:51:45,843 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:45,843 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-03-09 00:51:45,848 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-03-09 00:51:45,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:45,896 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-03-09 00:51:45,901 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-03-09 00:51:45,944 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:51:45,944 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-03-09 00:51:45,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2025-03-09 00:51:45,982 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-03-09 00:51:45,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-09 00:51:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:46,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:51:46,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248546906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:51:46,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:51:46,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2025-03-09 00:51:46,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106760444] [2025-03-09 00:51:46,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:51:46,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 00:51:46,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:46,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 00:51:46,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=728, Unknown=30, NotChecked=0, Total=870 [2025-03-09 00:51:46,420 INFO L87 Difference]: Start difference. First operand 5203 states and 7731 transitions. Second operand has 23 states, 20 states have (on average 7.95) internal successors, (159), 23 states have internal predecessors, (159), 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-03-09 00:51:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:51,590 INFO L93 Difference]: Finished difference Result 5205 states and 7744 transitions. [2025-03-09 00:51:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:51:51,590 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.95) internal successors, (159), 23 states have internal predecessors, (159), 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 99 [2025-03-09 00:51:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:51,595 INFO L225 Difference]: With dead ends: 5205 [2025-03-09 00:51:51,595 INFO L226 Difference]: Without dead ends: 5205 [2025-03-09 00:51:51,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1047, Unknown=30, NotChecked=0, Total=1260 [2025-03-09 00:51:51,596 INFO L435 NwaCegarLoop]: 1770 mSDtfsCounter, 2634 mSDsluCounter, 16620 mSDsCounter, 0 mSdLazyCounter, 14254 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 18390 SdHoareTripleChecker+Invalid, 14281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 14254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:51,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2652 Valid, 18390 Invalid, 14281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 14254 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-09 00:51:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2025-03-09 00:51:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 5181. [2025-03-09 00:51:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 4442 states have (on average 1.7217469608284557) internal successors, (7648), 5151 states have internal predecessors, (7648), 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-03-09 00:51:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 7706 transitions. [2025-03-09 00:51:51,642 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 7706 transitions. Word has length 99 [2025-03-09 00:51:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:51,642 INFO L471 AbstractCegarLoop]: Abstraction has 5181 states and 7706 transitions. [2025-03-09 00:51:51,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.95) internal successors, (159), 23 states have internal predecessors, (159), 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-03-09 00:51:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 7706 transitions. [2025-03-09 00:51:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 00:51:51,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:51,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:51:51,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:51:51,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 00:51:51,844 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr863REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:51:51,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1857921976, now seen corresponding path program 1 times [2025-03-09 00:51:51,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:51,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720786871] [2025-03-09 00:51:51,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:51,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:51,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:51:51,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:51:51,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:51,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:51:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:51:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:51:52,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720786871] [2025-03-09 00:51:52,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720786871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:51:52,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:51:52,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-09 00:51:52,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673698668] [2025-03-09 00:51:52,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:51:52,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 00:51:52,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:51:52,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 00:51:52,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:51:52,187 INFO L87 Difference]: Start difference. First operand 5181 states and 7706 transitions. Second operand has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 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-03-09 00:51:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:51:55,229 INFO L93 Difference]: Finished difference Result 5212 states and 7752 transitions. [2025-03-09 00:51:55,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:51:55,230 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 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 101 [2025-03-09 00:51:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:51:55,233 INFO L225 Difference]: With dead ends: 5212 [2025-03-09 00:51:55,234 INFO L226 Difference]: Without dead ends: 5212 [2025-03-09 00:51:55,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:51:55,234 INFO L435 NwaCegarLoop]: 1764 mSDtfsCounter, 2651 mSDsluCounter, 15696 mSDsCounter, 0 mSdLazyCounter, 9856 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2669 SdHoareTripleChecker+Valid, 17460 SdHoareTripleChecker+Invalid, 9879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 9856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:51:55,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2669 Valid, 17460 Invalid, 9879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 9856 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-09 00:51:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2025-03-09 00:51:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 5208. [2025-03-09 00:51:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5208 states, 4468 states have (on average 1.718218442256043) internal successors, (7677), 5176 states have internal predecessors, (7677), 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-03-09 00:51:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 7737 transitions. [2025-03-09 00:51:55,268 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 7737 transitions. Word has length 101 [2025-03-09 00:51:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:51:55,268 INFO L471 AbstractCegarLoop]: Abstraction has 5208 states and 7737 transitions. [2025-03-09 00:51:55,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 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-03-09 00:51:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 7737 transitions. [2025-03-09 00:51:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 00:51:55,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:51:55,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:51:55,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 00:51:55,268 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr864REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-09 00:51:55,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:51:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1857921975, now seen corresponding path program 1 times [2025-03-09 00:51:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:51:55,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818014518] [2025-03-09 00:51:55,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:51:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:51:55,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:51:55,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:51:55,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:51:55,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat