./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 13:54:17,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:54:18,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 13:54:18,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:54:18,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:54:18,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:54:18,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:54:18,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:54:18,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:54:18,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:54:18,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:54:18,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:54:18,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:54:18,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:54:18,087 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:54:18,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:54:18,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 13:54:18,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:54:18,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 13:54:18,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:54:18,088 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:54:18,088 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:54:18,088 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:54:18,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:54:18,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:54:18,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:54:18,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 13:54:18,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:54:18,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:54:18,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:54:18,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:54:18,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:54:18,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:54:18,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:54:18,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:54:18,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:54:18,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:54:18,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:54:18,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:54:18,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:54:18,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:54:18,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:54:18,090 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-17 13:54:18,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:54:18,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:54:18,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:54:18,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:54:18,318 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:54:18,319 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-17 13:54:19,541 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25473bed/1412dd83d06346aea144db3c538a3858/FLAG6768721db [2025-03-17 13:54:19,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:54:19,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2025-03-17 13:54:19,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25473bed/1412dd83d06346aea144db3c538a3858/FLAG6768721db [2025-03-17 13:54:19,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25473bed/1412dd83d06346aea144db3c538a3858 [2025-03-17 13:54:19,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:54:19,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:54:19,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:54:19,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:54:19,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:54:19,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:54:19" (1/1) ... [2025-03-17 13:54:19,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465ecbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:19, skipping insertion in model container [2025-03-17 13:54:19,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:54:19" (1/1) ... [2025-03-17 13:54:19,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:54:20,211 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-17 13:54:20,240 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-17 13:54:20,245 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-17 13:54:20,248 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-17 13:54:20,252 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-17 13:54:20,274 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-17 13:54:20,276 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-17 13:54:20,277 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-17 13:54:20,280 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-17 13:54:20,297 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:54:20,297 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:54:20,299 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-17 13:54:20,299 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-17 13:54:20,311 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-17 13:54:20,313 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:54:20,314 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-17 13:54:20,314 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-17 13:54:20,326 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:54:20,327 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-17 13:54:20,330 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-17 13:54:20,330 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-17 13:54:20,340 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-17 13:54:20,340 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-17 13:54:20,341 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-17 13:54:20,341 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-17 13:54:20,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:54:20,368 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:54:20,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:54:20,508 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:54:20,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20 WrapperNode [2025-03-17 13:54:20,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:54:20,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:54:20,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:54:20,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:54:20,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,604 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3338 [2025-03-17 13:54:20,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:54:20,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:54:20,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:54:20,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:54:20,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,748 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-17 13:54:20,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:54:20,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:54:20,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:54:20,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:54:20,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (1/1) ... [2025-03-17 13:54:20,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:54:20,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:54:20,874 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-17 13:54:20,877 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-17 13:54:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-17 13:54:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-17 13:54:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:54:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:54:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 13:54:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 13:54:20,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 13:54:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:54:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:54:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 13:54:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 13:54:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 13:54:20,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 13:54:20,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 13:54:20,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:54:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:54:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 13:54:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:54:20,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:54:21,142 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:54:21,144 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:54:24,166 INFO L1322 $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-17 13:54:24,346 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2025-03-17 13:54:24,346 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:54:24,479 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:54:24,479 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 13:54:24,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:54:24 BoogieIcfgContainer [2025-03-17 13:54:24,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:54:24,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:54:24,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:54:24,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:54:24,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:54:19" (1/3) ... [2025-03-17 13:54:24,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1fc97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:54:24, skipping insertion in model container [2025-03-17 13:54:24,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:20" (2/3) ... [2025-03-17 13:54:24,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1fc97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:54:24, skipping insertion in model container [2025-03-17 13:54:24,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:54:24" (3/3) ... [2025-03-17 13:54:24,490 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2025-03-17 13:54:24,501 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:54:24,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test10-1.i that has 6 procedures, 2645 locations, 1 initial locations, 78 loop locations, and 986 error locations. [2025-03-17 13:54:24,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:54:24,579 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;@605ff25d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:54:24,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2025-03-17 13:54:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 2635 states, 1637 states have (on average 1.979230299328039) internal successors, (3240), 2621 states have internal predecessors, (3240), 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-17 13:54:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:54:24,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:24,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:54:24,594 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-17 13:54:24,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:24,599 INFO L85 PathProgramCache]: Analyzing trace with hash 109343, now seen corresponding path program 1 times [2025-03-17 13:54:24,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:24,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754086205] [2025-03-17 13:54:24,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:24,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:24,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:54:24,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:54:24,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:24,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:24,746 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-17 13:54:24,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754086205] [2025-03-17 13:54:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754086205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:24,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:24,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:54:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831440265] [2025-03-17 13:54:24,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:24,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:24,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:24,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:24,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:24,777 INFO L87 Difference]: Start difference. First operand has 2635 states, 1637 states have (on average 1.979230299328039) internal successors, (3240), 2621 states have internal predecessors, (3240), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:26,259 INFO L93 Difference]: Finished difference Result 3218 states and 3789 transitions. [2025-03-17 13:54:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:26,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 13:54:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:26,288 INFO L225 Difference]: With dead ends: 3218 [2025-03-17 13:54:26,288 INFO L226 Difference]: Without dead ends: 3216 [2025-03-17 13:54:26,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:26,292 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 2855 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2865 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:26,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2865 Valid, 2574 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 13:54:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2025-03-17 13:54:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 2870. [2025-03-17 13:54:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2870 states, 1900 states have (on average 1.8747368421052633) internal successors, (3562), 2854 states have internal predecessors, (3562), 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-17 13:54:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 3594 transitions. [2025-03-17 13:54:26,441 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 3594 transitions. Word has length 2 [2025-03-17 13:54:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:26,441 INFO L471 AbstractCegarLoop]: Abstraction has 2870 states and 3594 transitions. [2025-03-17 13:54:26,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 3594 transitions. [2025-03-17 13:54:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:54:26,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:26,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:54:26,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:54:26,443 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-17 13:54:26,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 109344, now seen corresponding path program 1 times [2025-03-17 13:54:26,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:26,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373282896] [2025-03-17 13:54:26,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:26,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:54:26,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:54:26,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:26,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:26,538 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-17 13:54:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373282896] [2025-03-17 13:54:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373282896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:26,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:26,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:54:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450746426] [2025-03-17 13:54:26,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:26,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:26,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:26,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:26,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:26,540 INFO L87 Difference]: Start difference. First operand 2870 states and 3594 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:27,959 INFO L93 Difference]: Finished difference Result 4035 states and 5063 transitions. [2025-03-17 13:54:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:27,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 13:54:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:27,972 INFO L225 Difference]: With dead ends: 4035 [2025-03-17 13:54:27,973 INFO L226 Difference]: Without dead ends: 4035 [2025-03-17 13:54:27,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:27,974 INFO L435 NwaCegarLoop]: 2612 mSDtfsCounter, 1463 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 4590 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:27,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 4590 Invalid, 1581 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 13:54:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4035 states. [2025-03-17 13:54:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4035 to 3707. [2025-03-17 13:54:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 2735 states have (on average 1.8372943327239488) internal successors, (5025), 3688 states have internal predecessors, (5025), 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-17 13:54:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 5063 transitions. [2025-03-17 13:54:28,056 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 5063 transitions. Word has length 2 [2025-03-17 13:54:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:28,056 INFO L471 AbstractCegarLoop]: Abstraction has 3707 states and 5063 transitions. [2025-03-17 13:54:28,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 5063 transitions. [2025-03-17 13:54:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 13:54:28,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:28,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 13:54:28,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:54:28,057 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-17 13:54:28,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:28,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1995533125, now seen corresponding path program 1 times [2025-03-17 13:54:28,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:28,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180980161] [2025-03-17 13:54:28,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:28,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:28,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 13:54:28,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 13:54:28,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:28,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:28,233 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-17 13:54:28,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:28,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180980161] [2025-03-17 13:54:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180980161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:28,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:28,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:54:28,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266360203] [2025-03-17 13:54:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:28,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:54:28,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:28,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:54:28,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:54:28,234 INFO L87 Difference]: Start difference. First operand 3707 states and 5063 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:31,638 INFO L93 Difference]: Finished difference Result 6951 states and 8531 transitions. [2025-03-17 13:54:31,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:54:31,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 13:54:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:31,657 INFO L225 Difference]: With dead ends: 6951 [2025-03-17 13:54:31,658 INFO L226 Difference]: Without dead ends: 6951 [2025-03-17 13:54:31,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:54:31,660 INFO L435 NwaCegarLoop]: 2422 mSDtfsCounter, 7752 mSDsluCounter, 3928 mSDsCounter, 0 mSdLazyCounter, 4954 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7755 SdHoareTripleChecker+Valid, 6350 SdHoareTripleChecker+Invalid, 5004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 4954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:31,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7755 Valid, 6350 Invalid, 5004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4954 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 13:54:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6951 states. [2025-03-17 13:54:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6951 to 4714. [2025-03-17 13:54:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4714 states, 3742 states have (on average 1.869588455371459) internal successors, (6996), 4689 states have internal predecessors, (6996), 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-17 13:54:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 7046 transitions. [2025-03-17 13:54:31,754 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 7046 transitions. Word has length 6 [2025-03-17 13:54:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:31,754 INFO L471 AbstractCegarLoop]: Abstraction has 4714 states and 7046 transitions. [2025-03-17 13:54:31,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 7046 transitions. [2025-03-17 13:54:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 13:54:31,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:31,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:31,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:54:31,755 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-17 13:54:31,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1731981424, now seen corresponding path program 1 times [2025-03-17 13:54:31,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:31,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753366849] [2025-03-17 13:54:31,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:31,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 13:54:31,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 13:54:31,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:31,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:31,829 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-17 13:54:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:31,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753366849] [2025-03-17 13:54:31,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753366849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:31,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:31,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:54:31,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062092750] [2025-03-17 13:54:31,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:31,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:31,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:31,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:31,830 INFO L87 Difference]: Start difference. First operand 4714 states and 7046 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-17 13:54:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:32,947 INFO L93 Difference]: Finished difference Result 5790 states and 8304 transitions. [2025-03-17 13:54:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:32,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-17 13:54:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:32,960 INFO L225 Difference]: With dead ends: 5790 [2025-03-17 13:54:32,960 INFO L226 Difference]: Without dead ends: 5790 [2025-03-17 13:54:32,960 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-17 13:54:32,961 INFO L435 NwaCegarLoop]: 3309 mSDtfsCounter, 2826 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2836 SdHoareTripleChecker+Valid, 4394 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:32,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2836 Valid, 4394 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:54:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5790 states. [2025-03-17 13:54:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5790 to 4622. [2025-03-17 13:54:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4622 states, 3742 states have (on average 1.8121325494388028) internal successors, (6781), 4597 states have internal predecessors, (6781), 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-17 13:54:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4622 states to 4622 states and 6831 transitions. [2025-03-17 13:54:33,015 INFO L78 Accepts]: Start accepts. Automaton has 4622 states and 6831 transitions. Word has length 7 [2025-03-17 13:54:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:33,016 INFO L471 AbstractCegarLoop]: Abstraction has 4622 states and 6831 transitions. [2025-03-17 13:54:33,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-17 13:54:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4622 states and 6831 transitions. [2025-03-17 13:54:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 13:54:33,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:33,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:33,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:54:33,016 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-17 13:54:33,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:33,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1731981423, now seen corresponding path program 1 times [2025-03-17 13:54:33,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:33,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506328057] [2025-03-17 13:54:33,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:33,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:33,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 13:54:33,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 13:54:33,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:33,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:33,084 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-17 13:54:33,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:33,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506328057] [2025-03-17 13:54:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506328057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:33,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:33,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:54:33,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779044679] [2025-03-17 13:54:33,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:33,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:33,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:33,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:33,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:33,085 INFO L87 Difference]: Start difference. First operand 4622 states and 6831 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-17 13:54:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:34,326 INFO L93 Difference]: Finished difference Result 7345 states and 10772 transitions. [2025-03-17 13:54:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:34,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-17 13:54:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:34,343 INFO L225 Difference]: With dead ends: 7345 [2025-03-17 13:54:34,343 INFO L226 Difference]: Without dead ends: 7345 [2025-03-17 13:54:34,343 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-17 13:54:34,344 INFO L435 NwaCegarLoop]: 3670 mSDtfsCounter, 2307 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 5334 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:34,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 5334 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 13:54:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7345 states. [2025-03-17 13:54:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7345 to 5154. [2025-03-17 13:54:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 4284 states have (on average 1.8032212885154062) internal successors, (7725), 5129 states have internal predecessors, (7725), 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-17 13:54:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 7775 transitions. [2025-03-17 13:54:34,406 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 7775 transitions. Word has length 7 [2025-03-17 13:54:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:34,406 INFO L471 AbstractCegarLoop]: Abstraction has 5154 states and 7775 transitions. [2025-03-17 13:54:34,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-17 13:54:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 7775 transitions. [2025-03-17 13:54:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 13:54:34,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:34,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:34,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 13:54:34,407 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-17 13:54:34,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash 373834743, now seen corresponding path program 1 times [2025-03-17 13:54:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:34,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902490015] [2025-03-17 13:54:34,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:34,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 13:54:34,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 13:54:34,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:34,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:34,476 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-17 13:54:34,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:34,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902490015] [2025-03-17 13:54:34,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902490015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:34,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:34,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:34,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530748706] [2025-03-17 13:54:34,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:34,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:34,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:34,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:34,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:34,477 INFO L87 Difference]: Start difference. First operand 5154 states and 7775 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:34,844 INFO L93 Difference]: Finished difference Result 7141 states and 10539 transitions. [2025-03-17 13:54:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:54:34,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 13:54:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:34,859 INFO L225 Difference]: With dead ends: 7141 [2025-03-17 13:54:34,859 INFO L226 Difference]: Without dead ends: 7141 [2025-03-17 13:54:34,859 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-17 13:54:34,860 INFO L435 NwaCegarLoop]: 3073 mSDtfsCounter, 1443 mSDsluCounter, 5786 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 8859 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-17 13:54:34,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 8859 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:54:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7141 states. [2025-03-17 13:54:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7141 to 5156. [2025-03-17 13:54:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 4286 states have (on average 1.80284647690154) internal successors, (7727), 5131 states have internal predecessors, (7727), 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-17 13:54:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 7777 transitions. [2025-03-17 13:54:34,961 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 7777 transitions. Word has length 9 [2025-03-17 13:54:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:34,961 INFO L471 AbstractCegarLoop]: Abstraction has 5156 states and 7777 transitions. [2025-03-17 13:54:34,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 7777 transitions. [2025-03-17 13:54:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 13:54:34,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:34,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:34,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:54:34,962 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-17 13:54:34,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash 367249261, now seen corresponding path program 1 times [2025-03-17 13:54:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:34,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539290233] [2025-03-17 13:54:34,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:34,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 13:54:34,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 13:54:34,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:34,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:54:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539290233] [2025-03-17 13:54:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539290233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:35,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:35,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:54:35,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446199301] [2025-03-17 13:54:35,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:35,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:35,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:35,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:35,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:35,030 INFO L87 Difference]: Start difference. First operand 5156 states and 7777 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:36,084 INFO L93 Difference]: Finished difference Result 5231 states and 7883 transitions. [2025-03-17 13:54:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:54:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 13:54:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:36,093 INFO L225 Difference]: With dead ends: 5231 [2025-03-17 13:54:36,093 INFO L226 Difference]: Without dead ends: 5231 [2025-03-17 13:54:36,094 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-17 13:54:36,094 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 3089 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 3666 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:36,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 3666 Invalid, 2270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:54:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5231 states. [2025-03-17 13:54:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5231 to 5133. [2025-03-17 13:54:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5133 states, 4286 states have (on average 1.7921138590760617) internal successors, (7681), 5108 states have internal predecessors, (7681), 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-17 13:54:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7731 transitions. [2025-03-17 13:54:36,176 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7731 transitions. Word has length 18 [2025-03-17 13:54:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:36,176 INFO L471 AbstractCegarLoop]: Abstraction has 5133 states and 7731 transitions. [2025-03-17 13:54:36,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-17 13:54:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7731 transitions. [2025-03-17 13:54:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 13:54:36,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:36,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:36,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:54:36,177 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-17 13:54:36,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash 367249262, now seen corresponding path program 1 times [2025-03-17 13:54:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:36,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251675280] [2025-03-17 13:54:36,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:36,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 13:54:36,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 13:54:36,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:36,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:36,247 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-17 13:54:36,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:36,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251675280] [2025-03-17 13:54:36,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251675280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:36,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:54:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523618714] [2025-03-17 13:54:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:36,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:36,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:36,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:36,248 INFO L87 Difference]: Start difference. First operand 5133 states and 7731 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:36,394 INFO L93 Difference]: Finished difference Result 4995 states and 7525 transitions. [2025-03-17 13:54:36,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:36,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 13:54:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:36,402 INFO L225 Difference]: With dead ends: 4995 [2025-03-17 13:54:36,402 INFO L226 Difference]: Without dead ends: 4995 [2025-03-17 13:54:36,403 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-17 13:54:36,403 INFO L435 NwaCegarLoop]: 2731 mSDtfsCounter, 60 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5409 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-17 13:54:36,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5409 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:54:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2025-03-17 13:54:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4995. [2025-03-17 13:54:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4995 states, 4160 states have (on average 1.796875) internal successors, (7475), 4970 states have internal predecessors, (7475), 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-17 13:54:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4995 states to 4995 states and 7525 transitions. [2025-03-17 13:54:36,456 INFO L78 Accepts]: Start accepts. Automaton has 4995 states and 7525 transitions. Word has length 18 [2025-03-17 13:54:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:36,456 INFO L471 AbstractCegarLoop]: Abstraction has 4995 states and 7525 transitions. [2025-03-17 13:54:36,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4995 states and 7525 transitions. [2025-03-17 13:54:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 13:54:36,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:36,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:36,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 13:54:36,458 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-17 13:54:36,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash 342714414, now seen corresponding path program 1 times [2025-03-17 13:54:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:36,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153903490] [2025-03-17 13:54:36,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:36,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 13:54:36,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 13:54:36,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:36,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:36,546 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-17 13:54:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153903490] [2025-03-17 13:54:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153903490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291756897] [2025-03-17 13:54:36,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:36,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:36,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:36,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:36,548 INFO L87 Difference]: Start difference. First operand 4995 states and 7525 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:36,879 INFO L93 Difference]: Finished difference Result 6882 states and 10160 transitions. [2025-03-17 13:54:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:54:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 13:54:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:36,890 INFO L225 Difference]: With dead ends: 6882 [2025-03-17 13:54:36,890 INFO L226 Difference]: Without dead ends: 6882 [2025-03-17 13:54:36,890 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-17 13:54:36,890 INFO L435 NwaCegarLoop]: 3008 mSDtfsCounter, 1306 mSDsluCounter, 5605 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 8613 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:36,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 8613 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:54:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2025-03-17 13:54:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 5005. [2025-03-17 13:54:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5005 states, 4170 states have (on average 1.7949640287769784) internal successors, (7485), 4980 states have internal predecessors, (7485), 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-17 13:54:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 7535 transitions. [2025-03-17 13:54:36,963 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 7535 transitions. Word has length 18 [2025-03-17 13:54:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:36,963 INFO L471 AbstractCegarLoop]: Abstraction has 5005 states and 7535 transitions. [2025-03-17 13:54:36,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 7535 transitions. [2025-03-17 13:54:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 13:54:36,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:36,964 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-17 13:54:36,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:54:36,964 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-17 13:54:36,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1500296572, now seen corresponding path program 1 times [2025-03-17 13:54:36,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:36,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510725470] [2025-03-17 13:54:36,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:36,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:36,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 13:54:36,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 13:54:36,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:36,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:37,027 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-17 13:54:37,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510725470] [2025-03-17 13:54:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510725470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:37,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:37,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017576796] [2025-03-17 13:54:37,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:37,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:37,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:37,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:37,028 INFO L87 Difference]: Start difference. First operand 5005 states and 7535 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-17 13:54:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:37,266 INFO L93 Difference]: Finished difference Result 4982 states and 7491 transitions. [2025-03-17 13:54:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:54:37,266 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-17 13:54:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:37,276 INFO L225 Difference]: With dead ends: 4982 [2025-03-17 13:54:37,277 INFO L226 Difference]: Without dead ends: 4982 [2025-03-17 13:54:37,277 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-17 13:54:37,277 INFO L435 NwaCegarLoop]: 2693 mSDtfsCounter, 45 mSDsluCounter, 5363 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8056 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-17 13:54:37,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8056 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:54:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4982 states. [2025-03-17 13:54:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4982 to 4982. [2025-03-17 13:54:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4982 states, 4154 states have (on average 1.7912855079441503) internal successors, (7441), 4957 states have internal predecessors, (7441), 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-17 13:54:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 7491 transitions. [2025-03-17 13:54:37,339 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 7491 transitions. Word has length 19 [2025-03-17 13:54:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:37,340 INFO L471 AbstractCegarLoop]: Abstraction has 4982 states and 7491 transitions. [2025-03-17 13:54:37,340 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-17 13:54:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 7491 transitions. [2025-03-17 13:54:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 13:54:37,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:37,341 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] [2025-03-17 13:54:37,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:54:37,341 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-17 13:54:37,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:37,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2100953158, now seen corresponding path program 1 times [2025-03-17 13:54:37,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:37,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778072786] [2025-03-17 13:54:37,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:37,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:37,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 13:54:37,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 13:54:37,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:37,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:37,470 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-17 13:54:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:37,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778072786] [2025-03-17 13:54:37,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778072786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:37,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:37,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:54:37,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918725286] [2025-03-17 13:54:37,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:37,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:37,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:37,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:37,473 INFO L87 Difference]: Start difference. First operand 4982 states and 7491 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-17 13:54:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:39,029 INFO L93 Difference]: Finished difference Result 7267 states and 10632 transitions. [2025-03-17 13:54:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:54:39,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2025-03-17 13:54:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:39,042 INFO L225 Difference]: With dead ends: 7267 [2025-03-17 13:54:39,044 INFO L226 Difference]: Without dead ends: 7267 [2025-03-17 13:54:39,044 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-17 13:54:39,045 INFO L435 NwaCegarLoop]: 2162 mSDtfsCounter, 2307 mSDsluCounter, 3411 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 5573 SdHoareTripleChecker+Invalid, 2705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:39,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 5573 Invalid, 2705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 13:54:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7267 states. [2025-03-17 13:54:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7267 to 4978. [2025-03-17 13:54:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4978 states, 4154 states have (on average 1.7893596533461724) internal successors, (7433), 4953 states have internal predecessors, (7433), 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-17 13:54:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 7483 transitions. [2025-03-17 13:54:39,106 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 7483 transitions. Word has length 33 [2025-03-17 13:54:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:39,107 INFO L471 AbstractCegarLoop]: Abstraction has 4978 states and 7483 transitions. [2025-03-17 13:54:39,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-17 13:54:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 7483 transitions. [2025-03-17 13:54:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 13:54:39,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:39,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:39,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:54:39,111 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-17 13:54:39,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash -853719889, now seen corresponding path program 1 times [2025-03-17 13:54:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:39,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595246858] [2025-03-17 13:54:39,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:39,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:39,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 13:54:39,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 13:54:39,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:39,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:39,214 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-17 13:54:39,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:39,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595246858] [2025-03-17 13:54:39,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595246858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:39,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:39,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461776353] [2025-03-17 13:54:39,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:39,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:39,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:39,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:39,216 INFO L87 Difference]: Start difference. First operand 4978 states and 7483 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-17 13:54:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:39,442 INFO L93 Difference]: Finished difference Result 4966 states and 7463 transitions. [2025-03-17 13:54:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:54:39,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2025-03-17 13:54:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:39,450 INFO L225 Difference]: With dead ends: 4966 [2025-03-17 13:54:39,450 INFO L226 Difference]: Without dead ends: 4966 [2025-03-17 13:54:39,451 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-17 13:54:39,452 INFO L435 NwaCegarLoop]: 2691 mSDtfsCounter, 21 mSDsluCounter, 5351 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8042 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-17 13:54:39,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8042 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:54:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4966 states. [2025-03-17 13:54:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4966 to 4966. [2025-03-17 13:54:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4966 states, 4142 states have (on average 1.7897151134717528) internal successors, (7413), 4941 states have internal predecessors, (7413), 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-17 13:54:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4966 states to 4966 states and 7463 transitions. [2025-03-17 13:54:39,497 INFO L78 Accepts]: Start accepts. Automaton has 4966 states and 7463 transitions. Word has length 67 [2025-03-17 13:54:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:39,497 INFO L471 AbstractCegarLoop]: Abstraction has 4966 states and 7463 transitions. [2025-03-17 13:54:39,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-17 13:54:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4966 states and 7463 transitions. [2025-03-17 13:54:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 13:54:39,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:39,501 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] [2025-03-17 13:54:39,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:54:39,501 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-17 13:54:39,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1116259209, now seen corresponding path program 1 times [2025-03-17 13:54:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:39,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802507489] [2025-03-17 13:54:39,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:39,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 13:54:39,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 13:54:39,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:39,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:39,610 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-17 13:54:39,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:39,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802507489] [2025-03-17 13:54:39,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802507489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:39,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:39,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:54:39,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577912910] [2025-03-17 13:54:39,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:39,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:39,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:39,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:39,613 INFO L87 Difference]: Start difference. First operand 4966 states and 7463 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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-17 13:54:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:39,852 INFO L93 Difference]: Finished difference Result 6456 states and 9628 transitions. [2025-03-17 13:54:39,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:39,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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 75 [2025-03-17 13:54:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:39,863 INFO L225 Difference]: With dead ends: 6456 [2025-03-17 13:54:39,863 INFO L226 Difference]: Without dead ends: 6456 [2025-03-17 13:54:39,863 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-17 13:54:39,864 INFO L435 NwaCegarLoop]: 2706 mSDtfsCounter, 1077 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 5349 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-17 13:54:39,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 5349 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:54:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6456 states. [2025-03-17 13:54:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6456 to 5809. [2025-03-17 13:54:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5809 states, 4981 states have (on average 1.7709295322224452) internal successors, (8821), 5780 states have internal predecessors, (8821), 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-17 13:54:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5809 states to 5809 states and 8879 transitions. [2025-03-17 13:54:39,925 INFO L78 Accepts]: Start accepts. Automaton has 5809 states and 8879 transitions. Word has length 75 [2025-03-17 13:54:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:39,926 INFO L471 AbstractCegarLoop]: Abstraction has 5809 states and 8879 transitions. [2025-03-17 13:54:39,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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-17 13:54:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 5809 states and 8879 transitions. [2025-03-17 13:54:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 13:54:39,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:39,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:39,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:54:39,928 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-17 13:54:39,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1454292132, now seen corresponding path program 1 times [2025-03-17 13:54:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:39,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350017430] [2025-03-17 13:54:39,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:39,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:39,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 13:54:39,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 13:54:39,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:39,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:54:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350017430] [2025-03-17 13:54:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350017430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:40,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:54:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397375545] [2025-03-17 13:54:40,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:40,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:54:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:40,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:54:40,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:54:40,345 INFO L87 Difference]: Start difference. First operand 5809 states and 8879 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:42,141 INFO L93 Difference]: Finished difference Result 5725 states and 8680 transitions. [2025-03-17 13:54:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:54:42,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-17 13:54:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:42,149 INFO L225 Difference]: With dead ends: 5725 [2025-03-17 13:54:42,149 INFO L226 Difference]: Without dead ends: 5725 [2025-03-17 13:54:42,149 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-17 13:54:42,150 INFO L435 NwaCegarLoop]: 1423 mSDtfsCounter, 2625 mSDsluCounter, 2801 mSDsCounter, 0 mSdLazyCounter, 4017 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2635 SdHoareTripleChecker+Valid, 4224 SdHoareTripleChecker+Invalid, 4110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:42,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2635 Valid, 4224 Invalid, 4110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4017 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 13:54:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5725 states. [2025-03-17 13:54:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5725 to 5183. [2025-03-17 13:54:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 4439 states have (on average 1.7251633250732148) internal successors, (7658), 5154 states have internal predecessors, (7658), 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-17 13:54:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 7716 transitions. [2025-03-17 13:54:42,195 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 7716 transitions. Word has length 78 [2025-03-17 13:54:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:42,196 INFO L471 AbstractCegarLoop]: Abstraction has 5183 states and 7716 transitions. [2025-03-17 13:54:42,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 7716 transitions. [2025-03-17 13:54:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 13:54:42,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:42,198 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] [2025-03-17 13:54:42,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:54:42,198 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-17 13:54:42,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:42,200 INFO L85 PathProgramCache]: Analyzing trace with hash 860061058, now seen corresponding path program 1 times [2025-03-17 13:54:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:42,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821203187] [2025-03-17 13:54:42,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:42,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:42,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:54:42,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:54:42,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:42,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:42,406 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-17 13:54:42,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821203187] [2025-03-17 13:54:42,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821203187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:42,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:42,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:42,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829754066] [2025-03-17 13:54:42,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:42,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:54:42,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:42,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:54:42,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:54:42,408 INFO L87 Difference]: Start difference. First operand 5183 states and 7716 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-17 13:54:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:43,766 INFO L93 Difference]: Finished difference Result 5182 states and 7714 transitions. [2025-03-17 13:54:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:54:43,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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 83 [2025-03-17 13:54:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:43,778 INFO L225 Difference]: With dead ends: 5182 [2025-03-17 13:54:43,778 INFO L226 Difference]: Without dead ends: 5182 [2025-03-17 13:54:43,778 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-17 13:54:43,779 INFO L435 NwaCegarLoop]: 2617 mSDtfsCounter, 2 mSDsluCounter, 5369 mSDsCounter, 0 mSdLazyCounter, 2933 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7986 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:43,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7986 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2933 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 13:54:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2025-03-17 13:54:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 5182. [2025-03-17 13:54:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 4439 states have (on average 1.7247127731471052) internal successors, (7656), 5153 states have internal predecessors, (7656), 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-17 13:54:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 7714 transitions. [2025-03-17 13:54:43,825 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 7714 transitions. Word has length 83 [2025-03-17 13:54:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:43,826 INFO L471 AbstractCegarLoop]: Abstraction has 5182 states and 7714 transitions. [2025-03-17 13:54:43,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-17 13:54:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 7714 transitions. [2025-03-17 13:54:43,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 13:54:43,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:43,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:43,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:54:43,826 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-17 13:54:43,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:43,827 INFO L85 PathProgramCache]: Analyzing trace with hash 860061059, now seen corresponding path program 1 times [2025-03-17 13:54:43,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:43,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842879551] [2025-03-17 13:54:43,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:43,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:43,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:54:43,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:54:43,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:43,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:54:44,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:44,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842879551] [2025-03-17 13:54:44,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842879551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:44,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:44,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:44,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337221234] [2025-03-17 13:54:44,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:44,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:54:44,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:44,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:54:44,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:54:44,165 INFO L87 Difference]: Start difference. First operand 5182 states and 7714 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-17 13:54:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:45,754 INFO L93 Difference]: Finished difference Result 5181 states and 7712 transitions. [2025-03-17 13:54:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:54:45,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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 83 [2025-03-17 13:54:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:45,760 INFO L225 Difference]: With dead ends: 5181 [2025-03-17 13:54:45,761 INFO L226 Difference]: Without dead ends: 5181 [2025-03-17 13:54:45,761 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-17 13:54:45,761 INFO L435 NwaCegarLoop]: 2617 mSDtfsCounter, 1 mSDsluCounter, 5343 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7960 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:45,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7960 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 13:54:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5181 states. [2025-03-17 13:54:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5181 to 5181. [2025-03-17 13:54:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 4437 states have (on average 1.725039441063782) internal successors, (7654), 5152 states have internal predecessors, (7654), 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-17 13:54:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 7712 transitions. [2025-03-17 13:54:45,823 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 7712 transitions. Word has length 83 [2025-03-17 13:54:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:45,824 INFO L471 AbstractCegarLoop]: Abstraction has 5181 states and 7712 transitions. [2025-03-17 13:54:45,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-17 13:54:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 7712 transitions. [2025-03-17 13:54:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 13:54:45,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:45,825 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] [2025-03-17 13:54:45,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 13:54:45,825 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-17 13:54:45,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash -334810497, now seen corresponding path program 1 times [2025-03-17 13:54:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:45,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445921084] [2025-03-17 13:54:45,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:45,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 13:54:45,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 13:54:45,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:45,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:46,012 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-17 13:54:46,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:46,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445921084] [2025-03-17 13:54:46,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445921084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:46,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:46,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:54:46,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46488071] [2025-03-17 13:54:46,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:46,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:54:46,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:46,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:54:46,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:54:46,014 INFO L87 Difference]: Start difference. First operand 5181 states and 7712 transitions. Second operand has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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-17 13:54:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:47,651 INFO L93 Difference]: Finished difference Result 5199 states and 7747 transitions. [2025-03-17 13:54:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:54:47,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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 91 [2025-03-17 13:54:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:47,661 INFO L225 Difference]: With dead ends: 5199 [2025-03-17 13:54:47,661 INFO L226 Difference]: Without dead ends: 5199 [2025-03-17 13:54:47,661 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-17 13:54:47,662 INFO L435 NwaCegarLoop]: 2581 mSDtfsCounter, 27 mSDsluCounter, 8168 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10749 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:47,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10749 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 13:54:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2025-03-17 13:54:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 5190. [2025-03-17 13:54:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4445 states have (on average 1.7244094488188977) internal successors, (7665), 5159 states have internal predecessors, (7665), 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-17 13:54:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7737 transitions. [2025-03-17 13:54:47,710 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7737 transitions. Word has length 91 [2025-03-17 13:54:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:47,711 INFO L471 AbstractCegarLoop]: Abstraction has 5190 states and 7737 transitions. [2025-03-17 13:54:47,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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-17 13:54:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7737 transitions. [2025-03-17 13:54:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 13:54:47,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:47,711 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] [2025-03-17 13:54:47,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 13:54:47,712 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-17 13:54:47,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash -334810496, now seen corresponding path program 1 times [2025-03-17 13:54:47,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:47,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448514999] [2025-03-17 13:54:47,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:47,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 13:54:47,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 13:54:47,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:47,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:48,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-17 13:54:48,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:48,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448514999] [2025-03-17 13:54:48,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448514999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:48,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:48,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:54:48,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439510037] [2025-03-17 13:54:48,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:48,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:54:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:48,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:54:48,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:54:48,041 INFO L87 Difference]: Start difference. First operand 5190 states and 7737 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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-17 13:54:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:49,735 INFO L93 Difference]: Finished difference Result 5190 states and 7735 transitions. [2025-03-17 13:54:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:54:49,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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 91 [2025-03-17 13:54:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:49,746 INFO L225 Difference]: With dead ends: 5190 [2025-03-17 13:54:49,746 INFO L226 Difference]: Without dead ends: 5190 [2025-03-17 13:54:49,746 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-17 13:54:49,746 INFO L435 NwaCegarLoop]: 2588 mSDtfsCounter, 22 mSDsluCounter, 7580 mSDsCounter, 0 mSdLazyCounter, 3444 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10168 SdHoareTripleChecker+Invalid, 3453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:49,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10168 Invalid, 3453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3444 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 13:54:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2025-03-17 13:54:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2025-03-17 13:54:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4445 states have (on average 1.7239595050618672) internal successors, (7663), 5159 states have internal predecessors, (7663), 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-17 13:54:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7735 transitions. [2025-03-17 13:54:49,803 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7735 transitions. Word has length 91 [2025-03-17 13:54:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:49,803 INFO L471 AbstractCegarLoop]: Abstraction has 5190 states and 7735 transitions. [2025-03-17 13:54:49,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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-17 13:54:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7735 transitions. [2025-03-17 13:54:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:54:49,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:49,805 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-17 13:54:49,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:54:49,805 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-17 13:54:49,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1581155524, now seen corresponding path program 1 times [2025-03-17 13:54:49,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:49,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637851754] [2025-03-17 13:54:49,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:49,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:49,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:54:49,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:54:49,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:49,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:50,156 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-17 13:54:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637851754] [2025-03-17 13:54:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637851754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:54:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294085639] [2025-03-17 13:54:50,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:50,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:54:50,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:54:50,159 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-17 13:54:50,161 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-17 13:54:50,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:54:50,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:54:50,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:50,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:50,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 13:54:50,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:54:50,399 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-17 13:54:50,509 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:54:50,509 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-17 13:54:50,544 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-17 13:54:50,614 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-17 13:54:50,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:54:50,768 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-17 13:54:50,812 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-17 13:54:50,837 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-17 13:54:50,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:54:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294085639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:54:50,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:54:50,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-03-17 13:54:50,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91873960] [2025-03-17 13:54:50,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:54:50,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 13:54:50,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:50,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 13:54:50,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=317, Unknown=7, NotChecked=0, Total=380 [2025-03-17 13:54:50,886 INFO L87 Difference]: Start difference. First operand 5190 states and 7735 transitions. Second operand has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 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-17 13:54:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:55,738 INFO L93 Difference]: Finished difference Result 5197 states and 7741 transitions. [2025-03-17 13:54:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:54:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 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 92 [2025-03-17 13:54:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:55,744 INFO L225 Difference]: With dead ends: 5197 [2025-03-17 13:54:55,744 INFO L226 Difference]: Without dead ends: 5197 [2025-03-17 13:54:55,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=460, Unknown=9, NotChecked=0, Total=552 [2025-03-17 13:54:55,745 INFO L435 NwaCegarLoop]: 1765 mSDtfsCounter, 2634 mSDsluCounter, 19171 mSDsCounter, 0 mSdLazyCounter, 11804 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 20936 SdHoareTripleChecker+Invalid, 11829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 11804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:55,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2652 Valid, 20936 Invalid, 11829 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 11804 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 13:54:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2025-03-17 13:54:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 5194. [2025-03-17 13:54:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5194 states, 4449 states have (on average 1.7230838390649583) internal successors, (7666), 5162 states have internal predecessors, (7666), 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-17 13:54:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 7726 transitions. [2025-03-17 13:54:55,793 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 7726 transitions. Word has length 92 [2025-03-17 13:54:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:55,794 INFO L471 AbstractCegarLoop]: Abstraction has 5194 states and 7726 transitions. [2025-03-17 13:54:55,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 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-17 13:54:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 7726 transitions. [2025-03-17 13:54:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:54:55,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:55,794 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-17 13:54:55,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 13:54:55,999 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-17 13:54:55,999 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-17 13:54:56,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1581155523, now seen corresponding path program 1 times [2025-03-17 13:54:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:56,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003832060] [2025-03-17 13:54:56,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:56,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:56,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:54:56,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:54:56,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:56,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:56,522 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-17 13:54:56,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003832060] [2025-03-17 13:54:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003832060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:54:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156448823] [2025-03-17 13:54:56,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:56,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:54:56,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:54:56,525 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-17 13:54:56,526 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-17 13:54:56,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:54:56,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:54:56,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:56,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:56,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 13:54:56,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:54:56,769 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-17 13:54:56,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 13:54:56,911 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:54:56,912 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-17 13:54:56,926 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-17 13:54:56,930 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-17 13:54:57,005 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-17 13:54:57,008 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-17 13:54:57,132 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:54:57,132 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-17 13:54:57,138 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-17 13:54:57,156 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-17 13:54:57,166 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-17 13:54:57,179 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-17 13:54:57,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:54:57,256 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-17 13:54:57,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156448823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:54:57,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:54:57,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-17 13:54:57,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274079501] [2025-03-17 13:54:57,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:54:57,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:54:57,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:57,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:54:57,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-17 13:54:57,260 INFO L87 Difference]: Start difference. First operand 5194 states and 7726 transitions. Second operand has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 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-17 13:55:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:00,244 INFO L93 Difference]: Finished difference Result 5196 states and 7739 transitions. [2025-03-17 13:55:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:55:00,244 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 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 92 [2025-03-17 13:55:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:00,252 INFO L225 Difference]: With dead ends: 5196 [2025-03-17 13:55:00,252 INFO L226 Difference]: Without dead ends: 5196 [2025-03-17 13:55:00,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 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-17 13:55:00,253 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 2635 mSDsluCounter, 9382 mSDsCounter, 0 mSdLazyCounter, 7986 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2653 SdHoareTripleChecker+Valid, 11153 SdHoareTripleChecker+Invalid, 8011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:00,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2653 Valid, 11153 Invalid, 8011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7986 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-17 13:55:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5196 states. [2025-03-17 13:55:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5196 to 5184. [2025-03-17 13:55:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4441 states have (on average 1.7237108759288449) internal successors, (7655), 5154 states have internal predecessors, (7655), 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-17 13:55:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 7713 transitions. [2025-03-17 13:55:00,298 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 7713 transitions. Word has length 92 [2025-03-17 13:55:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:00,298 INFO L471 AbstractCegarLoop]: Abstraction has 5184 states and 7713 transitions. [2025-03-17 13:55:00,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 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-17 13:55:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 7713 transitions. [2025-03-17 13:55:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 13:55:00,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:00,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:00,306 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-17 13:55:00,503 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-17 13:55:00,503 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-17 13:55:00,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:00,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1422540459, now seen corresponding path program 1 times [2025-03-17 13:55:00,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:00,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897330728] [2025-03-17 13:55:00,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:00,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:00,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 13:55:00,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 13:55:00,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:00,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:00,829 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-17 13:55:00,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:00,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897330728] [2025-03-17 13:55:00,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897330728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:00,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:00,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 13:55:00,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955263336] [2025-03-17 13:55:00,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:00,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:55:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:00,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:55:00,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:55:00,832 INFO L87 Difference]: Start difference. First operand 5184 states and 7713 transitions. Second operand has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:55:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:03,203 INFO L93 Difference]: Finished difference Result 5203 states and 7747 transitions. [2025-03-17 13:55:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:55:03,207 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-03-17 13:55:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:03,213 INFO L225 Difference]: With dead ends: 5203 [2025-03-17 13:55:03,214 INFO L226 Difference]: Without dead ends: 5203 [2025-03-17 13:55:03,214 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-17 13:55:03,216 INFO L435 NwaCegarLoop]: 1765 mSDtfsCounter, 2672 mSDsluCounter, 10472 mSDsCounter, 0 mSdLazyCounter, 6908 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2690 SdHoareTripleChecker+Valid, 12237 SdHoareTripleChecker+Invalid, 6932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:03,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2690 Valid, 12237 Invalid, 6932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6908 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 13:55:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5203 states. [2025-03-17 13:55:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5203 to 5199. [2025-03-17 13:55:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5199 states, 4455 states have (on average 1.7221099887766556) internal successors, (7672), 5167 states have internal predecessors, (7672), 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-17 13:55:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 7732 transitions. [2025-03-17 13:55:03,260 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 7732 transitions. Word has length 94 [2025-03-17 13:55:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:03,260 INFO L471 AbstractCegarLoop]: Abstraction has 5199 states and 7732 transitions. [2025-03-17 13:55:03,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:55:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 7732 transitions. [2025-03-17 13:55:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 13:55:03,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:03,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:03,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 13:55:03,261 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-17 13:55:03,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1422540458, now seen corresponding path program 1 times [2025-03-17 13:55:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925459907] [2025-03-17 13:55:03,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:03,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 13:55:03,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 13:55:03,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:03,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:03,806 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-17 13:55:03,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:03,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925459907] [2025-03-17 13:55:03,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925459907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:03,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:03,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 13:55:03,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688452267] [2025-03-17 13:55:03,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:03,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:55:03,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:03,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:55:03,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:55:03,808 INFO L87 Difference]: Start difference. First operand 5199 states and 7732 transitions. Second operand has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:55:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:07,437 INFO L93 Difference]: Finished difference Result 5202 states and 7745 transitions. [2025-03-17 13:55:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:55:07,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-03-17 13:55:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:07,445 INFO L225 Difference]: With dead ends: 5202 [2025-03-17 13:55:07,446 INFO L226 Difference]: Without dead ends: 5202 [2025-03-17 13:55:07,446 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-17 13:55:07,447 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 2664 mSDsluCounter, 10388 mSDsCounter, 0 mSdLazyCounter, 9660 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 12160 SdHoareTripleChecker+Invalid, 9682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:07,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 12160 Invalid, 9682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 9660 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-17 13:55:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2025-03-17 13:55:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 5199. [2025-03-17 13:55:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5199 states, 4455 states have (on average 1.7216610549943883) internal successors, (7670), 5167 states have internal predecessors, (7670), 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-17 13:55:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 7730 transitions. [2025-03-17 13:55:07,505 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 7730 transitions. Word has length 94 [2025-03-17 13:55:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:07,506 INFO L471 AbstractCegarLoop]: Abstraction has 5199 states and 7730 transitions. [2025-03-17 13:55:07,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:55:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 7730 transitions. [2025-03-17 13:55:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:55:07,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:07,507 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-17 13:55:07,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 13:55:07,508 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-17 13:55:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1294965896, now seen corresponding path program 1 times [2025-03-17 13:55:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350005111] [2025-03-17 13:55:07,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:07,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:07,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:55:07,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:55:07,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:07,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:07,908 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-17 13:55:07,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:07,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350005111] [2025-03-17 13:55:07,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350005111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:07,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346867245] [2025-03-17 13:55:07,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:07,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:07,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:07,911 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-17 13:55:07,913 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-17 13:55:08,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:55:08,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:55:08,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:08,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:08,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 13:55:08,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:08,147 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-17 13:55:08,235 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:55:08,235 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-17 13:55:08,259 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-17 13:55:08,314 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-17 13:55:08,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:08,425 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-17 13:55:08,498 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:08,498 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-17 13:55:08,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 31 treesize of output 13 [2025-03-17 13:55:08,549 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-17 13:55:08,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:08,583 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-17 13:55:08,603 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-17 13:55:08,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346867245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:08,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:08,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-17 13:55:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209084422] [2025-03-17 13:55:08,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:08,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 13:55:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:08,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 13:55:08,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=419, Unknown=17, NotChecked=86, Total=600 [2025-03-17 13:55:08,606 INFO L87 Difference]: Start difference. First operand 5199 states and 7730 transitions. Second operand has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 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-17 13:55:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:14,762 INFO L93 Difference]: Finished difference Result 5201 states and 7743 transitions. [2025-03-17 13:55:14,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:55:14,763 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-03-17 13:55:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:14,770 INFO L225 Difference]: With dead ends: 5201 [2025-03-17 13:55:14,771 INFO L226 Difference]: Without dead ends: 5201 [2025-03-17 13:55:14,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=541, Unknown=18, NotChecked=98, Total=756 [2025-03-17 13:55:14,773 INFO L435 NwaCegarLoop]: 1764 mSDtfsCounter, 2629 mSDsluCounter, 27840 mSDsCounter, 0 mSdLazyCounter, 16533 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2647 SdHoareTripleChecker+Valid, 29604 SdHoareTripleChecker+Invalid, 16556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 16533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:14,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2647 Valid, 29604 Invalid, 16556 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 16533 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-03-17 13:55:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2025-03-17 13:55:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 5198. [2025-03-17 13:55:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5198 states, 4455 states have (on average 1.7212121212121212) internal successors, (7668), 5166 states have internal predecessors, (7668), 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-17 13:55:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 7728 transitions. [2025-03-17 13:55:14,843 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 7728 transitions. Word has length 95 [2025-03-17 13:55:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:14,843 INFO L471 AbstractCegarLoop]: Abstraction has 5198 states and 7728 transitions. [2025-03-17 13:55:14,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 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-17 13:55:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 7728 transitions. [2025-03-17 13:55:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:55:14,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:14,843 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-17 13:55:14,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 13:55:15,044 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-17 13:55:15,044 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-17 13:55:15,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1294965895, now seen corresponding path program 1 times [2025-03-17 13:55:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902245551] [2025-03-17 13:55:15,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:15,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:55:15,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:55:15,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:15,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:15,528 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-17 13:55:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902245551] [2025-03-17 13:55:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902245551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465854276] [2025-03-17 13:55:15,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:15,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:15,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:15,531 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-17 13:55:15,532 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-17 13:55:15,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:55:15,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:55:15,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:15,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:15,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 13:55:15,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:15,754 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-17 13:55:15,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:15,861 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-17 13:55:15,867 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-17 13:55:15,872 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-17 13:55:15,876 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-17 13:55:15,926 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-17 13:55:15,929 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-17 13:55:16,011 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:16,012 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-17 13:55:16,019 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-17 13:55:16,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:16,067 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-17 13:55:16,071 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-17 13:55:16,089 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-17 13:55:16,093 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-17 13:55:16,099 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-17 13:55:16,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:16,146 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-17 13:55:16,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1250 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-03-17 13:55:16,195 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-17 13:55:16,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465854276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:16,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:16,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-03-17 13:55:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670321468] [2025-03-17 13:55:16,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:16,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 13:55:16,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:16,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 13:55:16,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2025-03-17 13:55:16,199 INFO L87 Difference]: Start difference. First operand 5198 states and 7728 transitions. Second operand has 17 states, 14 states have (on average 10.357142857142858) internal successors, (145), 17 states have internal predecessors, (145), 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-17 13:55:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:20,597 INFO L93 Difference]: Finished difference Result 5200 states and 7741 transitions. [2025-03-17 13:55:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:55:20,597 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.357142857142858) internal successors, (145), 17 states have internal predecessors, (145), 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 95 [2025-03-17 13:55:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:20,601 INFO L225 Difference]: With dead ends: 5200 [2025-03-17 13:55:20,601 INFO L226 Difference]: Without dead ends: 5200 [2025-03-17 13:55:20,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=459, Unknown=3, NotChecked=138, Total=702 [2025-03-17 13:55:20,602 INFO L435 NwaCegarLoop]: 1770 mSDtfsCounter, 2633 mSDsluCounter, 12464 mSDsCounter, 0 mSdLazyCounter, 10246 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 14234 SdHoareTripleChecker+Invalid, 10272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 10246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:20,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 14234 Invalid, 10272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 10246 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 13:55:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2025-03-17 13:55:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5182. [2025-03-17 13:55:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 4441 states have (on average 1.722810177887863) internal successors, (7651), 5152 states have internal predecessors, (7651), 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-17 13:55:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 7709 transitions. [2025-03-17 13:55:20,643 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 7709 transitions. Word has length 95 [2025-03-17 13:55:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:20,643 INFO L471 AbstractCegarLoop]: Abstraction has 5182 states and 7709 transitions. [2025-03-17 13:55:20,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.357142857142858) internal successors, (145), 17 states have internal predecessors, (145), 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-17 13:55:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 7709 transitions. [2025-03-17 13:55:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 13:55:20,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:20,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:20,651 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-17 13:55:20,844 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-17 13:55:20,844 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-17 13:55:20,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash -457597032, now seen corresponding path program 1 times [2025-03-17 13:55:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:20,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602727034] [2025-03-17 13:55:20,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:20,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:20,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 13:55:20,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 13:55:20,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:20,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:21,255 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-17 13:55:21,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:21,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602727034] [2025-03-17 13:55:21,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602727034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:21,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:21,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 13:55:21,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982706826] [2025-03-17 13:55:21,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:21,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:55:21,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:21,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:55:21,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:55:21,257 INFO L87 Difference]: Start difference. First operand 5182 states and 7709 transitions. Second operand has 15 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 14 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:55:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:24,790 INFO L93 Difference]: Finished difference Result 5207 states and 7749 transitions. [2025-03-17 13:55:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:55:24,790 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 14 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-03-17 13:55:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:24,796 INFO L225 Difference]: With dead ends: 5207 [2025-03-17 13:55:24,796 INFO L226 Difference]: Without dead ends: 5207 [2025-03-17 13:55:24,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-03-17 13:55:24,797 INFO L435 NwaCegarLoop]: 1764 mSDtfsCounter, 2652 mSDsluCounter, 15671 mSDsCounter, 0 mSdLazyCounter, 9818 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2670 SdHoareTripleChecker+Valid, 17435 SdHoareTripleChecker+Invalid, 9841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 9818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:24,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2670 Valid, 17435 Invalid, 9841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 9818 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-17 13:55:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2025-03-17 13:55:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 5203. [2025-03-17 13:55:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5203 states, 4461 states have (on average 1.7202420981842637) internal successors, (7674), 5171 states have internal predecessors, (7674), 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-17 13:55:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5203 states to 5203 states and 7734 transitions. [2025-03-17 13:55:24,841 INFO L78 Accepts]: Start accepts. Automaton has 5203 states and 7734 transitions. Word has length 97 [2025-03-17 13:55:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:24,841 INFO L471 AbstractCegarLoop]: Abstraction has 5203 states and 7734 transitions. [2025-03-17 13:55:24,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 14 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:55:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 5203 states and 7734 transitions. [2025-03-17 13:55:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 13:55:24,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:24,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:24,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 13:55:24,842 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-17 13:55:24,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash -457597031, now seen corresponding path program 1 times [2025-03-17 13:55:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70543108] [2025-03-17 13:55:24,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:24,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 13:55:24,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 13:55:24,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:24,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:25,293 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-17 13:55:25,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:25,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70543108] [2025-03-17 13:55:25,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70543108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:25,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:25,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 13:55:25,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015911292] [2025-03-17 13:55:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:25,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 13:55:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:25,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 13:55:25,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 13:55:25,296 INFO L87 Difference]: Start difference. First operand 5203 states and 7734 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:55:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:28,254 INFO L93 Difference]: Finished difference Result 5206 states and 7747 transitions. [2025-03-17 13:55:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 13:55:28,254 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-03-17 13:55:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:28,260 INFO L225 Difference]: With dead ends: 5206 [2025-03-17 13:55:28,260 INFO L226 Difference]: Without dead ends: 5206 [2025-03-17 13:55:28,260 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-17 13:55:28,261 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 2666 mSDsluCounter, 7635 mSDsCounter, 0 mSdLazyCounter, 6971 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2684 SdHoareTripleChecker+Valid, 9406 SdHoareTripleChecker+Invalid, 6993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:28,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2684 Valid, 9406 Invalid, 6993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 6971 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-17 13:55:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2025-03-17 13:55:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 5203. [2025-03-17 13:55:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5203 states, 4461 states have (on average 1.719793768213405) internal successors, (7672), 5171 states have internal predecessors, (7672), 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-17 13:55:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5203 states to 5203 states and 7732 transitions. [2025-03-17 13:55:28,309 INFO L78 Accepts]: Start accepts. Automaton has 5203 states and 7732 transitions. Word has length 97 [2025-03-17 13:55:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:28,309 INFO L471 AbstractCegarLoop]: Abstraction has 5203 states and 7732 transitions. [2025-03-17 13:55:28,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:55:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5203 states and 7732 transitions. [2025-03-17 13:55:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 13:55:28,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:28,312 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-17 13:55:28,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 13:55:28,312 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-17 13:55:28,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash -929847659, now seen corresponding path program 1 times [2025-03-17 13:55:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:28,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722395978] [2025-03-17 13:55:28,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:28,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:28,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 13:55:28,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 13:55:28,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:28,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:28,728 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-17 13:55:28,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:28,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722395978] [2025-03-17 13:55:28,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722395978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:28,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577804917] [2025-03-17 13:55:28,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:28,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:28,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:28,731 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-17 13:55:28,732 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-17 13:55:28,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 13:55:28,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 13:55:28,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:28,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:28,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 13:55:28,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:28,965 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-17 13:55:29,038 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:55:29,039 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-17 13:55:29,056 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-17 13:55:29,113 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-17 13:55:29,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:29,212 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-17 13:55:29,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:29,294 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-17 13:55:29,337 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:29,338 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-17 13:55:29,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 13:55:29,372 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-17 13:55:29,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:29,379 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-17 13:55:29,383 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:55:29,390 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-17 13:55:29,437 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-17 13:55:29,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577804917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:29,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:29,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-03-17 13:55:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674476437] [2025-03-17 13:55:29,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:29,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 13:55:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:29,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 13:55:29,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=511, Unknown=6, NotChecked=196, Total=812 [2025-03-17 13:55:29,439 INFO L87 Difference]: Start difference. First operand 5203 states and 7732 transitions. Second operand has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 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-17 13:55:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:34,923 INFO L93 Difference]: Finished difference Result 5205 states and 7745 transitions. [2025-03-17 13:55:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:55:34,924 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2025-03-17 13:55:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:34,928 INFO L225 Difference]: With dead ends: 5205 [2025-03-17 13:55:34,928 INFO L226 Difference]: Without dead ends: 5205 [2025-03-17 13:55:34,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=645, Unknown=6, NotChecked=220, Total=992 [2025-03-17 13:55:34,929 INFO L435 NwaCegarLoop]: 1763 mSDtfsCounter, 2620 mSDsluCounter, 24356 mSDsCounter, 0 mSdLazyCounter, 14738 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2638 SdHoareTripleChecker+Valid, 26119 SdHoareTripleChecker+Invalid, 14761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 14738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:34,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2638 Valid, 26119 Invalid, 14761 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 14738 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-17 13:55:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2025-03-17 13:55:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 5202. [2025-03-17 13:55:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5202 states, 4461 states have (on average 1.7193454382425466) internal successors, (7670), 5170 states have internal predecessors, (7670), 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-17 13:55:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 7730 transitions. [2025-03-17 13:55:34,968 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 7730 transitions. Word has length 98 [2025-03-17 13:55:34,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:34,968 INFO L471 AbstractCegarLoop]: Abstraction has 5202 states and 7730 transitions. [2025-03-17 13:55:34,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 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-17 13:55:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 7730 transitions. [2025-03-17 13:55:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 13:55:34,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:34,969 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-17 13:55:34,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 13:55:35,169 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-17 13:55:35,170 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-17 13:55:35,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash -929847658, now seen corresponding path program 1 times [2025-03-17 13:55:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664494717] [2025-03-17 13:55:35,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:35,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:35,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 13:55:35,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 13:55:35,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:35,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:35,732 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-17 13:55:35,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664494717] [2025-03-17 13:55:35,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664494717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727603701] [2025-03-17 13:55:35,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:35,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:35,735 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-17 13:55:35,738 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-17 13:55:35,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 13:55:35,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 13:55:35,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:35,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:35,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 13:55:35,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:35,958 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-17 13:55:36,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 13:55:36,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:36,028 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-17 13:55:36,046 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-17 13:55:36,052 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-17 13:55:36,105 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-17 13:55:36,109 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-17 13:55:36,172 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:36,172 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-17 13:55:36,183 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-17 13:55:36,230 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:36,230 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-17 13:55:36,235 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-17 13:55:36,279 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:36,280 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-17 13:55:36,283 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-17 13:55:36,321 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-17 13:55:36,325 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-17 13:55:36,344 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-17 13:55:36,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:36,598 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1730 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_1730))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1729 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_1729))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1730 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_1730))) (or (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1729 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_1729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))))))) is different from false [2025-03-17 13:55:36,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1730 (Array Int Int)) (v_ArrVal_1738 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1738))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1737) .cse5 v_ArrVal_1730))) (or (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1729 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1729))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))) (forall ((v_ArrVal_1730 (Array Int Int)) (v_ArrVal_1738 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1738))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1737) .cse8 v_ArrVal_1730))) (or (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1729 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))))))) is different from false [2025-03-17 13:55:36,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727603701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:36,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:36,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2025-03-17 13:55:36,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635813764] [2025-03-17 13:55:36,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:36,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 13:55:36,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:36,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 13:55:36,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=650, Unknown=12, NotChecked=106, Total=870 [2025-03-17 13:55:36,658 INFO L87 Difference]: Start difference. First operand 5202 states and 7730 transitions. Second operand has 23 states, 20 states have (on average 7.9) internal successors, (158), 23 states have internal predecessors, (158), 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)