./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:11:15,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:11:16,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:11:16,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:11:16,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:11:16,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:11:16,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:11:16,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:11:16,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:11:16,055 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:11:16,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:11:16,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:11:16,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:11:16,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:11:16,057 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:11:16,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:11:16,057 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:11:16,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:11:16,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:11:16,058 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:11:16,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:11:16,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:11:16,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:11:16,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:11:16,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:11:16,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:11:16,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:11:16,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:11:16,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:11:16,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:11:16,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:11:16,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:11:16,060 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-02-06 12:11:16,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:11:16,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:11:16,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:11:16,304 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:11:16,304 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:11:16,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2025-02-06 12:11:17,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ab17b39a/40872fedc6b740a5bee0e18a3c2158d5/FLAGf7602428c [2025-02-06 12:11:17,703 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:11:17,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2025-02-06 12:11:17,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ab17b39a/40872fedc6b740a5bee0e18a3c2158d5/FLAGf7602428c [2025-02-06 12:11:18,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ab17b39a/40872fedc6b740a5bee0e18a3c2158d5 [2025-02-06 12:11:18,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:11:18,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:11:18,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:11:18,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:11:18,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:11:18,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba46848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18, skipping insertion in model container [2025-02-06 12:11:18,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:11:18,264 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:11:18,294 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:11:18,296 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:11:18,300 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:11:18,305 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:11:18,324 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:11:18,324 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:11:18,326 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:11:18,327 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:11:18,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:11:18,342 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:11:18,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:11:18,456 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:11:18,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18 WrapperNode [2025-02-06 12:11:18,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:11:18,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:11:18,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:11:18,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:11:18,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,526 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1251 [2025-02-06 12:11:18,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:11:18,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:11:18,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:11:18,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:11:18,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,598 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-02-06 12:11:18,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,635 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:11:18,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:11:18,662 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:11:18,662 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:11:18,663 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (1/1) ... [2025-02-06 12:11:18,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:11:18,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:11:18,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:11:18,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:11:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 12:11:18,718 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 12:11:18,718 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 12:11:18,718 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:11:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:11:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:11:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:11:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:11:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:11:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:11:18,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:11:18,874 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:11:18,875 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:11:20,356 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 12:11:20,445 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2025-02-06 12:11:20,445 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:11:20,501 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:11:20,502 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 12:11:20,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:11:20 BoogieIcfgContainer [2025-02-06 12:11:20,503 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:11:20,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:11:20,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:11:20,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:11:20,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:11:18" (1/3) ... [2025-02-06 12:11:20,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c81ec82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:11:20, skipping insertion in model container [2025-02-06 12:11:20,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:11:18" (2/3) ... [2025-02-06 12:11:20,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c81ec82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:11:20, skipping insertion in model container [2025-02-06 12:11:20,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:11:20" (3/3) ... [2025-02-06 12:11:20,510 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2025-02-06 12:11:20,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:11:20,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test2-1.i that has 4 procedures, 1072 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2025-02-06 12:11:20,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:11:20,573 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;@779fdd20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:11:20,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2025-02-06 12:11:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 1062 states, 640 states have (on average 1.99375) internal successors, (1276), 1057 states have internal predecessors, (1276), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 12:11:20,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:20,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 12:11:20,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:20,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:20,587 INFO L85 PathProgramCache]: Analyzing trace with hash 41956222, now seen corresponding path program 1 times [2025-02-06 12:11:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:20,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059145941] [2025-02-06 12:11:20,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:20,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:20,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:11:20,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:11:20,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:20,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:20,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:20,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059145941] [2025-02-06 12:11:20,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059145941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:20,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:20,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:11:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205627309] [2025-02-06 12:11:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:20,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:11:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:20,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:11:20,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:11:20,819 INFO L87 Difference]: Start difference. First operand has 1062 states, 640 states have (on average 1.99375) internal successors, (1276), 1057 states have internal predecessors, (1276), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-02-06 12:11:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:21,695 INFO L93 Difference]: Finished difference Result 1363 states and 1616 transitions. [2025-02-06 12:11:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:11:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-02-06 12:11:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:21,727 INFO L225 Difference]: With dead ends: 1363 [2025-02-06 12:11:21,727 INFO L226 Difference]: Without dead ends: 1359 [2025-02-06 12:11:21,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:11:21,730 INFO L435 NwaCegarLoop]: 1066 mSDtfsCounter, 387 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2552 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:21,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2552 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:11:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-02-06 12:11:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1274. [2025-02-06 12:11:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 858 states have (on average 1.867132867132867) internal successors, (1602), 1269 states have internal predecessors, (1602), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1608 transitions. [2025-02-06 12:11:21,830 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1608 transitions. Word has length 4 [2025-02-06 12:11:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:21,831 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1608 transitions. [2025-02-06 12:11:21,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-02-06 12:11:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1608 transitions. [2025-02-06 12:11:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 12:11:21,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:21,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 12:11:21,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:11:21,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:21,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:21,832 INFO L85 PathProgramCache]: Analyzing trace with hash 41957565, now seen corresponding path program 1 times [2025-02-06 12:11:21,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:21,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620537235] [2025-02-06 12:11:21,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:21,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:21,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:11:21,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:11:21,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:21,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:21,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620537235] [2025-02-06 12:11:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620537235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:21,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:11:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111736482] [2025-02-06 12:11:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:21,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:11:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:21,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:11:21,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:21,927 INFO L87 Difference]: Start difference. First operand 1274 states and 1608 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-02-06 12:11:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:22,529 INFO L93 Difference]: Finished difference Result 1358 states and 1603 transitions. [2025-02-06 12:11:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:11:22,530 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-02-06 12:11:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:22,534 INFO L225 Difference]: With dead ends: 1358 [2025-02-06 12:11:22,536 INFO L226 Difference]: Without dead ends: 1358 [2025-02-06 12:11:22,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:22,538 INFO L435 NwaCegarLoop]: 1072 mSDtfsCounter, 385 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:22,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1814 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:11:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-02-06 12:11:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1273. [2025-02-06 12:11:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 858 states have (on average 1.858974358974359) internal successors, (1595), 1268 states have internal predecessors, (1595), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1601 transitions. [2025-02-06 12:11:22,568 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1601 transitions. Word has length 4 [2025-02-06 12:11:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:22,571 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1601 transitions. [2025-02-06 12:11:22,571 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-02-06 12:11:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1601 transitions. [2025-02-06 12:11:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 12:11:22,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:22,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 12:11:22,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:11:22,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:22,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:22,576 INFO L85 PathProgramCache]: Analyzing trace with hash 41957564, now seen corresponding path program 1 times [2025-02-06 12:11:22,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:22,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940137414] [2025-02-06 12:11:22,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:22,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:22,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:11:22,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:11:22,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:22,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:22,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:22,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940137414] [2025-02-06 12:11:22,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940137414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:22,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:22,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:11:22,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121582282] [2025-02-06 12:11:22,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:22,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:11:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:22,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:11:22,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:22,623 INFO L87 Difference]: Start difference. First operand 1273 states and 1601 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-02-06 12:11:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:23,122 INFO L93 Difference]: Finished difference Result 1270 states and 1593 transitions. [2025-02-06 12:11:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:11:23,122 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-02-06 12:11:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:23,127 INFO L225 Difference]: With dead ends: 1270 [2025-02-06 12:11:23,127 INFO L226 Difference]: Without dead ends: 1270 [2025-02-06 12:11:23,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:23,128 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1095 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:23,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 829 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:11:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2025-02-06 12:11:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2025-02-06 12:11:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 866 states have (on average 1.8325635103926097) internal successors, (1587), 1265 states have internal predecessors, (1587), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1593 transitions. [2025-02-06 12:11:23,150 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1593 transitions. Word has length 4 [2025-02-06 12:11:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:23,150 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1593 transitions. [2025-02-06 12:11:23,150 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-02-06 12:11:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1593 transitions. [2025-02-06 12:11:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:11:23,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:23,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:23,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:11:23,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:23,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1488252626, now seen corresponding path program 1 times [2025-02-06 12:11:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:23,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569454114] [2025-02-06 12:11:23,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:23,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:23,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:11:23,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:11:23,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:23,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:23,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:23,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569454114] [2025-02-06 12:11:23,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569454114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:23,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:23,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:11:23,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736157186] [2025-02-06 12:11:23,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:23,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:11:23,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:23,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:11:23,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:23,312 INFO L87 Difference]: Start difference. First operand 1270 states and 1593 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:24,194 INFO L93 Difference]: Finished difference Result 1344 states and 1583 transitions. [2025-02-06 12:11:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:11:24,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:11:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:24,198 INFO L225 Difference]: With dead ends: 1344 [2025-02-06 12:11:24,198 INFO L226 Difference]: Without dead ends: 1344 [2025-02-06 12:11:24,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:11:24,199 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 3346 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3346 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:24,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3346 Valid, 1050 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:11:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2025-02-06 12:11:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1259. [2025-02-06 12:11:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 866 states have (on average 1.8187066974595842) internal successors, (1575), 1254 states have internal predecessors, (1575), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1581 transitions. [2025-02-06 12:11:24,217 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1581 transitions. Word has length 9 [2025-02-06 12:11:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:24,217 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1581 transitions. [2025-02-06 12:11:24,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1581 transitions. [2025-02-06 12:11:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 12:11:24,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:24,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:24,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:11:24,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr412REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:24,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1108810098, now seen corresponding path program 1 times [2025-02-06 12:11:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:24,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717363587] [2025-02-06 12:11:24,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:24,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:11:24,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:11:24,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:24,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:24,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717363587] [2025-02-06 12:11:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717363587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:24,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:11:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128228785] [2025-02-06 12:11:24,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:24,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:11:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:24,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:11:24,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:24,274 INFO L87 Difference]: Start difference. First operand 1259 states and 1581 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 12:11:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:24,815 INFO L93 Difference]: Finished difference Result 1297 states and 1536 transitions. [2025-02-06 12:11:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:11:24,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 12:11:24,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:24,822 INFO L225 Difference]: With dead ends: 1297 [2025-02-06 12:11:24,823 INFO L226 Difference]: Without dead ends: 1297 [2025-02-06 12:11:24,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:24,823 INFO L435 NwaCegarLoop]: 1065 mSDtfsCounter, 1069 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:24,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1347 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:11:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-02-06 12:11:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1212. [2025-02-06 12:11:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 866 states have (on average 1.7644341801385681) internal successors, (1528), 1207 states have internal predecessors, (1528), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1534 transitions. [2025-02-06 12:11:24,845 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1534 transitions. Word has length 10 [2025-02-06 12:11:24,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:24,845 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1534 transitions. [2025-02-06 12:11:24,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 12:11:24,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1534 transitions. [2025-02-06 12:11:24,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 12:11:24,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:24,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:24,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:11:24,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr413REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:24,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:24,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1108810099, now seen corresponding path program 1 times [2025-02-06 12:11:24,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:24,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519652056] [2025-02-06 12:11:24,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:24,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:24,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:11:24,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:11:24,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:24,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:24,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:24,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519652056] [2025-02-06 12:11:24,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519652056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:24,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:24,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:11:24,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808586792] [2025-02-06 12:11:24,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:24,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:11:24,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:24,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:11:24,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:24,912 INFO L87 Difference]: Start difference. First operand 1212 states and 1534 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 12:11:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:25,390 INFO L93 Difference]: Finished difference Result 1502 states and 1900 transitions. [2025-02-06 12:11:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:11:25,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 12:11:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:25,395 INFO L225 Difference]: With dead ends: 1502 [2025-02-06 12:11:25,395 INFO L226 Difference]: Without dead ends: 1502 [2025-02-06 12:11:25,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:25,396 INFO L435 NwaCegarLoop]: 1198 mSDtfsCounter, 860 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:25,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1596 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:11:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-02-06 12:11:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1187. [2025-02-06 12:11:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 866 states have (on average 1.7355658198614319) internal successors, (1503), 1182 states have internal predecessors, (1503), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1509 transitions. [2025-02-06 12:11:25,417 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1509 transitions. Word has length 10 [2025-02-06 12:11:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:25,417 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1509 transitions. [2025-02-06 12:11:25,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 12:11:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1509 transitions. [2025-02-06 12:11:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 12:11:25,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:25,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:25,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:11:25,418 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:25,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:25,419 INFO L85 PathProgramCache]: Analyzing trace with hash -353540371, now seen corresponding path program 1 times [2025-02-06 12:11:25,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:25,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453850681] [2025-02-06 12:11:25,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:25,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:25,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:11:25,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:11:25,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:25,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:25,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453850681] [2025-02-06 12:11:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453850681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:25,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:25,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:11:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045695722] [2025-02-06 12:11:25,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:25,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:11:25,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:25,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:11:25,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:11:25,480 INFO L87 Difference]: Start difference. First operand 1187 states and 1509 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:25,950 INFO L93 Difference]: Finished difference Result 1262 states and 1615 transitions. [2025-02-06 12:11:25,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:11:25,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-02-06 12:11:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:25,957 INFO L225 Difference]: With dead ends: 1262 [2025-02-06 12:11:25,958 INFO L226 Difference]: Without dead ends: 1262 [2025-02-06 12:11:25,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:25,958 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 1292 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:25,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 1344 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:11:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2025-02-06 12:11:25,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1164. [2025-02-06 12:11:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 866 states have (on average 1.6824480369515011) internal successors, (1457), 1159 states have internal predecessors, (1457), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1463 transitions. [2025-02-06 12:11:25,973 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1463 transitions. Word has length 16 [2025-02-06 12:11:25,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:25,973 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1463 transitions. [2025-02-06 12:11:25,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1463 transitions. [2025-02-06 12:11:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 12:11:25,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:25,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:25,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:11:25,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:25,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash -353540370, now seen corresponding path program 1 times [2025-02-06 12:11:25,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:25,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351738949] [2025-02-06 12:11:25,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:25,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:11:25,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:11:25,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:25,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:26,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:26,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351738949] [2025-02-06 12:11:26,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351738949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:26,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:26,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:11:26,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474490731] [2025-02-06 12:11:26,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:26,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:11:26,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:26,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:11:26,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:26,017 INFO L87 Difference]: Start difference. First operand 1164 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:26,072 INFO L93 Difference]: Finished difference Result 1026 states and 1257 transitions. [2025-02-06 12:11:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:11:26,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-02-06 12:11:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:26,075 INFO L225 Difference]: With dead ends: 1026 [2025-02-06 12:11:26,075 INFO L226 Difference]: Without dead ends: 1026 [2025-02-06 12:11:26,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:26,076 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 60 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:26,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1845 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:11:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-02-06 12:11:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2025-02-06 12:11:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 740 states have (on average 1.6905405405405405) internal successors, (1251), 1021 states have internal predecessors, (1251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1257 transitions. [2025-02-06 12:11:26,088 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1257 transitions. Word has length 16 [2025-02-06 12:11:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:26,088 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1257 transitions. [2025-02-06 12:11:26,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1257 transitions. [2025-02-06 12:11:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 12:11:26,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:26,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:26,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:11:26,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:26,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1925025705, now seen corresponding path program 1 times [2025-02-06 12:11:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498480491] [2025-02-06 12:11:26,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:26,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:11:26,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:11:26,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:26,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:26,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:26,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498480491] [2025-02-06 12:11:26,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498480491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:26,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:26,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:11:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103164671] [2025-02-06 12:11:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:26,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:11:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:26,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:11:26,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:11:26,161 INFO L87 Difference]: Start difference. First operand 1026 states and 1257 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:26,254 INFO L93 Difference]: Finished difference Result 997 states and 1207 transitions. [2025-02-06 12:11:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:11:26,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-02-06 12:11:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:26,257 INFO L225 Difference]: With dead ends: 997 [2025-02-06 12:11:26,257 INFO L226 Difference]: Without dead ends: 997 [2025-02-06 12:11:26,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:26,258 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 41 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:26,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2714 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:11:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-02-06 12:11:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 991. [2025-02-06 12:11:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 712 states have (on average 1.678370786516854) internal successors, (1195), 986 states have internal predecessors, (1195), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1201 transitions. [2025-02-06 12:11:26,272 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1201 transitions. Word has length 17 [2025-02-06 12:11:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:26,272 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1201 transitions. [2025-02-06 12:11:26,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1201 transitions. [2025-02-06 12:11:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 12:11:26,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:26,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:26,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:11:26,273 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:26,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2013751675, now seen corresponding path program 1 times [2025-02-06 12:11:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:26,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434354666] [2025-02-06 12:11:26,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:26,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:11:26,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:11:26,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:26,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:26,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:26,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434354666] [2025-02-06 12:11:26,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434354666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:26,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:26,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:11:26,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789302317] [2025-02-06 12:11:26,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:26,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:11:26,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:26,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:11:26,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:11:26,344 INFO L87 Difference]: Start difference. First operand 991 states and 1201 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:26,801 INFO L93 Difference]: Finished difference Result 1060 states and 1256 transitions. [2025-02-06 12:11:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:11:26,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 12:11:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:26,804 INFO L225 Difference]: With dead ends: 1060 [2025-02-06 12:11:26,804 INFO L226 Difference]: Without dead ends: 1060 [2025-02-06 12:11:26,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:26,805 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 1179 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:26,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1592 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:11:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-02-06 12:11:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 968. [2025-02-06 12:11:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 712 states have (on average 1.646067415730337) internal successors, (1172), 963 states have internal predecessors, (1172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1178 transitions. [2025-02-06 12:11:26,819 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1178 transitions. Word has length 20 [2025-02-06 12:11:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:26,819 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1178 transitions. [2025-02-06 12:11:26,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1178 transitions. [2025-02-06 12:11:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 12:11:26,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:26,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:26,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:11:26,821 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr405REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:26,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2013751674, now seen corresponding path program 1 times [2025-02-06 12:11:26,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:26,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894703409] [2025-02-06 12:11:26,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:26,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:11:26,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:11:26,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:26,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:26,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-02-06 12:11:26,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:26,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894703409] [2025-02-06 12:11:26,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894703409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:26,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:26,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:11:26,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661925830] [2025-02-06 12:11:26,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:26,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:11:26,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:26,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:11:26,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:26,877 INFO L87 Difference]: Start difference. First operand 968 states and 1178 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:26,917 INFO L93 Difference]: Finished difference Result 893 states and 1075 transitions. [2025-02-06 12:11:26,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:11:26,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 12:11:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:26,919 INFO L225 Difference]: With dead ends: 893 [2025-02-06 12:11:26,919 INFO L226 Difference]: Without dead ends: 893 [2025-02-06 12:11:26,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:26,920 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 60 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:26,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1555 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:11:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-02-06 12:11:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2025-02-06 12:11:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 649 states have (on average 1.6471494607087827) internal successors, (1069), 888 states have internal predecessors, (1069), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1075 transitions. [2025-02-06 12:11:26,957 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1075 transitions. Word has length 20 [2025-02-06 12:11:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:26,958 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1075 transitions. [2025-02-06 12:11:26,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1075 transitions. [2025-02-06 12:11:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 12:11:26,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:26,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:26,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:11:26,960 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:26,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:26,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1998083685, now seen corresponding path program 1 times [2025-02-06 12:11:26,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:26,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927837658] [2025-02-06 12:11:26,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:26,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:11:26,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:11:26,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:26,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927837658] [2025-02-06 12:11:27,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927837658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:27,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:27,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:11:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316763185] [2025-02-06 12:11:27,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:27,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:11:27,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:27,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:11:27,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:11:27,014 INFO L87 Difference]: Start difference. First operand 893 states and 1075 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:27,090 INFO L93 Difference]: Finished difference Result 878 states and 1053 transitions. [2025-02-06 12:11:27,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:11:27,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 12:11:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:27,092 INFO L225 Difference]: With dead ends: 878 [2025-02-06 12:11:27,093 INFO L226 Difference]: Without dead ends: 878 [2025-02-06 12:11:27,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:27,093 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 45 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:27,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2275 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:11:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-02-06 12:11:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2025-02-06 12:11:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 641 states have (on average 1.6333853354134165) internal successors, (1047), 873 states have internal predecessors, (1047), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1053 transitions. [2025-02-06 12:11:27,102 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1053 transitions. Word has length 21 [2025-02-06 12:11:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:27,103 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1053 transitions. [2025-02-06 12:11:27,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1053 transitions. [2025-02-06 12:11:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 12:11:27,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:27,103 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] [2025-02-06 12:11:27,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:11:27,104 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:27,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1915344769, now seen corresponding path program 1 times [2025-02-06 12:11:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:27,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678947681] [2025-02-06 12:11:27,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:27,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:27,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:11:27,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:11:27,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:27,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:27,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:27,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678947681] [2025-02-06 12:11:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678947681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:27,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:27,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:11:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650375831] [2025-02-06 12:11:27,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:27,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:11:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:27,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:11:27,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:11:27,226 INFO L87 Difference]: Start difference. First operand 878 states and 1053 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:27,691 INFO L93 Difference]: Finished difference Result 966 states and 1127 transitions. [2025-02-06 12:11:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:11:27,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2025-02-06 12:11:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:27,693 INFO L225 Difference]: With dead ends: 966 [2025-02-06 12:11:27,693 INFO L226 Difference]: Without dead ends: 966 [2025-02-06 12:11:27,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:27,694 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 384 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:27,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1701 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:11:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-02-06 12:11:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 878. [2025-02-06 12:11:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 641 states have (on average 1.6271450858034322) internal successors, (1043), 873 states have internal predecessors, (1043), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1049 transitions. [2025-02-06 12:11:27,716 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1049 transitions. Word has length 31 [2025-02-06 12:11:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:27,717 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1049 transitions. [2025-02-06 12:11:27,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1049 transitions. [2025-02-06 12:11:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 12:11:27,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:27,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:27,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:11:27,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr367REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:27,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1656635323, now seen corresponding path program 1 times [2025-02-06 12:11:27,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:27,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034706588] [2025-02-06 12:11:27,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:27,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 12:11:27,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 12:11:27,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:27,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:27,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034706588] [2025-02-06 12:11:27,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034706588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:27,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:27,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:11:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060177049] [2025-02-06 12:11:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:27,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:11:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:27,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:11:27,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:11:27,848 INFO L87 Difference]: Start difference. First operand 878 states and 1049 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:28,309 INFO L93 Difference]: Finished difference Result 1119 states and 1358 transitions. [2025-02-06 12:11:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:11:28,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-06 12:11:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:28,312 INFO L225 Difference]: With dead ends: 1119 [2025-02-06 12:11:28,312 INFO L226 Difference]: Without dead ends: 1119 [2025-02-06 12:11:28,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:28,313 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 707 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:28,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1745 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:11:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2025-02-06 12:11:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 874. [2025-02-06 12:11:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 641 states have (on average 1.6209048361934477) internal successors, (1039), 869 states have internal predecessors, (1039), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1045 transitions. [2025-02-06 12:11:28,326 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1045 transitions. Word has length 35 [2025-02-06 12:11:28,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:28,326 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1045 transitions. [2025-02-06 12:11:28,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1045 transitions. [2025-02-06 12:11:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 12:11:28,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:28,329 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] [2025-02-06 12:11:28,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:11:28,330 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:28,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:28,330 INFO L85 PathProgramCache]: Analyzing trace with hash 978277457, now seen corresponding path program 1 times [2025-02-06 12:11:28,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:28,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334514260] [2025-02-06 12:11:28,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:28,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:28,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 12:11:28,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 12:11:28,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:28,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:28,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334514260] [2025-02-06 12:11:28,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334514260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:28,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:28,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:11:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510032985] [2025-02-06 12:11:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:28,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:11:28,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:28,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:11:28,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:11:28,431 INFO L87 Difference]: Start difference. First operand 874 states and 1045 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:28,494 INFO L93 Difference]: Finished difference Result 874 states and 1037 transitions. [2025-02-06 12:11:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:11:28,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-02-06 12:11:28,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:28,497 INFO L225 Difference]: With dead ends: 874 [2025-02-06 12:11:28,497 INFO L226 Difference]: Without dead ends: 874 [2025-02-06 12:11:28,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:28,498 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 27 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:28,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2255 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:11:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-02-06 12:11:28,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-02-06 12:11:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 641 states have (on average 1.608424336973479) internal successors, (1031), 869 states have internal predecessors, (1031), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1037 transitions. [2025-02-06 12:11:28,507 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1037 transitions. Word has length 64 [2025-02-06 12:11:28,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:28,508 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1037 transitions. [2025-02-06 12:11:28,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1037 transitions. [2025-02-06 12:11:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 12:11:28,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:28,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:28,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:11:28,509 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr352REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:28,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:28,509 INFO L85 PathProgramCache]: Analyzing trace with hash -561608348, now seen corresponding path program 1 times [2025-02-06 12:11:28,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:28,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778990232] [2025-02-06 12:11:28,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:28,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:28,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 12:11:28,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 12:11:28,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:28,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:28,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:28,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778990232] [2025-02-06 12:11:28,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778990232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:28,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:28,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:11:28,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832840115] [2025-02-06 12:11:28,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:28,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:11:28,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:28,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:11:28,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:11:28,589 INFO L87 Difference]: Start difference. First operand 874 states and 1037 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:28,658 INFO L93 Difference]: Finished difference Result 868 states and 1027 transitions. [2025-02-06 12:11:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:11:28,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-06 12:11:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:28,661 INFO L225 Difference]: With dead ends: 868 [2025-02-06 12:11:28,661 INFO L226 Difference]: Without dead ends: 868 [2025-02-06 12:11:28,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:28,662 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 21 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:28,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2249 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:11:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-02-06 12:11:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2025-02-06 12:11:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 635 states have (on average 1.6078740157480316) internal successors, (1021), 863 states have internal predecessors, (1021), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1027 transitions. [2025-02-06 12:11:28,671 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1027 transitions. Word has length 70 [2025-02-06 12:11:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:28,672 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1027 transitions. [2025-02-06 12:11:28,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1027 transitions. [2025-02-06 12:11:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 12:11:28,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:28,673 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] [2025-02-06 12:11:28,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:11:28,673 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:28,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1762600457, now seen corresponding path program 1 times [2025-02-06 12:11:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:28,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336947426] [2025-02-06 12:11:28,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:28,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:28,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 12:11:28,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 12:11:28,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:28,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:28,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336947426] [2025-02-06 12:11:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336947426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:28,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:28,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:11:28,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619125854] [2025-02-06 12:11:28,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:28,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:11:28,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:28,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:11:28,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:28,734 INFO L87 Difference]: Start difference. First operand 868 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:28,815 INFO L93 Difference]: Finished difference Result 1028 states and 1196 transitions. [2025-02-06 12:11:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:11:28,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2025-02-06 12:11:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:28,817 INFO L225 Difference]: With dead ends: 1028 [2025-02-06 12:11:28,817 INFO L226 Difference]: Without dead ends: 1028 [2025-02-06 12:11:28,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:11:28,818 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 198 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:28,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1508 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:11:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-02-06 12:11:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1018. [2025-02-06 12:11:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 785 states have (on average 1.5108280254777071) internal successors, (1186), 1013 states have internal predecessors, (1186), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1192 transitions. [2025-02-06 12:11:28,829 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1192 transitions. Word has length 72 [2025-02-06 12:11:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:28,829 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1192 transitions. [2025-02-06 12:11:28,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1192 transitions. [2025-02-06 12:11:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:11:28,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:28,830 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] [2025-02-06 12:11:28,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:11:28,830 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:28,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash -449089673, now seen corresponding path program 1 times [2025-02-06 12:11:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:28,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302869281] [2025-02-06 12:11:28,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:28,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 12:11:28,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:11:28,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:28,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:29,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:29,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302869281] [2025-02-06 12:11:29,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302869281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:29,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:29,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:11:29,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407650433] [2025-02-06 12:11:29,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:29,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:11:29,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:29,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:11:29,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:11:29,156 INFO L87 Difference]: Start difference. First operand 1018 states and 1192 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:29,271 INFO L93 Difference]: Finished difference Result 1498 states and 1702 transitions. [2025-02-06 12:11:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:11:29,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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 77 [2025-02-06 12:11:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:29,275 INFO L225 Difference]: With dead ends: 1498 [2025-02-06 12:11:29,275 INFO L226 Difference]: Without dead ends: 1494 [2025-02-06 12:11:29,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:11:29,276 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 734 mSDsluCounter, 2256 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:29,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 3010 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:11:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2025-02-06 12:11:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 919. [2025-02-06 12:11:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 686 states have (on average 1.5422740524781342) internal successors, (1058), 914 states have internal predecessors, (1058), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1064 transitions. [2025-02-06 12:11:29,287 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1064 transitions. Word has length 77 [2025-02-06 12:11:29,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:29,287 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1064 transitions. [2025-02-06 12:11:29,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:29,288 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1064 transitions. [2025-02-06 12:11:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 12:11:29,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:29,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:29,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:11:29,288 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:29,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:29,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1820432039, now seen corresponding path program 1 times [2025-02-06 12:11:29,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:29,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777157994] [2025-02-06 12:11:29,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:29,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:29,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:11:29,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:11:29,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:29,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:29,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777157994] [2025-02-06 12:11:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777157994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:29,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:29,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:11:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129966870] [2025-02-06 12:11:29,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:29,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:11:29,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:29,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:11:29,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:29,497 INFO L87 Difference]: Start difference. First operand 919 states and 1064 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:29,961 INFO L93 Difference]: Finished difference Result 918 states and 1063 transitions. [2025-02-06 12:11:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:11:29,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-06 12:11:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:29,964 INFO L225 Difference]: With dead ends: 918 [2025-02-06 12:11:29,964 INFO L226 Difference]: Without dead ends: 918 [2025-02-06 12:11:29,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:11:29,964 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 2 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:29,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2227 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:11:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-02-06 12:11:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2025-02-06 12:11:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 686 states have (on average 1.5408163265306123) internal successors, (1057), 913 states have internal predecessors, (1057), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1063 transitions. [2025-02-06 12:11:29,973 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1063 transitions. Word has length 86 [2025-02-06 12:11:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:29,973 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1063 transitions. [2025-02-06 12:11:29,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1063 transitions. [2025-02-06 12:11:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 12:11:29,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:29,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:29,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:11:29,974 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:29,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1820432040, now seen corresponding path program 1 times [2025-02-06 12:11:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152194009] [2025-02-06 12:11:29,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:29,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:30,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:11:30,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:11:30,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:30,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:30,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:30,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152194009] [2025-02-06 12:11:30,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152194009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:30,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:30,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:11:30,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364226810] [2025-02-06 12:11:30,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:30,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:11:30,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:30,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:11:30,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:11:30,311 INFO L87 Difference]: Start difference. First operand 918 states and 1063 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:30,870 INFO L93 Difference]: Finished difference Result 917 states and 1062 transitions. [2025-02-06 12:11:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:11:30,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-06 12:11:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:30,873 INFO L225 Difference]: With dead ends: 917 [2025-02-06 12:11:30,873 INFO L226 Difference]: Without dead ends: 917 [2025-02-06 12:11:30,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:11:30,873 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 1 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:30,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2186 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:11:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2025-02-06 12:11:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2025-02-06 12:11:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 685 states have (on average 1.5416058394160583) internal successors, (1056), 912 states have internal predecessors, (1056), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1062 transitions. [2025-02-06 12:11:30,885 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1062 transitions. Word has length 86 [2025-02-06 12:11:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:30,885 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1062 transitions. [2025-02-06 12:11:30,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:11:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1062 transitions. [2025-02-06 12:11:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:11:30,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:30,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:30,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:11:30,887 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:30,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:30,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1832034212, now seen corresponding path program 1 times [2025-02-06 12:11:30,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:30,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263738966] [2025-02-06 12:11:30,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:30,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:11:30,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:11:30,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:30,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263738966] [2025-02-06 12:11:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263738966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:31,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:31,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:11:31,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110789446] [2025-02-06 12:11:31,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:31,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:11:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:31,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:11:31,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:11:31,088 INFO L87 Difference]: Start difference. First operand 917 states and 1062 transitions. Second operand has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:31,640 INFO L93 Difference]: Finished difference Result 929 states and 1077 transitions. [2025-02-06 12:11:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:11:31,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-02-06 12:11:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:31,644 INFO L225 Difference]: With dead ends: 929 [2025-02-06 12:11:31,644 INFO L226 Difference]: Without dead ends: 929 [2025-02-06 12:11:31,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:11:31,645 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 6 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:31,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2998 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:11:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-02-06 12:11:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2025-02-06 12:11:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 690 states have (on average 1.5405797101449274) internal successors, (1063), 917 states have internal predecessors, (1063), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 12:11:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1072 transitions. [2025-02-06 12:11:31,654 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1072 transitions. Word has length 94 [2025-02-06 12:11:31,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:31,655 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1072 transitions. [2025-02-06 12:11:31,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:31,655 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1072 transitions. [2025-02-06 12:11:31,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:11:31,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:31,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:31,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:11:31,655 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:31,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1832034213, now seen corresponding path program 1 times [2025-02-06 12:11:31,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:31,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941758109] [2025-02-06 12:11:31,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:31,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:11:31,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:11:31,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:31,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:32,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941758109] [2025-02-06 12:11:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941758109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:32,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:11:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768217363] [2025-02-06 12:11:32,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:11:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:32,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:11:32,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:11:32,037 INFO L87 Difference]: Start difference. First operand 923 states and 1072 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:32,638 INFO L93 Difference]: Finished difference Result 923 states and 1071 transitions. [2025-02-06 12:11:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:11:32,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-02-06 12:11:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:32,643 INFO L225 Difference]: With dead ends: 923 [2025-02-06 12:11:32,643 INFO L226 Difference]: Without dead ends: 923 [2025-02-06 12:11:32,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:11:32,644 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 1 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:32,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2832 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:11:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-02-06 12:11:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2025-02-06 12:11:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 690 states have (on average 1.5391304347826087) internal successors, (1062), 917 states have internal predecessors, (1062), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 12:11:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1071 transitions. [2025-02-06 12:11:32,653 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1071 transitions. Word has length 94 [2025-02-06 12:11:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:32,653 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1071 transitions. [2025-02-06 12:11:32,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1071 transitions. [2025-02-06 12:11:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:11:32,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:32,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:32,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:11:32,654 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:32,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1226829226, now seen corresponding path program 1 times [2025-02-06 12:11:32,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023099791] [2025-02-06 12:11:32,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:32,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:32,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:11:32,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:11:32,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:32,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:33,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:33,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023099791] [2025-02-06 12:11:33,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023099791] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:33,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992480685] [2025-02-06 12:11:33,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:33,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:33,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:11:33,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:11:33,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:11:33,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:11:33,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:11:33,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:33,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:33,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:11:33,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:11:33,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:11:33,354 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:11:33,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:11:33,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:11:33,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:11:33,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:33,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:11:33,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:11:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:33,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:11:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992480685] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:33,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:11:33,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-02-06 12:11:33,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479533581] [2025-02-06 12:11:33,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:11:33,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:11:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:33,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:11:33,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=319, Unknown=5, NotChecked=0, Total=380 [2025-02-06 12:11:33,720 INFO L87 Difference]: Start difference. First operand 923 states and 1071 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 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-02-06 12:11:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:35,716 INFO L93 Difference]: Finished difference Result 930 states and 1078 transitions. [2025-02-06 12:11:35,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:11:35,717 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 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 95 [2025-02-06 12:11:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:35,719 INFO L225 Difference]: With dead ends: 930 [2025-02-06 12:11:35,719 INFO L226 Difference]: Without dead ends: 930 [2025-02-06 12:11:35,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=464, Unknown=5, NotChecked=0, Total=552 [2025-02-06 12:11:35,720 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 698 mSDsluCounter, 5541 mSDsCounter, 0 mSdLazyCounter, 4308 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 6017 SdHoareTripleChecker+Invalid, 4322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:35,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 6017 Invalid, 4322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4308 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 12:11:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-06 12:11:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 927. [2025-02-06 12:11:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 694 states have (on average 1.5360230547550433) internal successors, (1066), 920 states have internal predecessors, (1066), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:11:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1073 transitions. [2025-02-06 12:11:35,731 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1073 transitions. Word has length 95 [2025-02-06 12:11:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:35,731 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1073 transitions. [2025-02-06 12:11:35,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 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-02-06 12:11:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1073 transitions. [2025-02-06 12:11:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:11:35,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:35,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:35,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:11:35,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 12:11:35,933 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:35,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:35,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1226829225, now seen corresponding path program 1 times [2025-02-06 12:11:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:35,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784736120] [2025-02-06 12:11:35,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:35,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:11:35,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:11:35,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:35,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:36,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:36,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784736120] [2025-02-06 12:11:36,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784736120] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:36,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358194715] [2025-02-06 12:11:36,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:36,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:36,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:11:36,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:11:36,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:11:36,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:11:36,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:11:36,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:36,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:36,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 12:11:36,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:11:36,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:11:36,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:11:36,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:11:36,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:11:36,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:11:36,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:11:36,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:11:36,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:11:36,850 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:36,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:11:36,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:11:36,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:11:36,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:11:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:36,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:11:36,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_786 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_786) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_785 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:11:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358194715] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:36,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:11:36,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-02-06 12:11:36,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001136694] [2025-02-06 12:11:36,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:11:36,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:11:36,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:36,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:11:36,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-02-06 12:11:36,980 INFO L87 Difference]: Start difference. First operand 927 states and 1073 transitions. Second operand has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 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-02-06 12:11:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:38,609 INFO L93 Difference]: Finished difference Result 929 states and 1077 transitions. [2025-02-06 12:11:38,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:11:38,610 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 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 95 [2025-02-06 12:11:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:38,612 INFO L225 Difference]: With dead ends: 929 [2025-02-06 12:11:38,612 INFO L226 Difference]: Without dead ends: 929 [2025-02-06 12:11:38,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2025-02-06 12:11:38,614 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 699 mSDsluCounter, 3580 mSDsCounter, 0 mSdLazyCounter, 3904 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 4059 SdHoareTripleChecker+Invalid, 3922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:38,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 4059 Invalid, 3922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3904 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 12:11:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-02-06 12:11:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 920. [2025-02-06 12:11:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 689 states have (on average 1.537010159651669) internal successors, (1059), 914 states have internal predecessors, (1059), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1065 transitions. [2025-02-06 12:11:38,623 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1065 transitions. Word has length 95 [2025-02-06 12:11:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:38,623 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1065 transitions. [2025-02-06 12:11:38,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 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-02-06 12:11:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1065 transitions. [2025-02-06 12:11:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 12:11:38,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:38,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:38,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:11:38,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:38,824 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:38,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1982651175, now seen corresponding path program 1 times [2025-02-06 12:11:38,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:38,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420024830] [2025-02-06 12:11:38,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:38,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:38,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:11:38,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:11:38,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:38,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:39,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:39,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420024830] [2025-02-06 12:11:39,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420024830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:39,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:39,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:11:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475456263] [2025-02-06 12:11:39,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:39,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:11:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:39,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:11:39,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:11:39,148 INFO L87 Difference]: Start difference. First operand 920 states and 1065 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:40,178 INFO L93 Difference]: Finished difference Result 933 states and 1081 transitions. [2025-02-06 12:11:40,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:11:40,178 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-02-06 12:11:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:40,181 INFO L225 Difference]: With dead ends: 933 [2025-02-06 12:11:40,181 INFO L226 Difference]: Without dead ends: 933 [2025-02-06 12:11:40,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:11:40,181 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 733 mSDsluCounter, 3716 mSDsCounter, 0 mSdLazyCounter, 2995 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 4192 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:40,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 4192 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2995 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 12:11:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-06 12:11:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 929. [2025-02-06 12:11:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 697 states have (on average 1.533715925394548) internal successors, (1069), 922 states have internal predecessors, (1069), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:11:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1076 transitions. [2025-02-06 12:11:40,191 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1076 transitions. Word has length 97 [2025-02-06 12:11:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:40,191 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1076 transitions. [2025-02-06 12:11:40,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1076 transitions. [2025-02-06 12:11:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 12:11:40,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:40,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:40,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 12:11:40,192 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:40,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:40,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1982651176, now seen corresponding path program 1 times [2025-02-06 12:11:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405308372] [2025-02-06 12:11:40,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:40,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:11:40,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:11:40,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:40,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:40,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:40,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405308372] [2025-02-06 12:11:40,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405308372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:40,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:40,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:11:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294508684] [2025-02-06 12:11:40,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:40,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:11:40,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:40,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:11:40,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:11:40,665 INFO L87 Difference]: Start difference. First operand 929 states and 1076 transitions. Second operand has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:41,800 INFO L93 Difference]: Finished difference Result 932 states and 1080 transitions. [2025-02-06 12:11:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:11:41,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-02-06 12:11:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:41,802 INFO L225 Difference]: With dead ends: 932 [2025-02-06 12:11:41,802 INFO L226 Difference]: Without dead ends: 932 [2025-02-06 12:11:41,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:11:41,803 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 727 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 3147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 3225 SdHoareTripleChecker+Invalid, 3158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:41,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 3225 Invalid, 3158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3147 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:11:41,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-06 12:11:41,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 929. [2025-02-06 12:11:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 697 states have (on average 1.5322812051649928) internal successors, (1068), 922 states have internal predecessors, (1068), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:11:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1075 transitions. [2025-02-06 12:11:41,811 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1075 transitions. Word has length 97 [2025-02-06 12:11:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:41,811 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1075 transitions. [2025-02-06 12:11:41,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1075 transitions. [2025-02-06 12:11:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:11:41,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:41,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:41,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 12:11:41,812 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:41,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:41,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1703088949, now seen corresponding path program 1 times [2025-02-06 12:11:41,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:41,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455633137] [2025-02-06 12:11:41,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:41,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:41,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:11:41,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:11:41,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:41,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:42,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:42,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455633137] [2025-02-06 12:11:42,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455633137] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:42,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253365630] [2025-02-06 12:11:42,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:42,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:42,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:11:42,153 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:11:42,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:11:42,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:11:42,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:11:42,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:42,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:42,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 12:11:42,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:11:42,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:11:42,427 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:11:42,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:11:42,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:11:42,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:11:42,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:42,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:11:42,672 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:42,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:11:42,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:11:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:42,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:11:42,712 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-06 12:11:42,755 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1070))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1067)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:11:42,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253365630] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:42,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:11:42,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-02-06 12:11:42,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748983189] [2025-02-06 12:11:42,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:11:42,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:11:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:42,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:11:42,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=427, Unknown=7, NotChecked=86, Total=600 [2025-02-06 12:11:42,759 INFO L87 Difference]: Start difference. First operand 929 states and 1075 transitions. Second operand has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:11:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:44,516 INFO L93 Difference]: Finished difference Result 931 states and 1079 transitions. [2025-02-06 12:11:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:11:44,517 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2025-02-06 12:11:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:44,518 INFO L225 Difference]: With dead ends: 931 [2025-02-06 12:11:44,518 INFO L226 Difference]: Without dead ends: 931 [2025-02-06 12:11:44,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=549, Unknown=7, NotChecked=98, Total=756 [2025-02-06 12:11:44,519 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 693 mSDsluCounter, 5992 mSDsCounter, 0 mSdLazyCounter, 4631 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 6467 SdHoareTripleChecker+Invalid, 4643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:44,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 6467 Invalid, 4643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4631 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 12:11:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-06 12:11:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 928. [2025-02-06 12:11:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 697 states have (on average 1.5308464849354375) internal successors, (1067), 921 states have internal predecessors, (1067), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:11:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1074 transitions. [2025-02-06 12:11:44,528 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1074 transitions. Word has length 98 [2025-02-06 12:11:44,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:44,529 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1074 transitions. [2025-02-06 12:11:44,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:11:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1074 transitions. [2025-02-06 12:11:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:11:44,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:44,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:11:44,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:44,730 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:44,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:44,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1703088950, now seen corresponding path program 1 times [2025-02-06 12:11:44,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:44,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105691309] [2025-02-06 12:11:44,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:44,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:44,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:11:44,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:11:44,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:44,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105691309] [2025-02-06 12:11:45,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105691309] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897701326] [2025-02-06 12:11:45,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:45,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:45,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:11:45,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:11:45,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:11:45,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:11:45,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:11:45,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:45,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:45,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 12:11:45,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:11:45,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:11:45,441 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:11:45,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:11:45,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:11:45,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:11:45,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:11:45,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:11:45,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:11:45,599 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:45,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:11:45,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:11:45,658 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:45,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:11:45,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:11:45,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:11:45,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:11:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:45,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:11:45,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-02-06 12:11:45,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1227))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1228) .cse0 v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1228) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-02-06 12:11:45,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897701326] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:45,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:11:45,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-06 12:11:45,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595791633] [2025-02-06 12:11:45,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:11:45,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:11:45,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:45,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:11:45,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=423, Unknown=13, NotChecked=86, Total=600 [2025-02-06 12:11:45,836 INFO L87 Difference]: Start difference. First operand 928 states and 1074 transitions. Second operand has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:11:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:47,622 INFO L93 Difference]: Finished difference Result 930 states and 1078 transitions. [2025-02-06 12:11:47,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:11:47,623 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2025-02-06 12:11:47,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:47,625 INFO L225 Difference]: With dead ends: 930 [2025-02-06 12:11:47,625 INFO L226 Difference]: Without dead ends: 930 [2025-02-06 12:11:47,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=625, Unknown=14, NotChecked=106, Total=870 [2025-02-06 12:11:47,625 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 696 mSDsluCounter, 4307 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 4785 SdHoareTripleChecker+Invalid, 4770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:47,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 4785 Invalid, 4770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4753 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 12:11:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-06 12:11:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 918. [2025-02-06 12:11:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 689 states have (on average 1.5341074020319303) internal successors, (1057), 912 states have internal predecessors, (1057), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1063 transitions. [2025-02-06 12:11:47,633 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1063 transitions. Word has length 98 [2025-02-06 12:11:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:47,633 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1063 transitions. [2025-02-06 12:11:47,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:11:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1063 transitions. [2025-02-06 12:11:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 12:11:47,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:47,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:47,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:11:47,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 12:11:47,839 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:47,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash 771764637, now seen corresponding path program 1 times [2025-02-06 12:11:47,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:47,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815303411] [2025-02-06 12:11:47,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:47,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 12:11:47,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 12:11:47,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:47,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:48,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:48,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815303411] [2025-02-06 12:11:48,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815303411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:48,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:48,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 12:11:48,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139174650] [2025-02-06 12:11:48,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:48,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:11:48,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:48,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:11:48,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:11:48,132 INFO L87 Difference]: Start difference. First operand 918 states and 1063 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:49,132 INFO L93 Difference]: Finished difference Result 934 states and 1082 transitions. [2025-02-06 12:11:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:11:49,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2025-02-06 12:11:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:49,134 INFO L225 Difference]: With dead ends: 934 [2025-02-06 12:11:49,134 INFO L226 Difference]: Without dead ends: 934 [2025-02-06 12:11:49,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-06 12:11:49,134 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 733 mSDsluCounter, 3691 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 4169 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:49,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 4169 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2931 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 12:11:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-06 12:11:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 930. [2025-02-06 12:11:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 700 states have (on average 1.5285714285714285) internal successors, (1070), 923 states have internal predecessors, (1070), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:11:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1077 transitions. [2025-02-06 12:11:49,142 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1077 transitions. Word has length 100 [2025-02-06 12:11:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:49,142 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1077 transitions. [2025-02-06 12:11:49,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1077 transitions. [2025-02-06 12:11:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 12:11:49,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:49,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:49,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 12:11:49,143 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:49,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash 771764638, now seen corresponding path program 1 times [2025-02-06 12:11:49,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:49,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527953053] [2025-02-06 12:11:49,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:49,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:49,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 12:11:49,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 12:11:49,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:49,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:49,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:49,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527953053] [2025-02-06 12:11:49,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527953053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:49,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:49,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 12:11:49,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397888794] [2025-02-06 12:11:49,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:49,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:11:49,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:49,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:11:49,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:11:49,644 INFO L87 Difference]: Start difference. First operand 930 states and 1077 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:50,859 INFO L93 Difference]: Finished difference Result 933 states and 1081 transitions. [2025-02-06 12:11:50,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:11:50,860 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2025-02-06 12:11:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:50,861 INFO L225 Difference]: With dead ends: 933 [2025-02-06 12:11:50,861 INFO L226 Difference]: Without dead ends: 933 [2025-02-06 12:11:50,862 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-02-06 12:11:50,862 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 729 mSDsluCounter, 2744 mSDsCounter, 0 mSdLazyCounter, 3138 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 3223 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:50,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 3223 Invalid, 3149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3138 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:11:50,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-06 12:11:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 930. [2025-02-06 12:11:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 700 states have (on average 1.5271428571428571) internal successors, (1069), 923 states have internal predecessors, (1069), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:11:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1076 transitions. [2025-02-06 12:11:50,874 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1076 transitions. Word has length 100 [2025-02-06 12:11:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:50,875 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1076 transitions. [2025-02-06 12:11:50,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:50,875 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1076 transitions. [2025-02-06 12:11:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 12:11:50,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:50,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:50,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 12:11:50,876 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:50,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash 275076815, now seen corresponding path program 1 times [2025-02-06 12:11:50,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:50,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629988575] [2025-02-06 12:11:50,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:50,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:50,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 12:11:50,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 12:11:50,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:50,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:51,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:51,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629988575] [2025-02-06 12:11:51,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629988575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:51,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645305705] [2025-02-06 12:11:51,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:51,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:51,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:11:51,338 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:11:51,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:11:51,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 12:11:51,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 12:11:51,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:51,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:51,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 12:11:51,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:11:51,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:11:51,592 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:11:51,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:11:51,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:11:51,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:11:51,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:51,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:11:51,818 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:51,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:11:51,858 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:51,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:11:51,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:11:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:51,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:11:51,914 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1534) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:11:51,919 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1533 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1533))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1534)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:11:51,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1533 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1533))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1534)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:11:51,942 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1537 (Array Int Int)) (v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1533 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1537))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1533)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1534)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:11:51,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645305705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:51,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:11:51,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-02-06 12:11:51,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206005719] [2025-02-06 12:11:51,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:11:51,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:11:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:51,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:11:51,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=508, Unknown=13, NotChecked=196, Total=812 [2025-02-06 12:11:51,944 INFO L87 Difference]: Start difference. First operand 930 states and 1076 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:11:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:53,476 INFO L93 Difference]: Finished difference Result 932 states and 1080 transitions. [2025-02-06 12:11:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:11:53,476 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2025-02-06 12:11:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:53,478 INFO L225 Difference]: With dead ends: 932 [2025-02-06 12:11:53,478 INFO L226 Difference]: Without dead ends: 932 [2025-02-06 12:11:53,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=643, Unknown=13, NotChecked=220, Total=992 [2025-02-06 12:11:53,479 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 686 mSDsluCounter, 5087 mSDsCounter, 0 mSdLazyCounter, 3980 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 5561 SdHoareTripleChecker+Invalid, 3992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:53,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 5561 Invalid, 3992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3980 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 12:11:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-06 12:11:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 929. [2025-02-06 12:11:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 700 states have (on average 1.5257142857142858) internal successors, (1068), 922 states have internal predecessors, (1068), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:11:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1075 transitions. [2025-02-06 12:11:53,485 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1075 transitions. Word has length 101 [2025-02-06 12:11:53,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1075 transitions. [2025-02-06 12:11:53,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:11:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1075 transitions. [2025-02-06 12:11:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 12:11:53,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:53,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:53,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:11:53,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:53,688 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:53,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash 275076816, now seen corresponding path program 1 times [2025-02-06 12:11:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:53,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80877674] [2025-02-06 12:11:53,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:53,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 12:11:53,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 12:11:53,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:53,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:54,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80877674] [2025-02-06 12:11:54,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80877674] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331357140] [2025-02-06 12:11:54,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:54,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:54,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:11:54,246 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:11:54,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:11:54,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 12:11:54,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 12:11:54,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:54,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:54,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 12:11:54,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:11:54,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:11:54,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:11:54,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:11:54,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:11:54,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:11:54,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:11:54,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:11:54,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:11:54,624 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:54,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:11:54,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:11:54,675 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:54,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:11:54,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:11:54,726 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:54,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:11:54,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2025-02-06 12:11:54,762 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 30 treesize of output 12 [2025-02-06 12:11:54,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:11:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:54,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:11:54,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1700 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1700))) (or (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1701))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store .cse0 .cse2 v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1700 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1700))) (or (< (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-02-06 12:11:55,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1708))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1709) .cse2 v_ArrVal_1700))) (or (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) 0)))))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1708))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1709) .cse8 v_ArrVal_1700))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) 0) (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1701))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 12 (select (select (store .cse4 .cse5 v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2025-02-06 12:11:55,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331357140] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:55,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:11:55,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2025-02-06 12:11:55,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622717187] [2025-02-06 12:11:55,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:11:55,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 12:11:55,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:55,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 12:11:55,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=8, NotChecked=106, Total=870 [2025-02-06 12:11:55,064 INFO L87 Difference]: Start difference. First operand 929 states and 1075 transitions. Second operand has 23 states, 20 states have (on average 8.0) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:11:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:56,851 INFO L93 Difference]: Finished difference Result 931 states and 1079 transitions. [2025-02-06 12:11:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:11:56,851 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.0) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2025-02-06 12:11:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:56,852 INFO L225 Difference]: With dead ends: 931 [2025-02-06 12:11:56,852 INFO L226 Difference]: Without dead ends: 931 [2025-02-06 12:11:56,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=8, NotChecked=130, Total=1260 [2025-02-06 12:11:56,853 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 694 mSDsluCounter, 3918 mSDsCounter, 0 mSdLazyCounter, 4339 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 4395 SdHoareTripleChecker+Invalid, 4357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:56,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 4395 Invalid, 4357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4339 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 12:11:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-06 12:11:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 916. [2025-02-06 12:11:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 689 states have (on average 1.5312046444121916) internal successors, (1055), 910 states have internal predecessors, (1055), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:11:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1061 transitions. [2025-02-06 12:11:56,878 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1061 transitions. Word has length 101 [2025-02-06 12:11:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:56,878 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1061 transitions. [2025-02-06 12:11:56,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.0) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:11:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1061 transitions. [2025-02-06 12:11:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 12:11:56,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:56,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:56,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:11:57,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-02-06 12:11:57,079 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:57,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash 681223232, now seen corresponding path program 1 times [2025-02-06 12:11:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:57,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430086952] [2025-02-06 12:11:57,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:57,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:57,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 12:11:57,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 12:11:57,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:57,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:57,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:57,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430086952] [2025-02-06 12:11:57,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430086952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:57,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:57,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 12:11:57,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894825648] [2025-02-06 12:11:57,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:57,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 12:11:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:57,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 12:11:57,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:11:57,426 INFO L87 Difference]: Start difference. First operand 916 states and 1061 transitions. Second operand has 16 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:58,607 INFO L93 Difference]: Finished difference Result 935 states and 1083 transitions. [2025-02-06 12:11:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:11:58,607 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 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 103 [2025-02-06 12:11:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:58,608 INFO L225 Difference]: With dead ends: 935 [2025-02-06 12:11:58,608 INFO L226 Difference]: Without dead ends: 935 [2025-02-06 12:11:58,609 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-02-06 12:11:58,609 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 714 mSDsluCounter, 4604 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 5078 SdHoareTripleChecker+Invalid, 3655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:58,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 5078 Invalid, 3655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3643 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:11:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-02-06 12:11:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 931. [2025-02-06 12:11:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 703 states have (on average 1.523470839260313) internal successors, (1071), 924 states have internal predecessors, (1071), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:11:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1078 transitions. [2025-02-06 12:11:58,615 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1078 transitions. Word has length 103 [2025-02-06 12:11:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:58,615 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1078 transitions. [2025-02-06 12:11:58,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:11:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1078 transitions. [2025-02-06 12:11:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 12:11:58,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:58,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:11:58,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 12:11:58,616 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:11:58,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:58,616 INFO L85 PathProgramCache]: Analyzing trace with hash 681223233, now seen corresponding path program 1 times [2025-02-06 12:11:58,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:58,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860573909] [2025-02-06 12:11:58,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:58,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:58,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 12:11:58,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 12:11:58,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:58,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:59,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:59,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860573909] [2025-02-06 12:11:59,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860573909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:11:59,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:11:59,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:11:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59268975] [2025-02-06 12:11:59,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:11:59,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:11:59,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:59,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:11:59,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:11:59,142 INFO L87 Difference]: Start difference. First operand 931 states and 1078 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:12:00,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:12:00,290 INFO L93 Difference]: Finished difference Result 934 states and 1082 transitions. [2025-02-06 12:12:00,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:12:00,291 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 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 103 [2025-02-06 12:12:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:12:00,297 INFO L225 Difference]: With dead ends: 934 [2025-02-06 12:12:00,297 INFO L226 Difference]: Without dead ends: 934 [2025-02-06 12:12:00,297 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-02-06 12:12:00,297 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 729 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 3302 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:12:00,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 3302 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:12:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-06 12:12:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 931. [2025-02-06 12:12:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 703 states have (on average 1.5220483641536273) internal successors, (1070), 924 states have internal predecessors, (1070), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:12:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1077 transitions. [2025-02-06 12:12:00,306 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1077 transitions. Word has length 103 [2025-02-06 12:12:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:12:00,306 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1077 transitions. [2025-02-06 12:12:00,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:12:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1077 transitions. [2025-02-06 12:12:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 12:12:00,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:12:00,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:12:00,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 12:12:00,307 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:12:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:12:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 16652750, now seen corresponding path program 1 times [2025-02-06 12:12:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:12:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264678914] [2025-02-06 12:12:00,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:12:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:12:00,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 12:12:00,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 12:12:00,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:12:00,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:12:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:12:00,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:12:00,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264678914] [2025-02-06 12:12:00,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264678914] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:12:00,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8492622] [2025-02-06 12:12:00,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:12:00,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:12:00,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:12:00,787 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:12:00,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:12:00,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 12:12:00,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 12:12:00,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:12:00,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:12:00,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 12:12:01,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:12:01,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:12:01,095 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:12:01,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:12:01,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:12:01,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:12:01,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:01,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:12:01,343 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:01,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:12:01,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:01,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:12:01,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:01,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:12:01,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:12:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:12:01,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:12:01,497 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2039))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2040)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:12:01,529 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2038))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2040)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:12:01,535 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2038))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2040)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:12:01,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8492622] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:12:01,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:12:01,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-02-06 12:12:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533044762] [2025-02-06 12:12:01,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:12:01,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 12:12:01,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:12:01,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 12:12:01,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=707, Unknown=46, NotChecked=174, Total=1056 [2025-02-06 12:12:01,605 INFO L87 Difference]: Start difference. First operand 931 states and 1077 transitions. Second operand has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 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-02-06 12:12:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:12:02,886 INFO L93 Difference]: Finished difference Result 933 states and 1081 transitions. [2025-02-06 12:12:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:12:02,887 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 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 104 [2025-02-06 12:12:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:12:02,888 INFO L225 Difference]: With dead ends: 933 [2025-02-06 12:12:02,888 INFO L226 Difference]: Without dead ends: 933 [2025-02-06 12:12:02,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=869, Unknown=47, NotChecked=192, Total=1260 [2025-02-06 12:12:02,889 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 679 mSDsluCounter, 4607 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 5080 SdHoareTripleChecker+Invalid, 3656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:12:02,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 5080 Invalid, 3656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3643 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 12:12:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-06 12:12:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 930. [2025-02-06 12:12:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 703 states have (on average 1.5206258890469417) internal successors, (1069), 923 states have internal predecessors, (1069), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:12:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1076 transitions. [2025-02-06 12:12:02,895 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1076 transitions. Word has length 104 [2025-02-06 12:12:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:12:02,896 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1076 transitions. [2025-02-06 12:12:02,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 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-02-06 12:12:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1076 transitions. [2025-02-06 12:12:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 12:12:02,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:12:02,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:12:02,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:12:03,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:12:03,097 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:12:03,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:12:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash 16652751, now seen corresponding path program 1 times [2025-02-06 12:12:03,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:12:03,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577081776] [2025-02-06 12:12:03,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:12:03,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:12:03,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 12:12:03,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 12:12:03,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:12:03,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:12:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:12:03,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:12:03,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577081776] [2025-02-06 12:12:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577081776] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:12:03,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784266043] [2025-02-06 12:12:03,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:12:03,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:12:03,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:12:03,683 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:12:03,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:12:03,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 12:12:03,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 12:12:03,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:12:03,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:12:03,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 12:12:03,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:12:03,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:12:03,954 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:12:03,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:12:03,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:12:03,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:12:03,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:12:04,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:12:04,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:12:04,072 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:04,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:12:04,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:12:04,127 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:04,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:12:04,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:12:04,171 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:04,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:12:04,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:12:04,218 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:04,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:12:04,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:12:04,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:12:04,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:12:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:12:04,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:12:04,281 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:12:04,287 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int))) (<= (+ 24 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2222 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-06 12:12:04,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2220) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2221))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2220) .cse1 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:12:04,355 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2219))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2218) .cse0 v_ArrVal_2220) (select (select (store .cse1 .cse0 v_ArrVal_2221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2222))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2219))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2221))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 24 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2218) .cse3 v_ArrVal_2220) .cse4 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-02-06 12:12:04,379 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2219))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2218) .cse1 v_ArrVal_2220) (select (select (store .cse2 .cse1 v_ArrVal_2221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2222))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2219))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2221))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2218) .cse4 v_ArrVal_2220) .cse5 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2025-02-06 12:12:04,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2229))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2219))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2221))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2228) .cse0 v_ArrVal_2218) .cse1 v_ArrVal_2220) .cse2 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2229))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2219))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2228) .cse7 v_ArrVal_2218) .cse8 v_ArrVal_2220) (select (select (store .cse9 .cse8 v_ArrVal_2221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2222))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2025-02-06 12:12:04,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784266043] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:12:04,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:12:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2025-02-06 12:12:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780703199] [2025-02-06 12:12:04,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:12:04,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 12:12:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:12:04,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 12:12:04,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=463, Unknown=10, NotChecked=294, Total=870 [2025-02-06 12:12:04,431 INFO L87 Difference]: Start difference. First operand 930 states and 1076 transitions. Second operand has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:12:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:12:06,601 INFO L93 Difference]: Finished difference Result 932 states and 1080 transitions. [2025-02-06 12:12:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:12:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2025-02-06 12:12:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:12:06,602 INFO L225 Difference]: With dead ends: 932 [2025-02-06 12:12:06,603 INFO L226 Difference]: Without dead ends: 932 [2025-02-06 12:12:06,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=780, Unknown=10, NotChecked=378, Total=1332 [2025-02-06 12:12:06,603 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 691 mSDsluCounter, 4631 mSDsCounter, 0 mSdLazyCounter, 5146 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 5107 SdHoareTripleChecker+Invalid, 5161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 5146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:12:06,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 5107 Invalid, 5161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 5146 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 12:12:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-06 12:12:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 914. [2025-02-06 12:12:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 689 states have (on average 1.528301886792453) internal successors, (1053), 908 states have internal predecessors, (1053), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:12:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1059 transitions. [2025-02-06 12:12:06,608 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1059 transitions. Word has length 104 [2025-02-06 12:12:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:12:06,609 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1059 transitions. [2025-02-06 12:12:06,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:12:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1059 transitions. [2025-02-06 12:12:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 12:12:06,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:12:06,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:12:06,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:12:06,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:12:06,810 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:12:06,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:12:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1472267962, now seen corresponding path program 1 times [2025-02-06 12:12:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:12:06,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93885192] [2025-02-06 12:12:06,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:12:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:12:06,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 12:12:06,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 12:12:06,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:12:06,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:12:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:12:07,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:12:07,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93885192] [2025-02-06 12:12:07,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93885192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:12:07,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:12:07,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 12:12:07,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395399938] [2025-02-06 12:12:07,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:12:07,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 12:12:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:12:07,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 12:12:07,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-02-06 12:12:07,291 INFO L87 Difference]: Start difference. First operand 914 states and 1059 transitions. Second operand has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:12:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:12:08,523 INFO L93 Difference]: Finished difference Result 937 states and 1085 transitions. [2025-02-06 12:12:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:12:08,523 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 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 107 [2025-02-06 12:12:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:12:08,525 INFO L225 Difference]: With dead ends: 937 [2025-02-06 12:12:08,525 INFO L226 Difference]: Without dead ends: 937 [2025-02-06 12:12:08,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2025-02-06 12:12:08,526 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 731 mSDsluCounter, 4171 mSDsCounter, 0 mSdLazyCounter, 3328 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:12:08,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 4644 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3328 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:12:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-02-06 12:12:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 933. [2025-02-06 12:12:08,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 707 states have (on average 1.5176803394625178) internal successors, (1073), 926 states have internal predecessors, (1073), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:12:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1080 transitions. [2025-02-06 12:12:08,532 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1080 transitions. Word has length 107 [2025-02-06 12:12:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:12:08,532 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1080 transitions. [2025-02-06 12:12:08,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:12:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1080 transitions. [2025-02-06 12:12:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 12:12:08,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:12:08,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:12:08,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 12:12:08,533 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:12:08,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:12:08,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1472267963, now seen corresponding path program 1 times [2025-02-06 12:12:08,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:12:08,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147810972] [2025-02-06 12:12:08,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:12:08,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:12:08,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 12:12:08,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 12:12:08,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:12:08,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:12:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:12:09,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:12:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147810972] [2025-02-06 12:12:09,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147810972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:12:09,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:12:09,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 12:12:09,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137138155] [2025-02-06 12:12:09,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:12:09,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:12:09,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:12:09,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:12:09,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-06 12:12:09,239 INFO L87 Difference]: Start difference. First operand 933 states and 1080 transitions. Second operand has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:12:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:12:10,733 INFO L93 Difference]: Finished difference Result 936 states and 1084 transitions. [2025-02-06 12:12:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:12:10,733 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 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 107 [2025-02-06 12:12:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:12:10,735 INFO L225 Difference]: With dead ends: 936 [2025-02-06 12:12:10,735 INFO L226 Difference]: Without dead ends: 936 [2025-02-06 12:12:10,735 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-02-06 12:12:10,735 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 716 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 3514 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3659 SdHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:12:10,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3659 Invalid, 3531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3514 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:12:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-02-06 12:12:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 933. [2025-02-06 12:12:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 707 states have (on average 1.5162659123055162) internal successors, (1072), 926 states have internal predecessors, (1072), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:12:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1079 transitions. [2025-02-06 12:12:10,741 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1079 transitions. Word has length 107 [2025-02-06 12:12:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:12:10,741 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1079 transitions. [2025-02-06 12:12:10,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:12:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1079 transitions. [2025-02-06 12:12:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 12:12:10,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:12:10,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:12:10,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 12:12:10,742 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:12:10,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:12:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1087175352, now seen corresponding path program 1 times [2025-02-06 12:12:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:12:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169808183] [2025-02-06 12:12:10,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:12:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:12:10,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 12:12:10,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 12:12:10,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:12:10,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:12:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:12:11,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:12:11,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169808183] [2025-02-06 12:12:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169808183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:12:11,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391877382] [2025-02-06 12:12:11,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:12:11,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:12:11,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:12:11,237 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:12:11,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:12:11,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 12:12:11,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 12:12:11,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:12:11,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:12:11,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 12:12:11,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:12:11,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:12:11,518 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:12:11,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:12:11,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:12:11,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:12:11,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:11,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:12:11,716 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:11,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:12:11,752 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:11,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:12:11,794 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:11,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:12:11,837 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:11,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:12:11,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:12:11,892 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-02-06 12:12:11,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-02-06 12:12:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:12:11,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:12:12,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391877382] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:12:12,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:12:12,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2025-02-06 12:12:12,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069604695] [2025-02-06 12:12:12,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:12:12,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 12:12:12,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:12:12,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 12:12:12,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1237, Unknown=51, NotChecked=0, Total=1482 [2025-02-06 12:12:12,446 INFO L87 Difference]: Start difference. First operand 933 states and 1079 transitions. Second operand has 28 states, 25 states have (on average 6.96) internal successors, (174), 27 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:12:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:12:14,451 INFO L93 Difference]: Finished difference Result 935 states and 1083 transitions. [2025-02-06 12:12:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 12:12:14,451 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.96) internal successors, (174), 27 states have internal predecessors, (174), 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 108 [2025-02-06 12:12:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:12:14,453 INFO L225 Difference]: With dead ends: 935 [2025-02-06 12:12:14,453 INFO L226 Difference]: Without dead ends: 935 [2025-02-06 12:12:14,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=1450, Unknown=51, NotChecked=0, Total=1722 [2025-02-06 12:12:14,454 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 681 mSDsluCounter, 6427 mSDsCounter, 0 mSdLazyCounter, 4933 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 6899 SdHoareTripleChecker+Invalid, 4950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:12:14,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 6899 Invalid, 4950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4933 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 12:12:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-02-06 12:12:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 932. [2025-02-06 12:12:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 707 states have (on average 1.5148514851485149) internal successors, (1071), 925 states have internal predecessors, (1071), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 12:12:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1078 transitions. [2025-02-06 12:12:14,469 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1078 transitions. Word has length 108 [2025-02-06 12:12:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:12:14,469 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1078 transitions. [2025-02-06 12:12:14,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.96) internal successors, (174), 27 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:12:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1078 transitions. [2025-02-06 12:12:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 12:12:14,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:12:14,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:12:14,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 12:12:14,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:12:14,670 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-06 12:12:14,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:12:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1087175351, now seen corresponding path program 1 times [2025-02-06 12:12:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:12:14,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840222667] [2025-02-06 12:12:14,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:12:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:12:14,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 12:12:14,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 12:12:14,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:12:14,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:12:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:12:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:12:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840222667] [2025-02-06 12:12:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840222667] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:12:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454820882] [2025-02-06 12:12:15,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:12:15,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:12:15,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:12:15,420 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:12:15,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:12:15,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 12:12:15,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 12:12:15,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:12:15,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:12:15,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-06 12:12:15,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:12:15,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:12:15,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:12:15,731 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:12:15,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:12:15,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:12:15,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:12:15,841 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 33 treesize of output 15 [2025-02-06 12:12:15,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:12:15,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:15,955 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-02-06 12:12:15,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:12:16,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:16,035 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-02-06 12:12:16,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:12:16,093 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:16,093 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-02-06 12:12:16,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:12:16,147 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:16,147 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-02-06 12:12:16,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:12:16,205 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:12:16,205 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-02-06 12:12:16,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:12:16,223 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-02-06 12:12:16,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:12:16,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:12:16,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:12:16,275 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-06 12:12:16,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-06 12:12:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:12:16,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:12:29,493 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2803))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2789))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2792))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2802) .cse0 v_ArrVal_2790) .cse1 v_ArrVal_2791) .cse2 v_ArrVal_2794) (select (select (store .cse3 .cse2 v_ArrVal_2793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2796))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2797 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2803))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2789))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2792))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2793))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 4 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2802) .cse7 v_ArrVal_2790) .cse8 v_ArrVal_2791) .cse9 v_ArrVal_2794) .cse10 v_ArrVal_2796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2797) (select (select (store .cse11 .cse10 v_ArrVal_2795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2025-02-06 12:12:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454820882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:12:29,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:12:29,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2025-02-06 12:12:29,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505920762] [2025-02-06 12:12:29,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:12:29,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 12:12:29,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:12:29,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 12:12:29,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1395, Unknown=67, NotChecked=78, Total=1722 [2025-02-06 12:12:29,504 INFO L87 Difference]: Start difference. First operand 932 states and 1078 transitions. Second operand has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 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)