./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-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_test4-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 b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:55:02,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:55:02,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 13:55:02,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:55:02,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:55:02,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:55:02,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:55:02,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:55:02,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:55:02,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:55:02,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:55:02,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:55:02,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:55:02,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:55:02,516 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:55:02,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:55:02,516 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:55:02,517 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:55:02,518 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:55:02,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:55:02,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:55:02,518 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 -> b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 [2025-03-17 13:55:02,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:55:02,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:55:02,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:55:02,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:55:02,738 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:55:02,740 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_test4-1.i [2025-03-17 13:55:03,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9652172ba/e2096c5a726c4922829211cc57e69d08/FLAG52eb27512 [2025-03-17 13:55:04,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:55:04,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2025-03-17 13:55:04,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9652172ba/e2096c5a726c4922829211cc57e69d08/FLAG52eb27512 [2025-03-17 13:55:04,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9652172ba/e2096c5a726c4922829211cc57e69d08 [2025-03-17 13:55:04,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:55:04,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:55:04,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:55:04,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:55:04,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:55:04,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:04,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5403b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04, skipping insertion in model container [2025-03-17 13:55:04,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:04,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:55:04,711 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:55:04,735 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:55:04,737 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:55:04,744 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:55:04,749 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:55:04,766 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:55:04,767 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:55:04,769 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:55:04,772 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:55:04,780 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:55:04,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:55:04,795 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:55:04,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:55:04,890 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:55:04,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04 WrapperNode [2025-03-17 13:55:04,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:55:04,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:55:04,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:55:04,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:55:04,897 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:55:04" (1/1) ... [2025-03-17 13:55:04,919 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:55:04" (1/1) ... [2025-03-17 13:55:04,964 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1557 [2025-03-17 13:55:04,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:55:04,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:55:04,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:55:04,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:55:04,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:04,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:04,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:05,066 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-03-17 13:55:05,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:05,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:05,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:05,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:05,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:05,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:05,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:55:05,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:55:05,124 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:55:05,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:55:05,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (1/1) ... [2025-03-17 13:55:05,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:55:05,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:05,150 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:55:05,152 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:55:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:55:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:55:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 13:55:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 13:55:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:55:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:55:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 13:55:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 13:55:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 13:55:05,172 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 13:55:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:55:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:55:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 13:55:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 13:55:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:55:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:55:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:55:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:55:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:55:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:55:05,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:55:05,365 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:55:05,368 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:55:07,220 INFO L? ?]: Removed 1502 outVars from TransFormulas that were not future-live. [2025-03-17 13:55:07,220 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:55:07,277 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:55:07,277 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 13:55:07,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:55:07 BoogieIcfgContainer [2025-03-17 13:55:07,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:55:07,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:55:07,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:55:07,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:55:07,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:55:04" (1/3) ... [2025-03-17 13:55:07,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3e6678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:55:07, skipping insertion in model container [2025-03-17 13:55:07,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:55:04" (2/3) ... [2025-03-17 13:55:07,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3e6678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:55:07, skipping insertion in model container [2025-03-17 13:55:07,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:55:07" (3/3) ... [2025-03-17 13:55:07,288 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-1.i [2025-03-17 13:55:07,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:55:07,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test4-1.i that has 4 procedures, 1447 locations, 1 initial locations, 34 loop locations, and 628 error locations. [2025-03-17 13:55:07,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:55:07,367 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;@2009902b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:55:07,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2025-03-17 13:55:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 1442 states, 801 states have (on average 2.0811485642946317) internal successors, (1667), 1433 states have internal predecessors, (1667), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:55:07,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:07,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:55:07,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr625REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:07,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash 54763678, now seen corresponding path program 1 times [2025-03-17 13:55:07,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:07,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44424319] [2025-03-17 13:55:07,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:07,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:55:07,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:55:07,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:07,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:07,508 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:07,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44424319] [2025-03-17 13:55:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44424319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:07,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:55:07,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611507171] [2025-03-17 13:55:07,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:07,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 13:55:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:07,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 13:55:07,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 13:55:07,532 INFO L87 Difference]: Start difference. First operand has 1442 states, 801 states have (on average 2.0811485642946317) internal successors, (1667), 1433 states have internal predecessors, (1667), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:55:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:07,646 INFO L93 Difference]: Finished difference Result 1423 states and 1617 transitions. [2025-03-17 13:55:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 13:55:07,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-17 13:55:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:07,660 INFO L225 Difference]: With dead ends: 1423 [2025-03-17 13:55:07,661 INFO L226 Difference]: Without dead ends: 1421 [2025-03-17 13:55:07,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 13:55:07,664 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:07,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1573 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:55:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-03-17 13:55:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1421. [2025-03-17 13:55:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 791 states have (on average 2.0012642225031607) internal successors, (1583), 1412 states have internal predecessors, (1583), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1615 transitions. [2025-03-17 13:55:07,747 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1615 transitions. Word has length 4 [2025-03-17 13:55:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:07,747 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 1615 transitions. [2025-03-17 13:55:07,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:55:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1615 transitions. [2025-03-17 13:55:07,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:55:07,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:07,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:55:07,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:55:07,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr625REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:07,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:07,749 INFO L85 PathProgramCache]: Analyzing trace with hash 54763709, now seen corresponding path program 1 times [2025-03-17 13:55:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:07,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281328023] [2025-03-17 13:55:07,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:07,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:55:07,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:55:07,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:07,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:07,845 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:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:07,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281328023] [2025-03-17 13:55:07,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281328023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:07,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:07,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:55:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316718417] [2025-03-17 13:55:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:07,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:55:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:07,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:55:07,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:55:07,847 INFO L87 Difference]: Start difference. First operand 1421 states and 1615 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:55:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:08,644 INFO L93 Difference]: Finished difference Result 1328 states and 1523 transitions. [2025-03-17 13:55:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:55:08,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-17 13:55:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:08,648 INFO L225 Difference]: With dead ends: 1328 [2025-03-17 13:55:08,648 INFO L226 Difference]: Without dead ends: 1328 [2025-03-17 13:55:08,648 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:55:08,649 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 1358 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:08,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 875 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:55:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-03-17 13:55:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1327. [2025-03-17 13:55:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 791 states have (on average 1.8824273072060682) internal successors, (1489), 1318 states have internal predecessors, (1489), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1521 transitions. [2025-03-17 13:55:08,669 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1521 transitions. Word has length 4 [2025-03-17 13:55:08,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:08,669 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1521 transitions. [2025-03-17 13:55:08,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:55:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1521 transitions. [2025-03-17 13:55:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:55:08,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:08,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:55:08,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:55:08,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:08,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:08,670 INFO L85 PathProgramCache]: Analyzing trace with hash 54763710, now seen corresponding path program 1 times [2025-03-17 13:55:08,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:08,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624556958] [2025-03-17 13:55:08,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:08,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:08,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:55:08,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:55:08,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:08,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:08,740 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:08,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:08,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624556958] [2025-03-17 13:55:08,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624556958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:08,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:08,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:55:08,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122979575] [2025-03-17 13:55:08,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:08,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:55:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:08,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:55:08,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:55:08,742 INFO L87 Difference]: Start difference. First operand 1327 states and 1521 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:55:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:09,571 INFO L93 Difference]: Finished difference Result 1740 states and 2012 transitions. [2025-03-17 13:55:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:55:09,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-17 13:55:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:09,576 INFO L225 Difference]: With dead ends: 1740 [2025-03-17 13:55:09,577 INFO L226 Difference]: Without dead ends: 1740 [2025-03-17 13:55:09,577 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:55:09,579 INFO L435 NwaCegarLoop]: 1231 mSDtfsCounter, 815 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:09,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1859 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:55:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2025-03-17 13:55:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1588. [2025-03-17 13:55:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1062 states have (on average 1.8465160075329567) internal successors, (1961), 1579 states have internal predecessors, (1961), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1993 transitions. [2025-03-17 13:55:09,603 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1993 transitions. Word has length 4 [2025-03-17 13:55:09,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:09,604 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 1993 transitions. [2025-03-17 13:55:09,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:55:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1993 transitions. [2025-03-17 13:55:09,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:55:09,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:09,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:55:09,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:55:09,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:09,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash 53111358, now seen corresponding path program 1 times [2025-03-17 13:55:09,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:09,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486013546] [2025-03-17 13:55:09,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:09,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:55:09,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:55:09,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:09,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:09,634 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:09,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:09,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486013546] [2025-03-17 13:55:09,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486013546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:09,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:09,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:55:09,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305806218] [2025-03-17 13:55:09,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:09,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:55:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:09,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:55:09,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:55:09,636 INFO L87 Difference]: Start difference. First operand 1588 states and 1993 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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:55:09,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:09,751 INFO L93 Difference]: Finished difference Result 3130 states and 3920 transitions. [2025-03-17 13:55:09,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:55:09,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-17 13:55:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:09,760 INFO L225 Difference]: With dead ends: 3130 [2025-03-17 13:55:09,760 INFO L226 Difference]: Without dead ends: 3130 [2025-03-17 13:55:09,760 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:55:09,760 INFO L435 NwaCegarLoop]: 1691 mSDtfsCounter, 1432 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:09,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 3152 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:55:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2025-03-17 13:55:09,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 1589. [2025-03-17 13:55:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1063 states have (on average 1.845719661335842) internal successors, (1962), 1580 states have internal predecessors, (1962), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1994 transitions. [2025-03-17 13:55:09,795 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1994 transitions. Word has length 4 [2025-03-17 13:55:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:09,796 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 1994 transitions. [2025-03-17 13:55:09,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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:55:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1994 transitions. [2025-03-17 13:55:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 13:55:09,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:09,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:09,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:55:09,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:09,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash 969378891, now seen corresponding path program 1 times [2025-03-17 13:55:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243563318] [2025-03-17 13:55:09,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:09,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 13:55:09,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 13:55:09,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:09,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:09,870 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:09,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:09,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243563318] [2025-03-17 13:55:09,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243563318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:09,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:09,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:55:09,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126628468] [2025-03-17 13:55:09,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:09,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:55:09,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:09,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:55:09,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:55:09,872 INFO L87 Difference]: Start difference. First operand 1589 states and 1994 transitions. Second operand has 4 states, 3 states have (on average 3.0) 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:55:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:10,781 INFO L93 Difference]: Finished difference Result 1615 states and 2047 transitions. [2025-03-17 13:55:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:55:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) 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:55:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:10,786 INFO L225 Difference]: With dead ends: 1615 [2025-03-17 13:55:10,786 INFO L226 Difference]: Without dead ends: 1615 [2025-03-17 13:55:10,786 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:55:10,788 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 1626 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:10,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 1535 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:55:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-03-17 13:55:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1566. [2025-03-17 13:55:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1063 states have (on average 1.824082784571966) internal successors, (1939), 1557 states have internal predecessors, (1939), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1971 transitions. [2025-03-17 13:55:10,813 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 1971 transitions. Word has length 9 [2025-03-17 13:55:10,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:10,813 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 1971 transitions. [2025-03-17 13:55:10,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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:55:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1971 transitions. [2025-03-17 13:55:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 13:55:10,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:10,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:10,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 13:55:10,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:10,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash 969378892, now seen corresponding path program 1 times [2025-03-17 13:55:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:10,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261709732] [2025-03-17 13:55:10,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:10,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 13:55:10,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 13:55:10,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:10,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:10,891 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:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:10,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261709732] [2025-03-17 13:55:10,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261709732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:10,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:55:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045461371] [2025-03-17 13:55:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:10,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:55:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:10,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:55:10,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:55:10,893 INFO L87 Difference]: Start difference. First operand 1566 states and 1971 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:55:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:10,967 INFO L93 Difference]: Finished difference Result 1491 states and 1868 transitions. [2025-03-17 13:55:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:55:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 13:55:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:10,971 INFO L225 Difference]: With dead ends: 1491 [2025-03-17 13:55:10,972 INFO L226 Difference]: Without dead ends: 1491 [2025-03-17 13:55:10,972 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:55:10,972 INFO L435 NwaCegarLoop]: 1339 mSDtfsCounter, 60 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:10,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2625 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:55:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2025-03-17 13:55:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2025-03-17 13:55:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1000 states have (on average 1.836) internal successors, (1836), 1482 states have internal predecessors, (1836), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1868 transitions. [2025-03-17 13:55:10,991 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1868 transitions. Word has length 9 [2025-03-17 13:55:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:10,991 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1868 transitions. [2025-03-17 13:55:10,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:55:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1868 transitions. [2025-03-17 13:55:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 13:55:10,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:10,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:10,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:55:10,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:10,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash -14148838, now seen corresponding path program 1 times [2025-03-17 13:55:10,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:10,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748688496] [2025-03-17 13:55:10,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:11,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 13:55:11,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 13:55:11,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:11,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:11,044 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:11,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748688496] [2025-03-17 13:55:11,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748688496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:11,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:11,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:55:11,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61856047] [2025-03-17 13:55:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:11,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:55:11,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:11,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:55:11,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:55:11,045 INFO L87 Difference]: Start difference. First operand 1491 states and 1868 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:55:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:11,146 INFO L93 Difference]: Finished difference Result 1473 states and 1843 transitions. [2025-03-17 13:55:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:55:11,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 13:55:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:11,151 INFO L225 Difference]: With dead ends: 1473 [2025-03-17 13:55:11,151 INFO L226 Difference]: Without dead ends: 1473 [2025-03-17 13:55:11,151 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:55:11,151 INFO L435 NwaCegarLoop]: 1304 mSDtfsCounter, 41 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:11,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3884 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:55:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2025-03-17 13:55:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1470. [2025-03-17 13:55:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 986 states have (on average 1.8336713995943206) internal successors, (1808), 1461 states have internal predecessors, (1808), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1840 transitions. [2025-03-17 13:55:11,175 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1840 transitions. Word has length 10 [2025-03-17 13:55:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:11,175 INFO L471 AbstractCegarLoop]: Abstraction has 1470 states and 1840 transitions. [2025-03-17 13:55:11,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:55:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1840 transitions. [2025-03-17 13:55:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 13:55:11,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:11,176 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] [2025-03-17 13:55:11,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:55:11,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr584REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:11,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash -512397488, now seen corresponding path program 1 times [2025-03-17 13:55:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:11,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088676154] [2025-03-17 13:55:11,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:11,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 13:55:11,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 13:55:11,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:11,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:11,302 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:11,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088676154] [2025-03-17 13:55:11,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088676154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:11,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:11,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:55:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555164682] [2025-03-17 13:55:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:11,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:55:11,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:11,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:55:11,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:55:11,304 INFO L87 Difference]: Start difference. First operand 1470 states and 1840 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:55:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:12,110 INFO L93 Difference]: Finished difference Result 1667 states and 1931 transitions. [2025-03-17 13:55:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:55:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2025-03-17 13:55:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:12,115 INFO L225 Difference]: With dead ends: 1667 [2025-03-17 13:55:12,115 INFO L226 Difference]: Without dead ends: 1667 [2025-03-17 13:55:12,115 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:55:12,115 INFO L435 NwaCegarLoop]: 1123 mSDtfsCounter, 821 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:12,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2475 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:55:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-03-17 13:55:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1466. [2025-03-17 13:55:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 986 states have (on average 1.8296146044624746) internal successors, (1804), 1457 states have internal predecessors, (1804), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1836 transitions. [2025-03-17 13:55:12,133 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1836 transitions. Word has length 24 [2025-03-17 13:55:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:12,133 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 1836 transitions. [2025-03-17 13:55:12,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:55:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1836 transitions. [2025-03-17 13:55:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 13:55:12,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:12,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:12,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 13:55:12,135 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr569REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:12,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:12,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2029448516, now seen corresponding path program 1 times [2025-03-17 13:55:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:12,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164970187] [2025-03-17 13:55:12,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:12,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:12,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 13:55:12,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 13:55:12,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:12,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:12,213 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:12,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164970187] [2025-03-17 13:55:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164970187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:12,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:55:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464419214] [2025-03-17 13:55:12,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:12,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:55:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:12,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:55:12,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:55:12,215 INFO L87 Difference]: Start difference. First operand 1466 states and 1836 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:55:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:12,313 INFO L93 Difference]: Finished difference Result 1466 states and 1832 transitions. [2025-03-17 13:55:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:55:12,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2025-03-17 13:55:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:12,317 INFO L225 Difference]: With dead ends: 1466 [2025-03-17 13:55:12,317 INFO L226 Difference]: Without dead ends: 1466 [2025-03-17 13:55:12,317 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:55:12,317 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 21 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3866 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:12,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3866 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:55:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2025-03-17 13:55:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1466. [2025-03-17 13:55:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 986 states have (on average 1.8255578093306288) internal successors, (1800), 1457 states have internal predecessors, (1800), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1832 transitions. [2025-03-17 13:55:12,335 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1832 transitions. Word has length 58 [2025-03-17 13:55:12,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:12,335 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 1832 transitions. [2025-03-17 13:55:12,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:55:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1832 transitions. [2025-03-17 13:55:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 13:55:12,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:12,337 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] [2025-03-17 13:55:12,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:55:12,337 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr569REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:12,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash -148305652, now seen corresponding path program 1 times [2025-03-17 13:55:12,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:12,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286138694] [2025-03-17 13:55:12,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:12,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:12,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 13:55:12,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 13:55:12,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:12,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:12,435 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:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286138694] [2025-03-17 13:55:12,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286138694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:12,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:12,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:55:12,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402048524] [2025-03-17 13:55:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:12,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:55:12,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:12,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:55:12,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:55:12,437 INFO L87 Difference]: Start difference. First operand 1466 states and 1832 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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:55:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:12,513 INFO L93 Difference]: Finished difference Result 1556 states and 1949 transitions. [2025-03-17 13:55:12,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:55:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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 66 [2025-03-17 13:55:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:12,518 INFO L225 Difference]: With dead ends: 1556 [2025-03-17 13:55:12,518 INFO L226 Difference]: Without dead ends: 1556 [2025-03-17 13:55:12,518 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:55:12,518 INFO L435 NwaCegarLoop]: 1313 mSDtfsCounter, 54 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2599 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:12,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2599 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:55:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-03-17 13:55:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2025-03-17 13:55:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1076 states have (on average 1.7815985130111525) internal successors, (1917), 1547 states have internal predecessors, (1917), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1949 transitions. [2025-03-17 13:55:12,535 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1949 transitions. Word has length 66 [2025-03-17 13:55:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:12,535 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1949 transitions. [2025-03-17 13:55:12,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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:55:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1949 transitions. [2025-03-17 13:55:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 13:55:12,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:12,536 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] [2025-03-17 13:55:12,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:55:12,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr540REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:12,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1346712450, now seen corresponding path program 1 times [2025-03-17 13:55:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:12,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393239611] [2025-03-17 13:55:12,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:12,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:12,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 13:55:12,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 13:55:12,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:12,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:12,994 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:12,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393239611] [2025-03-17 13:55:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393239611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:12,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:12,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:55:12,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043437798] [2025-03-17 13:55:12,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:12,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:55:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:12,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:55:12,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:55:12,995 INFO L87 Difference]: Start difference. First operand 1556 states and 1949 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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:55:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:13,832 INFO L93 Difference]: Finished difference Result 1472 states and 1865 transitions. [2025-03-17 13:55:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:55:13,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2025-03-17 13:55:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:13,836 INFO L225 Difference]: With dead ends: 1472 [2025-03-17 13:55:13,836 INFO L226 Difference]: Without dead ends: 1472 [2025-03-17 13:55:13,836 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:55:13,836 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 2259 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:13,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2265 Valid, 1080 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:55:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2025-03-17 13:55:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1201. [2025-03-17 13:55:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 805 states have (on average 1.6782608695652175) internal successors, (1351), 1192 states have internal predecessors, (1351), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1383 transitions. [2025-03-17 13:55:13,862 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1383 transitions. Word has length 69 [2025-03-17 13:55:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:13,862 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1383 transitions. [2025-03-17 13:55:13,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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:55:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1383 transitions. [2025-03-17 13:55:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 13:55:13,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:13,863 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] [2025-03-17 13:55:13,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:55:13,863 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr533REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:13,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1114205720, now seen corresponding path program 1 times [2025-03-17 13:55:13,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:13,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883864592] [2025-03-17 13:55:13,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:13,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 13:55:13,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 13:55:13,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:13,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:14,047 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:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883864592] [2025-03-17 13:55:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883864592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:14,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:14,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:55:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562590461] [2025-03-17 13:55:14,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:14,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:55:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:14,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:55:14,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:55:14,049 INFO L87 Difference]: Start difference. First operand 1201 states and 1383 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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:55:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:14,779 INFO L93 Difference]: Finished difference Result 1200 states and 1382 transitions. [2025-03-17 13:55:14,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:55:14,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2025-03-17 13:55:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:14,782 INFO L225 Difference]: With dead ends: 1200 [2025-03-17 13:55:14,782 INFO L226 Difference]: Without dead ends: 1200 [2025-03-17 13:55:14,782 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:55:14,783 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 2 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:14,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3443 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:55:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2025-03-17 13:55:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1200. [2025-03-17 13:55:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 805 states have (on average 1.6770186335403727) internal successors, (1350), 1191 states have internal predecessors, (1350), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1382 transitions. [2025-03-17 13:55:14,795 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1382 transitions. Word has length 74 [2025-03-17 13:55:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:14,795 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1382 transitions. [2025-03-17 13:55:14,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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:55:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1382 transitions. [2025-03-17 13:55:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 13:55:14,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:14,796 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] [2025-03-17 13:55:14,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:55:14,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:14,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1114205721, now seen corresponding path program 1 times [2025-03-17 13:55:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693242878] [2025-03-17 13:55:14,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:14,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 13:55:14,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 13:55:14,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:14,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:15,108 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:15,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:15,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693242878] [2025-03-17 13:55:15,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693242878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:15,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:15,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:55:15,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783392057] [2025-03-17 13:55:15,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:15,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:55:15,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:15,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:55:15,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:55:15,110 INFO L87 Difference]: Start difference. First operand 1200 states and 1382 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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:55:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:15,860 INFO L93 Difference]: Finished difference Result 1199 states and 1381 transitions. [2025-03-17 13:55:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:55:15,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2025-03-17 13:55:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:15,864 INFO L225 Difference]: With dead ends: 1199 [2025-03-17 13:55:15,864 INFO L226 Difference]: Without dead ends: 1199 [2025-03-17 13:55:15,864 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:55:15,864 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 1 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3458 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:15,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3458 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:55:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-03-17 13:55:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2025-03-17 13:55:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 804 states have (on average 1.677860696517413) internal successors, (1349), 1190 states have internal predecessors, (1349), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1381 transitions. [2025-03-17 13:55:15,875 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1381 transitions. Word has length 74 [2025-03-17 13:55:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:15,876 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1381 transitions. [2025-03-17 13:55:15,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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:55:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1381 transitions. [2025-03-17 13:55:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 13:55:15,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:15,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:15,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:55:15,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr529REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:15,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1601216747, now seen corresponding path program 1 times [2025-03-17 13:55:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:15,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859189258] [2025-03-17 13:55:15,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:15,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 13:55:15,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 13:55:15,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:15,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:16,034 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:16,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:16,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859189258] [2025-03-17 13:55:16,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859189258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:16,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:16,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:55:16,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172921498] [2025-03-17 13:55:16,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:16,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:55:16,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:16,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:55:16,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:55:16,036 INFO L87 Difference]: Start difference. First operand 1199 states and 1381 transitions. Second operand has 7 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:17,206 INFO L93 Difference]: Finished difference Result 1211 states and 1399 transitions. [2025-03-17 13:55:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:55:17,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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 82 [2025-03-17 13:55:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:17,209 INFO L225 Difference]: With dead ends: 1211 [2025-03-17 13:55:17,210 INFO L226 Difference]: Without dead ends: 1211 [2025-03-17 13:55:17,210 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:55:17,210 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 12 mSDsluCounter, 4116 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5324 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:17,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5324 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:55:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-03-17 13:55:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1205. [2025-03-17 13:55:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 809 states have (on average 1.6761433868974043) internal successors, (1356), 1195 states have internal predecessors, (1356), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-17 13:55:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1394 transitions. [2025-03-17 13:55:17,223 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1394 transitions. Word has length 82 [2025-03-17 13:55:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:17,223 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1394 transitions. [2025-03-17 13:55:17,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1394 transitions. [2025-03-17 13:55:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 13:55:17,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:17,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:17,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:55:17,224 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:17,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1601216746, now seen corresponding path program 1 times [2025-03-17 13:55:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:17,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389465320] [2025-03-17 13:55:17,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:17,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 13:55:17,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 13:55:17,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:17,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:17,586 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:17,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:17,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389465320] [2025-03-17 13:55:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389465320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:17,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:17,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:55:17,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253769305] [2025-03-17 13:55:17,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:17,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:55:17,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:17,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:55:17,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:55:17,588 INFO L87 Difference]: Start difference. First operand 1205 states and 1394 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:18,613 INFO L93 Difference]: Finished difference Result 1205 states and 1393 transitions. [2025-03-17 13:55:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:55:18,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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 82 [2025-03-17 13:55:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:18,616 INFO L225 Difference]: With dead ends: 1205 [2025-03-17 13:55:18,617 INFO L226 Difference]: Without dead ends: 1205 [2025-03-17 13:55:18,617 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:55:18,617 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 7 mSDsluCounter, 3171 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:18,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4386 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1899 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:55:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-03-17 13:55:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1205. [2025-03-17 13:55:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 809 states have (on average 1.6749072929542645) internal successors, (1355), 1195 states have internal predecessors, (1355), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-17 13:55:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1393 transitions. [2025-03-17 13:55:18,629 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1393 transitions. Word has length 82 [2025-03-17 13:55:18,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:18,629 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1393 transitions. [2025-03-17 13:55:18,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1393 transitions. [2025-03-17 13:55:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 13:55:18,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:18,630 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:55:18,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:55:18,630 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr529REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:18,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:18,630 INFO L85 PathProgramCache]: Analyzing trace with hash -708990545, now seen corresponding path program 1 times [2025-03-17 13:55:18,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:18,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909736335] [2025-03-17 13:55:18,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:18,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:55:18,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:55:18,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:18,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:55:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:18,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909736335] [2025-03-17 13:55:18,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909736335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:18,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109330455] [2025-03-17 13:55:18,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:18,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:18,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:18,961 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:55:18,962 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:55:19,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:55:19,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:55:19,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:19,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:19,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 13:55:19,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:19,160 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:19,265 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:19,265 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:19,273 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:19,320 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:19,321 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:19,343 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:19,346 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:19,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:19,394 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-17 13:55:19,394 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 21 treesize of output 20 [2025-03-17 13:55:19,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-03-17 13:55:19,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109330455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:19,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:19,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-03-17 13:55:19,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955467885] [2025-03-17 13:55:19,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:19,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:55:19,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:19,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:55:19,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2025-03-17 13:55:19,410 INFO L87 Difference]: Start difference. First operand 1205 states and 1393 transitions. Second operand has 14 states, 12 states have (on average 9.833333333333334) internal successors, (118), 13 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:55:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:21,274 INFO L93 Difference]: Finished difference Result 1204 states and 1392 transitions. [2025-03-17 13:55:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:55:21,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.833333333333334) internal successors, (118), 13 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2025-03-17 13:55:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:21,277 INFO L225 Difference]: With dead ends: 1204 [2025-03-17 13:55:21,277 INFO L226 Difference]: Without dead ends: 1204 [2025-03-17 13:55:21,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2025-03-17 13:55:21,278 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 1161 mSDsluCounter, 5611 mSDsCounter, 0 mSdLazyCounter, 4991 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 6346 SdHoareTripleChecker+Invalid, 5022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:21,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 6346 Invalid, 5022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4991 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 13:55:21,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2025-03-17 13:55:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204. [2025-03-17 13:55:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 809 states have (on average 1.6736711990111248) internal successors, (1354), 1194 states have internal predecessors, (1354), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-17 13:55:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1392 transitions. [2025-03-17 13:55:21,291 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1392 transitions. Word has length 83 [2025-03-17 13:55:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:21,292 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1392 transitions. [2025-03-17 13:55:21,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.833333333333334) internal successors, (118), 13 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:55:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1392 transitions. [2025-03-17 13:55:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 13:55:21,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:21,292 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:55:21,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 13:55:21,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 13:55:21,493 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:21,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash -708990544, now seen corresponding path program 1 times [2025-03-17 13:55:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516501843] [2025-03-17 13:55:21,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:21,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:21,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:55:21,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:55:21,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:21,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:21,961 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:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516501843] [2025-03-17 13:55:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516501843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469557103] [2025-03-17 13:55:21,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:21,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:21,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:21,963 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:55:21,965 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:55:22,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:55:22,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:55:22,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:22,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:22,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 13:55:22,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:22,130 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:22,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:22,217 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:22,223 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:22,231 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:22,235 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:22,279 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:22,283 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:22,372 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:22,372 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:22,376 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:22,397 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:22,400 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:22,402 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:22,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:22,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_633 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_633 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2025-03-17 13:55:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469557103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:22,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:22,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-17 13:55:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524106922] [2025-03-17 13:55:22,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:22,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:55:22,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:22,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:55:22,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-17 13:55:22,483 INFO L87 Difference]: Start difference. First operand 1204 states and 1392 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:24,786 INFO L93 Difference]: Finished difference Result 1211 states and 1399 transitions. [2025-03-17 13:55:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:55:24,786 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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 83 [2025-03-17 13:55:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:24,788 INFO L225 Difference]: With dead ends: 1211 [2025-03-17 13:55:24,789 INFO L226 Difference]: Without dead ends: 1211 [2025-03-17 13:55:24,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 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:24,789 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1161 mSDsluCounter, 4712 mSDsCounter, 0 mSdLazyCounter, 5900 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 5452 SdHoareTripleChecker+Invalid, 5949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 5900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:24,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 5452 Invalid, 5949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 5900 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 13:55:24,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-03-17 13:55:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1202. [2025-03-17 13:55:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 808 states have (on average 1.6732673267326732) internal successors, (1352), 1192 states have internal predecessors, (1352), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1384 transitions. [2025-03-17 13:55:24,801 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1384 transitions. Word has length 83 [2025-03-17 13:55:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:24,801 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1384 transitions. [2025-03-17 13:55:24,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1384 transitions. [2025-03-17 13:55:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 13:55:24,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:24,801 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] [2025-03-17 13:55:24,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 13:55:25,006 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,SelfDestructingSolverStorable16 [2025-03-17 13:55:25,006 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:25,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1940006861, now seen corresponding path program 1 times [2025-03-17 13:55:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:25,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359911087] [2025-03-17 13:55:25,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:25,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:25,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 13:55:25,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 13:55:25,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:25,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:55:25,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:25,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359911087] [2025-03-17 13:55:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359911087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:25,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:25,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 13:55:25,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293433624] [2025-03-17 13:55:25,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:25,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:55:25,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:25,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:55:25,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:55:25,336 INFO L87 Difference]: Start difference. First operand 1202 states and 1384 transitions. Second operand has 14 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 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:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:27,155 INFO L93 Difference]: Finished difference Result 1215 states and 1403 transitions. [2025-03-17 13:55:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:55:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 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 85 [2025-03-17 13:55:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:27,158 INFO L225 Difference]: With dead ends: 1215 [2025-03-17 13:55:27,159 INFO L226 Difference]: Without dead ends: 1215 [2025-03-17 13:55:27,159 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:27,159 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 1169 mSDsluCounter, 6263 mSDsCounter, 0 mSdLazyCounter, 5590 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 6997 SdHoareTripleChecker+Invalid, 5621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:27,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 6997 Invalid, 5621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5590 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 13:55:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-03-17 13:55:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1211. [2025-03-17 13:55:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 816 states have (on average 1.6691176470588236) internal successors, (1362), 1200 states have internal predecessors, (1362), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:55:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1395 transitions. [2025-03-17 13:55:27,170 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1395 transitions. Word has length 85 [2025-03-17 13:55:27,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:27,170 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1395 transitions. [2025-03-17 13:55:27,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 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:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1395 transitions. [2025-03-17 13:55:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 13:55:27,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:27,171 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] [2025-03-17 13:55:27,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:55:27,171 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:27,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1940006860, now seen corresponding path program 1 times [2025-03-17 13:55:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:27,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840047796] [2025-03-17 13:55:27,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:27,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:27,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 13:55:27,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 13:55:27,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:27,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:27,579 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:27,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:27,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840047796] [2025-03-17 13:55:27,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840047796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:27,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:27,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 13:55:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856041271] [2025-03-17 13:55:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:27,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:55:27,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:27,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:55:27,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:55:27,581 INFO L87 Difference]: Start difference. First operand 1211 states and 1395 transitions. Second operand has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 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:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:29,415 INFO L93 Difference]: Finished difference Result 1214 states and 1402 transitions. [2025-03-17 13:55:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:55:29,416 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 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 85 [2025-03-17 13:55:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:29,418 INFO L225 Difference]: With dead ends: 1214 [2025-03-17 13:55:29,418 INFO L226 Difference]: Without dead ends: 1214 [2025-03-17 13:55:29,418 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:29,418 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 1180 mSDsluCounter, 4183 mSDsCounter, 0 mSdLazyCounter, 5089 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 4924 SdHoareTripleChecker+Invalid, 5118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:29,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 4924 Invalid, 5118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5089 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 13:55:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-17 13:55:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1211. [2025-03-17 13:55:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 816 states have (on average 1.6678921568627452) internal successors, (1361), 1200 states have internal predecessors, (1361), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:55:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1394 transitions. [2025-03-17 13:55:29,429 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1394 transitions. Word has length 85 [2025-03-17 13:55:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:29,429 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1394 transitions. [2025-03-17 13:55:29,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 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:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1394 transitions. [2025-03-17 13:55:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 13:55:29,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:29,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:29,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:55:29,430 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:29,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1113149273, now seen corresponding path program 1 times [2025-03-17 13:55:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902070903] [2025-03-17 13:55:29,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:29,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:29,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:55:29,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:55:29,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:29,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:29,729 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,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902070903] [2025-03-17 13:55:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902070903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735346899] [2025-03-17 13:55:29,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:29,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:29,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:29,731 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:29,733 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:29,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:55:29,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:55:29,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:29,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:29,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 13:55:29,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:29,904 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:30,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:30,090 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:30,113 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:30,119 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:30,244 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:30,244 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:30,249 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:30,280 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 19 treesize of output 7 [2025-03-17 13:55:30,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:55:30,311 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 35 treesize of output 28 [2025-03-17 13:55:30,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:55:30,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:55:30,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 16 [2025-03-17 13:55:30,384 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:30,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:32,630 INFO L349 Elim1Store]: treesize reduction 5, result has 83.3 percent of original size [2025-03-17 13:55:32,630 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 34 treesize of output 33 [2025-03-17 13:55:32,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem52#1.offset_11| Int) (v_ArrVal_890 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.base| Int) (v_ArrVal_891 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem52#1.offset_11| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_890))) (store .cse1 |ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse1 |ULTIMATE.start_main_#t~mem52#1.base|) (+ |v_ULTIMATE.start_main_#t~mem52#1.offset_11| 16) |c_ULTIMATE.start_main_~user~0#1.base|))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem50#1.base|)))) is different from false [2025-03-17 13:55:32,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735346899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:32,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:32,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-03-17 13:55:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514219468] [2025-03-17 13:55:32,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:32,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 13:55:32,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:32,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 13:55:32,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=524, Unknown=2, NotChecked=46, Total=650 [2025-03-17 13:55:32,645 INFO L87 Difference]: Start difference. First operand 1211 states and 1394 transitions. Second operand has 23 states, 20 states have (on average 8.3) internal successors, (166), 22 states have internal predecessors, (166), 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:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:35,530 INFO L93 Difference]: Finished difference Result 1759 states and 2036 transitions. [2025-03-17 13:55:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:55:35,531 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.3) internal successors, (166), 22 states have internal predecessors, (166), 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 86 [2025-03-17 13:55:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:35,534 INFO L225 Difference]: With dead ends: 1759 [2025-03-17 13:55:35,534 INFO L226 Difference]: Without dead ends: 1759 [2025-03-17 13:55:35,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=173, Invalid=951, Unknown=2, NotChecked=64, Total=1190 [2025-03-17 13:55:35,534 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 2781 mSDsluCounter, 8127 mSDsCounter, 0 mSdLazyCounter, 7014 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2807 SdHoareTripleChecker+Valid, 8861 SdHoareTripleChecker+Invalid, 7088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 7014 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:35,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2807 Valid, 8861 Invalid, 7088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 7014 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2025-03-17 13:55:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2025-03-17 13:55:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1210. [2025-03-17 13:55:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 816 states have (on average 1.6666666666666667) internal successors, (1360), 1199 states have internal predecessors, (1360), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:55:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1393 transitions. [2025-03-17 13:55:35,546 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1393 transitions. Word has length 86 [2025-03-17 13:55:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:35,546 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1393 transitions. [2025-03-17 13:55:35,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.3) internal successors, (166), 22 states have internal predecessors, (166), 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:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1393 transitions. [2025-03-17 13:55:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 13:55:35,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:35,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:35,554 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:35,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:35,747 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:35,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1113149274, now seen corresponding path program 1 times [2025-03-17 13:55:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:35,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965839569] [2025-03-17 13:55:35,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:35,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:35,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:55:35,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:55:35,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:35,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:36,189 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,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:36,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965839569] [2025-03-17 13:55:36,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965839569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:36,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238125203] [2025-03-17 13:55:36,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:36,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:36,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:36,192 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:36,194 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:36,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:55:36,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:55:36,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:36,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:36,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 13:55:36,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:36,368 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,454 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:36,454 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,459 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:36,479 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,483 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:36,548 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,554 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,638 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:36,638 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,642 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,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:36,699 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,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 13:55:36,718 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,721 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,736 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,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:36,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1028 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1028 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-17 13:55:36,792 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1028 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1028 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-03-17 13:55:36,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1034))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) .cse0 v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-03-17 13:55:36,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238125203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:36,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:36,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-17 13:55:36,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714784062] [2025-03-17 13:55:36,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:36,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 13:55:36,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:36,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 13:55:36,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=397, Unknown=3, NotChecked=126, Total=600 [2025-03-17 13:55:36,836 INFO L87 Difference]: Start difference. First operand 1210 states and 1393 transitions. Second operand has 20 states, 17 states have (on average 8.0) internal successors, (136), 20 states have internal predecessors, (136), 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:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:40,397 INFO L93 Difference]: Finished difference Result 1212 states and 1400 transitions. [2025-03-17 13:55:40,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:55:40,398 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.0) internal successors, (136), 20 states have internal predecessors, (136), 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 86 [2025-03-17 13:55:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:40,400 INFO L225 Difference]: With dead ends: 1212 [2025-03-17 13:55:40,400 INFO L226 Difference]: Without dead ends: 1212 [2025-03-17 13:55:40,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=594, Unknown=3, NotChecked=156, Total=870 [2025-03-17 13:55:40,400 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1157 mSDsluCounter, 6848 mSDsCounter, 0 mSdLazyCounter, 8747 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 7587 SdHoareTripleChecker+Invalid, 8781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 8747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:40,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 7587 Invalid, 8781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 8747 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-17 13:55:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2025-03-17 13:55:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1200. [2025-03-17 13:55:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 808 states have (on average 1.6707920792079207) internal successors, (1350), 1190 states have internal predecessors, (1350), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1382 transitions. [2025-03-17 13:55:40,409 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1382 transitions. Word has length 86 [2025-03-17 13:55:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:40,409 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1382 transitions. [2025-03-17 13:55:40,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.0) internal successors, (136), 20 states have internal predecessors, (136), 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:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1382 transitions. [2025-03-17 13:55:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 13:55:40,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:40,410 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] [2025-03-17 13:55:40,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 13:55:40,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:40,614 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:40,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1663154386, now seen corresponding path program 1 times [2025-03-17 13:55:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:40,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735410133] [2025-03-17 13:55:40,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:40,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 13:55:40,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 13:55:40,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:40,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:40,943 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:40,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735410133] [2025-03-17 13:55:40,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735410133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:40,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:40,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 13:55:40,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881065048] [2025-03-17 13:55:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:40,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:55:40,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:40,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:55:40,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:55:40,945 INFO L87 Difference]: Start difference. First operand 1200 states and 1382 transitions. Second operand has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 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:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:42,901 INFO L93 Difference]: Finished difference Result 1216 states and 1404 transitions. [2025-03-17 13:55:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:55:42,902 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 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 88 [2025-03-17 13:55:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:42,904 INFO L225 Difference]: With dead ends: 1216 [2025-03-17 13:55:42,904 INFO L226 Difference]: Without dead ends: 1216 [2025-03-17 13:55:42,904 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:42,907 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 1172 mSDsluCounter, 6270 mSDsCounter, 0 mSdLazyCounter, 5566 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 7003 SdHoareTripleChecker+Invalid, 5597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:42,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 7003 Invalid, 5597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5566 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 13:55:42,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-03-17 13:55:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1212. [2025-03-17 13:55:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 819 states have (on average 1.6642246642246643) internal successors, (1363), 1201 states have internal predecessors, (1363), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:55:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1396 transitions. [2025-03-17 13:55:42,918 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1396 transitions. Word has length 88 [2025-03-17 13:55:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:42,918 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1396 transitions. [2025-03-17 13:55:42,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 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:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1396 transitions. [2025-03-17 13:55:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 13:55:42,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:42,919 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] [2025-03-17 13:55:42,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 13:55:42,919 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:42,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1663154385, now seen corresponding path program 1 times [2025-03-17 13:55:42,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:42,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7561973] [2025-03-17 13:55:42,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:42,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 13:55:42,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 13:55:42,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:42,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:43,451 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:43,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:43,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7561973] [2025-03-17 13:55:43,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7561973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:43,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:43,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 13:55:43,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556381809] [2025-03-17 13:55:43,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:43,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 13:55:43,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:43,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 13:55:43,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 13:55:43,454 INFO L87 Difference]: Start difference. First operand 1212 states and 1396 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 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:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:45,732 INFO L93 Difference]: Finished difference Result 1215 states and 1403 transitions. [2025-03-17 13:55:45,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 13:55:45,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 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 88 [2025-03-17 13:55:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:45,734 INFO L225 Difference]: With dead ends: 1215 [2025-03-17 13:55:45,735 INFO L226 Difference]: Without dead ends: 1215 [2025-03-17 13:55:45,735 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:45,735 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1164 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 5851 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 5451 SdHoareTripleChecker+Invalid, 5880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:45,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 5451 Invalid, 5880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5851 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 13:55:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-03-17 13:55:45,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1212. [2025-03-17 13:55:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 819 states have (on average 1.663003663003663) internal successors, (1362), 1201 states have internal predecessors, (1362), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:55:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1395 transitions. [2025-03-17 13:55:45,745 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1395 transitions. Word has length 88 [2025-03-17 13:55:45,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:45,745 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1395 transitions. [2025-03-17 13:55:45,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 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:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1395 transitions. [2025-03-17 13:55:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:55:45,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:45,745 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] [2025-03-17 13:55:45,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 13:55:45,746 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:45,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:45,746 INFO L85 PathProgramCache]: Analyzing trace with hash 388806216, now seen corresponding path program 1 times [2025-03-17 13:55:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:45,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813477048] [2025-03-17 13:55:45,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:45,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:45,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:55:45,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:55:45,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:45,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:46,151 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:46,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:46,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813477048] [2025-03-17 13:55:46,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813477048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:46,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146258201] [2025-03-17 13:55:46,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:46,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:46,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:46,154 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:46,156 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:46,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:55:46,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:55:46,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:46,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:46,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 13:55:46,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:46,336 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:46,420 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:46,420 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:46,424 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:46,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:46,489 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:46,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:46,521 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:46,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:46,546 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:46,552 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:46,557 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:46,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:46,584 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:55:46,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (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$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1308))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1309)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:55:46,596 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1308))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1309)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:55:46,618 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-03-17 13:55:46,618 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 57 treesize of output 56 [2025-03-17 13:55:46,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1312))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1308)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1309)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-03-17 13:55:46,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146258201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:46,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:46,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-03-17 13:55:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046908032] [2025-03-17 13:55:46,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:46,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 13:55:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:46,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 13:55:46,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=317, Unknown=12, NotChecked=156, Total=552 [2025-03-17 13:55:46,623 INFO L87 Difference]: Start difference. First operand 1212 states and 1395 transitions. Second operand has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 19 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:55:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:48,502 INFO L93 Difference]: Finished difference Result 1214 states and 1402 transitions. [2025-03-17 13:55:48,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:55:48,502 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 19 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2025-03-17 13:55:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:48,504 INFO L225 Difference]: With dead ends: 1214 [2025-03-17 13:55:48,504 INFO L226 Difference]: Without dead ends: 1214 [2025-03-17 13:55:48,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=627, Unknown=17, NotChecked=220, Total=992 [2025-03-17 13:55:48,505 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 1157 mSDsluCounter, 6256 mSDsCounter, 0 mSdLazyCounter, 5586 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 6989 SdHoareTripleChecker+Invalid, 5617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:48,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 6989 Invalid, 5617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5586 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 13:55:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-17 13:55:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1211. [2025-03-17 13:55:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 819 states have (on average 1.6617826617826619) internal successors, (1361), 1200 states have internal predecessors, (1361), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:55:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1394 transitions. [2025-03-17 13:55:48,524 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1394 transitions. Word has length 89 [2025-03-17 13:55:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:48,524 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1394 transitions. [2025-03-17 13:55:48,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 19 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:55:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1394 transitions. [2025-03-17 13:55:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:55:48,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:48,529 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] [2025-03-17 13:55:48,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 13:55:48,729 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,SelfDestructingSolverStorable23 [2025-03-17 13:55:48,729 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:48,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:48,730 INFO L85 PathProgramCache]: Analyzing trace with hash 388806217, now seen corresponding path program 1 times [2025-03-17 13:55:48,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:48,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206108695] [2025-03-17 13:55:48,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:48,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:48,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:55:48,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:55:48,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:48,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:49,212 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:49,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:49,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206108695] [2025-03-17 13:55:49,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206108695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:49,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831054540] [2025-03-17 13:55:49,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:49,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:49,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:49,214 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:49,215 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:49,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:55:49,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:55:49,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:49,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:49,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 13:55:49,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:49,385 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:49,444 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:49,444 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:49,454 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:49,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:49,507 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 31 treesize of output 32 [2025-03-17 13:55:49,536 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-17 13:55:49,536 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 69 treesize of output 41 [2025-03-17 13:55:49,539 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:49,634 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-17 13:55:49,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2025-03-17 13:55:49,637 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:49,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 13:55:49,670 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 39 treesize of output 21 [2025-03-17 13:55:49,672 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 34 treesize of output 16 [2025-03-17 13:55:49,686 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:49,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:49,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:55:49,803 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 112 treesize of output 116 [2025-03-17 13:55:49,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base|) (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1457 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1457))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< 0 (+ 9 (select (select (store .cse0 .cse2 v_prenex_6) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1457))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< (select (select (store .cse3 .cse2 v_ArrVal_1460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 9))))) (or (forall ((v_ArrVal_1459 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem52#1.base| (select (select (store .cse4 .cse2 v_ArrVal_1459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1457 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)) (forall ((v_ArrVal_1457 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1457))) (or (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_prenex_6 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 .cse2 v_prenex_6) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))))))))) is different from false [2025-03-17 13:55:49,878 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 992 treesize of output 938 [2025-03-17 13:55:49,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 710 treesize of output 702 [2025-03-17 13:55:49,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 702 treesize of output 694 [2025-03-17 13:55:49,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 694 treesize of output 690 [2025-03-17 13:55:49,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 690 treesize of output 682 [2025-03-17 13:55:49,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 682 treesize of output 674 [2025-03-17 13:55:49,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 674 treesize of output 666 [2025-03-17 13:55:49,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 666 treesize of output 658 [2025-03-17 13:55:49,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1463 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1463) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))))) is different from false [2025-03-17 13:55:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831054540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:49,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:49,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2025-03-17 13:55:49,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304068241] [2025-03-17 13:55:49,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:49,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 13:55:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:49,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 13:55:49,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=661, Unknown=2, NotChecked=106, Total=870 [2025-03-17 13:55:49,998 INFO L87 Difference]: Start difference. First operand 1211 states and 1394 transitions. Second operand has 24 states, 21 states have (on average 6.761904761904762) internal successors, (142), 24 states have internal predecessors, (142), 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:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:53,309 INFO L93 Difference]: Finished difference Result 1213 states and 1401 transitions. [2025-03-17 13:55:53,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:55:53,311 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.761904761904762) internal successors, (142), 24 states have internal predecessors, (142), 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 89 [2025-03-17 13:55:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:53,313 INFO L225 Difference]: With dead ends: 1213 [2025-03-17 13:55:53,313 INFO L226 Difference]: Without dead ends: 1213 [2025-03-17 13:55:53,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=1016, Unknown=2, NotChecked=134, Total=1332 [2025-03-17 13:55:53,313 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1168 mSDsluCounter, 7395 mSDsCounter, 0 mSdLazyCounter, 8175 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 8134 SdHoareTripleChecker+Invalid, 8240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 8175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:53,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 8134 Invalid, 8240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 8175 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-17 13:55:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-03-17 13:55:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1198. [2025-03-17 13:55:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 808 states have (on average 1.6683168316831682) internal successors, (1348), 1188 states have internal predecessors, (1348), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:55:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1380 transitions. [2025-03-17 13:55:53,324 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1380 transitions. Word has length 89 [2025-03-17 13:55:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:53,324 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1380 transitions. [2025-03-17 13:55:53,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.761904761904762) internal successors, (142), 24 states have internal predecessors, (142), 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:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1380 transitions. [2025-03-17 13:55:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 13:55:53,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:53,327 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:55:53,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 13:55:53,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:53,527 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:53,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash -288286932, now seen corresponding path program 1 times [2025-03-17 13:55:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212691094] [2025-03-17 13:55:53,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:53,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 13:55:53,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 13:55:53,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:53,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:55:53,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:53,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212691094] [2025-03-17 13:55:53,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212691094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:53,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:53,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 13:55:53,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890150618] [2025-03-17 13:55:53,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:53,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 13:55:53,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:53,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 13:55:53,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:55:53,877 INFO L87 Difference]: Start difference. First operand 1198 states and 1380 transitions. Second operand has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 15 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:55:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:55,930 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2025-03-17 13:55:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:55:55,930 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 15 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:55:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:55,932 INFO L225 Difference]: With dead ends: 1217 [2025-03-17 13:55:55,932 INFO L226 Difference]: Without dead ends: 1217 [2025-03-17 13:55:55,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-17 13:55:55,932 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 1167 mSDsluCounter, 6935 mSDsCounter, 0 mSdLazyCounter, 6175 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 7667 SdHoareTripleChecker+Invalid, 6205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 6175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:55,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 7667 Invalid, 6205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 6175 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 13:55:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-17 13:55:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1213. [2025-03-17 13:55:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 822 states have (on average 1.659367396593674) internal successors, (1364), 1202 states have internal predecessors, (1364), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:55:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1397 transitions. [2025-03-17 13:55:55,940 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1397 transitions. Word has length 91 [2025-03-17 13:55:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:55,940 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1397 transitions. [2025-03-17 13:55:55,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 15 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:55:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1397 transitions. [2025-03-17 13:55:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 13:55:55,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:55,941 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:55:55,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 13:55:55,941 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:55,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash -288286931, now seen corresponding path program 1 times [2025-03-17 13:55:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:55,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478468416] [2025-03-17 13:55:55,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:55,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 13:55:55,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 13:55:55,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:55,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:56,493 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:56,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:56,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478468416] [2025-03-17 13:55:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478468416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 13:55:56,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837579022] [2025-03-17 13:55:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:56,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:55:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:56,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:55:56,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:55:56,494 INFO L87 Difference]: Start difference. First operand 1213 states and 1397 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 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:55:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:58,664 INFO L93 Difference]: Finished difference Result 1216 states and 1404 transitions. [2025-03-17 13:55:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:55:58,664 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 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:55:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:58,666 INFO L225 Difference]: With dead ends: 1216 [2025-03-17 13:55:58,666 INFO L226 Difference]: Without dead ends: 1216 [2025-03-17 13:55:58,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-17 13:55:58,666 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1183 mSDsluCounter, 4707 mSDsCounter, 0 mSdLazyCounter, 5804 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 5446 SdHoareTripleChecker+Invalid, 5833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:58,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 5446 Invalid, 5833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5804 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 13:55:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-03-17 13:55:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1213. [2025-03-17 13:55:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 822 states have (on average 1.6581508515815084) internal successors, (1363), 1202 states have internal predecessors, (1363), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:55:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1396 transitions. [2025-03-17 13:55:58,674 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1396 transitions. Word has length 91 [2025-03-17 13:55:58,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:58,674 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1396 transitions. [2025-03-17 13:55:58,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 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:55:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1396 transitions. [2025-03-17 13:55:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:55:58,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:58,675 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:55:58,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 13:55:58,675 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:55:58,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:58,676 INFO L85 PathProgramCache]: Analyzing trace with hash -599516718, now seen corresponding path program 1 times [2025-03-17 13:55:58,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:58,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485034697] [2025-03-17 13:55:58,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:58,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:58,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:55:58,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:55:58,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:58,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:59,083 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:59,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:59,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485034697] [2025-03-17 13:55:59,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485034697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:59,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773404086] [2025-03-17 13:55:59,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:59,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:59,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:59,086 INFO L229 MonitoredProcess]: Starting monitored process 8 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:59,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 13:55:59,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:55:59,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:55:59,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:59,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:59,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 13:55:59,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:59,263 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:59,330 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:59,331 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:59,336 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:59,364 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:59,364 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 31 treesize of output 32 [2025-03-17 13:55:59,386 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:59,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-17 13:55:59,412 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:59,413 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:59,445 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:59,445 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:59,451 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:59,452 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:59,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:59,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1762 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1762) |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:59,489 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-17 13:55:59,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-03-17 13:55:59,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2025-03-17 13:55:59,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773404086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:59,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:59,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2025-03-17 13:55:59,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384878536] [2025-03-17 13:55:59,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:59,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 13:55:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:59,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 13:55:59,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=386, Unknown=17, NotChecked=82, Total=552 [2025-03-17 13:55:59,593 INFO L87 Difference]: Start difference. First operand 1213 states and 1396 transitions. Second operand has 18 states, 16 states have (on average 8.3125) internal successors, (133), 18 states have internal predecessors, (133), 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:56:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:56:01,683 INFO L93 Difference]: Finished difference Result 1215 states and 1403 transitions. [2025-03-17 13:56:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:56:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.3125) internal successors, (133), 18 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2025-03-17 13:56:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:56:01,685 INFO L225 Difference]: With dead ends: 1215 [2025-03-17 13:56:01,685 INFO L226 Difference]: Without dead ends: 1215 [2025-03-17 13:56:01,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=731, Unknown=17, NotChecked=114, Total=992 [2025-03-17 13:56:01,686 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 1157 mSDsluCounter, 7003 mSDsCounter, 0 mSdLazyCounter, 6049 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 7741 SdHoareTripleChecker+Invalid, 6094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 6049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:56:01,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 7741 Invalid, 6094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 6049 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 13:56:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-03-17 13:56:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1212. [2025-03-17 13:56:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 822 states have (on average 1.6569343065693432) internal successors, (1362), 1201 states have internal predecessors, (1362), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:56:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1395 transitions. [2025-03-17 13:56:01,696 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1395 transitions. Word has length 92 [2025-03-17 13:56:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:56:01,696 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1395 transitions. [2025-03-17 13:56:01,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.3125) internal successors, (133), 18 states have internal predecessors, (133), 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:56:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1395 transitions. [2025-03-17 13:56:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:56:01,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:56:01,697 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:56:01,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 13:56:01,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:56:01,897 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:56:01,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:56:01,898 INFO L85 PathProgramCache]: Analyzing trace with hash -599516717, now seen corresponding path program 1 times [2025-03-17 13:56:01,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:56:01,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311115904] [2025-03-17 13:56:01,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:56:01,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:56:01,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:56:01,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:56:01,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:56:01,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:56:02,402 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:56:02,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:56:02,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311115904] [2025-03-17 13:56:02,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311115904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:56:02,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041012554] [2025-03-17 13:56:02,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:56:02,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:56:02,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:56:02,404 INFO L229 MonitoredProcess]: Starting monitored process 9 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:56:02,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 13:56:02,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:56:02,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:56:02,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:56:02,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:56:02,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 13:56:02,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:56:02,595 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:56:02,663 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:56:02,664 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:56:02,667 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:56:02,686 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:56:02,690 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:56:02,742 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:56:02,744 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:56:02,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:02,812 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:56:02,815 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:56:02,873 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:02,873 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:56:02,878 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:56:02,921 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:02,921 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:56:02,924 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:56:02,963 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:02,963 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:56:02,966 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:56:02,977 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:56:02,982 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:56:02,995 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:56:02,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:56:03,056 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1931 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-03-17 13:56:03,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1929))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1928) .cse0 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1928) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2025-03-17 13:56:03,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1929))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1928) .cse1 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1928) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2025-03-17 13:56:03,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1927) .cse0 v_ArrVal_1928) (select (select (store .cse1 .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1931))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1929))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1927) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-03-17 13:56:03,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1929))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1928) .cse2 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse6 v_ArrVal_1928) (select (select (store .cse7 .cse6 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1931))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-03-17 13:56:03,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1937))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936) .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1928) (select (select (store .cse2 .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1931))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1937))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1926))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1929))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 24 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936) .cse5 v_ArrVal_1927) .cse6 v_ArrVal_1928) .cse7 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2025-03-17 13:56:03,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041012554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:56:03,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:56:03,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-03-17 13:56:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846558587] [2025-03-17 13:56:03,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:56:03,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 13:56:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:56:03,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 13:56:03,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=599, Unknown=16, NotChecked=330, Total=1056 [2025-03-17 13:56:03,194 INFO L87 Difference]: Start difference. First operand 1212 states and 1395 transitions. Second operand has 24 states, 21 states have (on average 7.0476190476190474) internal successors, (148), 24 states have internal predecessors, (148), 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:56:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:56:06,563 INFO L93 Difference]: Finished difference Result 1214 states and 1402 transitions. [2025-03-17 13:56:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:56:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.0476190476190474) internal successors, (148), 24 states have internal predecessors, (148), 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:56:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:56:06,565 INFO L225 Difference]: With dead ends: 1214 [2025-03-17 13:56:06,565 INFO L226 Difference]: Without dead ends: 1214 [2025-03-17 13:56:06,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=950, Unknown=16, NotChecked=414, Total=1560 [2025-03-17 13:56:06,566 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 1160 mSDsluCounter, 6813 mSDsCounter, 0 mSdLazyCounter, 8727 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 7550 SdHoareTripleChecker+Invalid, 8775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 8727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:56:06,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 7550 Invalid, 8775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 8727 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 13:56:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-17 13:56:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1196. [2025-03-17 13:56:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 808 states have (on average 1.6658415841584158) internal successors, (1346), 1186 states have internal predecessors, (1346), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 13:56:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1378 transitions. [2025-03-17 13:56:06,574 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1378 transitions. Word has length 92 [2025-03-17 13:56:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:56:06,574 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1378 transitions. [2025-03-17 13:56:06,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.0476190476190474) internal successors, (148), 24 states have internal predecessors, (148), 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:56:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1378 transitions. [2025-03-17 13:56:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:56:06,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:56:06,575 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:56:06,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 13:56:06,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 13:56:06,776 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr513REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:56:06,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:56:06,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1732061926, now seen corresponding path program 1 times [2025-03-17 13:56:06,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:56:06,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136625511] [2025-03-17 13:56:06,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:56:06,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:56:06,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:56:06,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:56:06,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:56:06,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:56:07,271 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:56:07,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:56:07,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136625511] [2025-03-17 13:56:07,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136625511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:56:07,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:56:07,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 13:56:07,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25532786] [2025-03-17 13:56:07,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:56:07,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 13:56:07,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:56:07,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 13:56:07,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-17 13:56:07,273 INFO L87 Difference]: Start difference. First operand 1196 states and 1378 transitions. Second operand has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:56:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:56:09,009 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2025-03-17 13:56:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:56:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-03-17 13:56:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:56:09,011 INFO L225 Difference]: With dead ends: 1219 [2025-03-17 13:56:09,011 INFO L226 Difference]: Without dead ends: 1219 [2025-03-17 13:56:09,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-03-17 13:56:09,012 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 1185 mSDsluCounter, 5582 mSDsCounter, 0 mSdLazyCounter, 5064 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 6313 SdHoareTripleChecker+Invalid, 5096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 5064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:56:09,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 6313 Invalid, 5096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 5064 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 13:56:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-17 13:56:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1215. [2025-03-17 13:56:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 826 states have (on average 1.6537530266343825) internal successors, (1366), 1204 states have internal predecessors, (1366), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:56:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1399 transitions. [2025-03-17 13:56:09,029 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1399 transitions. Word has length 95 [2025-03-17 13:56:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:56:09,029 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1399 transitions. [2025-03-17 13:56:09,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:56:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1399 transitions. [2025-03-17 13:56:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:56:09,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:56:09,030 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:56:09,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 13:56:09,030 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:56:09,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:56:09,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1732061927, now seen corresponding path program 1 times [2025-03-17 13:56:09,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:56:09,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817811227] [2025-03-17 13:56:09,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:56:09,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:56:09,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:56:09,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:56:09,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:56:09,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:56:09,694 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:56:09,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:56:09,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817811227] [2025-03-17 13:56:09,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817811227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:56:09,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:56:09,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 13:56:09,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112728606] [2025-03-17 13:56:09,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:56:09,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 13:56:09,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:56:09,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 13:56:09,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-17 13:56:09,695 INFO L87 Difference]: Start difference. First operand 1215 states and 1399 transitions. Second operand has 18 states, 16 states have (on average 5.8125) internal successors, (93), 17 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:56:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:56:13,050 INFO L93 Difference]: Finished difference Result 1218 states and 1406 transitions. [2025-03-17 13:56:13,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:56:13,050 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.8125) internal successors, (93), 17 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-03-17 13:56:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:56:13,052 INFO L225 Difference]: With dead ends: 1218 [2025-03-17 13:56:13,052 INFO L226 Difference]: Without dead ends: 1218 [2025-03-17 13:56:13,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-17 13:56:13,053 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 1169 mSDsluCounter, 6724 mSDsCounter, 0 mSdLazyCounter, 8867 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 7456 SdHoareTripleChecker+Invalid, 8902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 8867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:56:13,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 7456 Invalid, 8902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 8867 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 13:56:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-03-17 13:56:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1215. [2025-03-17 13:56:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 826 states have (on average 1.652542372881356) internal successors, (1365), 1204 states have internal predecessors, (1365), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:56:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1398 transitions. [2025-03-17 13:56:13,061 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1398 transitions. Word has length 95 [2025-03-17 13:56:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:56:13,061 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1398 transitions. [2025-03-17 13:56:13,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.8125) internal successors, (93), 17 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:56:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1398 transitions. [2025-03-17 13:56:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 13:56:13,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:56:13,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:56:13,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 13:56:13,062 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr513REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:56:13,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:56:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2004718964, now seen corresponding path program 1 times [2025-03-17 13:56:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:56:13,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431207937] [2025-03-17 13:56:13,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:56:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:56:13,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:56:13,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:56:13,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:56:13,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:56:13,488 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:56:13,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:56:13,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431207937] [2025-03-17 13:56:13,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431207937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:56:13,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446929858] [2025-03-17 13:56:13,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:56:13,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:56:13,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:56:13,490 INFO L229 MonitoredProcess]: Starting monitored process 10 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:56:13,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 13:56:13,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:56:13,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:56:13,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:56:13,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:56:13,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 13:56:13,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:56:13,692 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:56:13,746 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:56:13,746 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:56:13,749 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:56:13,803 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:13,803 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:56:13,833 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:13,833 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:56:13,865 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:13,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:56:13,899 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:13,899 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:56:13,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:13,935 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:56:13,942 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:56:13,954 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:56:13,954 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 19 treesize of output 16 [2025-03-17 13:56:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:56:13,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:56:18,463 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-03-17 13:56:18,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2025-03-17 13:56:18,473 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2273 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2273))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2266)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2267)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2268)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2269)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-03-17 13:56:18,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446929858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:56:18,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:56:18,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 22 [2025-03-17 13:56:18,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667035265] [2025-03-17 13:56:18,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:56:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 13:56:18,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:56:18,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 13:56:18,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=870, Unknown=44, NotChecked=62, Total=1122 [2025-03-17 13:56:18,475 INFO L87 Difference]: Start difference. First operand 1215 states and 1398 transitions. Second operand has 23 states, 21 states have (on average 6.904761904761905) internal successors, (145), 23 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:56:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:56:21,104 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2025-03-17 13:56:21,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 13:56:21,104 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.904761904761905) internal successors, (145), 23 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2025-03-17 13:56:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:56:21,106 INFO L225 Difference]: With dead ends: 1217 [2025-03-17 13:56:21,106 INFO L226 Difference]: Without dead ends: 1217 [2025-03-17 13:56:21,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=266, Invalid=1500, Unknown=44, NotChecked=82, Total=1892 [2025-03-17 13:56:21,107 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 1158 mSDsluCounter, 7643 mSDsCounter, 0 mSdLazyCounter, 6695 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 8374 SdHoareTripleChecker+Invalid, 6742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 6695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:56:21,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 8374 Invalid, 6742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 6695 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 13:56:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-17 13:56:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1214. [2025-03-17 13:56:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 826 states have (on average 1.6513317191283292) internal successors, (1364), 1203 states have internal predecessors, (1364), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-17 13:56:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1397 transitions. [2025-03-17 13:56:21,117 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1397 transitions. Word has length 96 [2025-03-17 13:56:21,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:56:21,117 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1397 transitions. [2025-03-17 13:56:21,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.904761904761905) internal successors, (145), 23 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:56:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1397 transitions. [2025-03-17 13:56:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 13:56:21,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:56:21,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:56:21,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 13:56:21,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:56:21,318 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-17 13:56:21,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:56:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2004718963, now seen corresponding path program 1 times [2025-03-17 13:56:21,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:56:21,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735366973] [2025-03-17 13:56:21,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:56:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:56:21,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:56:21,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:56:21,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:56:21,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:56:22,003 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:56:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:56:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735366973] [2025-03-17 13:56:22,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735366973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:56:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717795170] [2025-03-17 13:56:22,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:56:22,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:56:22,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:56:22,005 INFO L229 MonitoredProcess]: Starting monitored process 11 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:56:22,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 13:56:22,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:56:22,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:56:22,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:56:22,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:56:22,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-17 13:56:22,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:56:22,205 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:56:22,277 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:56:22,283 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:56:22,283 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:56:22,302 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:56:22,304 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:56:22,358 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:56:22,360 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:56:22,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:22,473 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 73 treesize of output 66 [2025-03-17 13:56:22,477 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:56:22,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:22,560 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 73 treesize of output 66 [2025-03-17 13:56:22,566 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:56:22,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:22,657 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 73 treesize of output 66 [2025-03-17 13:56:22,665 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:56:22,735 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:22,735 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 73 treesize of output 66 [2025-03-17 13:56:22,740 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:56:22,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:56:22,840 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 73 treesize of output 66 [2025-03-17 13:56:22,846 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:56:22,874 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 42 treesize of output 18 [2025-03-17 13:56:22,881 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:56:22,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:56:22,932 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-17 13:56:22,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2025-03-17 13:56:22,942 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:56:22,942 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:56:22,968 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:56:22,968 INFO L312 TraceCheckSpWp]: Computing backward predicates...