./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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_OAT_test9-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 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:00:24,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:00:24,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:00:24,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:00:24,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:00:24,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:00:24,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:00:24,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:00:24,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:00:24,205 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:00:24,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:00:24,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:00:24,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:00:24,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:00:24,206 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:00:24,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:00:24,206 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:00:24,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:00:24,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:00:24,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:00:24,207 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:00:24,207 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:00:24,207 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:00:24,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:00:24,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:00:24,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:00:24,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:00:24,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:00:24,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:00:24,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:00:24,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:00:24,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:00:24,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:00:24,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:00:24,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:00:24,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:00:24,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:00:24,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:00:24,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:00:24,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:00:24,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:00:24,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:00:24,209 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 -> 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 [2025-02-08 08:00:24,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:00:24,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:00:24,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:00:24,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:00:24,479 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:00:24,480 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_OAT_test9-1.i [2025-02-08 08:00:25,778 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49865a863/ebb916e2e73c404d8ef8c5199b66a4a0/FLAG3468f81ca [2025-02-08 08:00:26,294 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:00:26,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i [2025-02-08 08:00:26,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49865a863/ebb916e2e73c404d8ef8c5199b66a4a0/FLAG3468f81ca [2025-02-08 08:00:26,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49865a863/ebb916e2e73c404d8ef8c5199b66a4a0 [2025-02-08 08:00:26,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:00:26,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:00:26,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:00:26,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:00:26,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:00:26,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:00:26" (1/1) ... [2025-02-08 08:00:26,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374b78d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:26, skipping insertion in model container [2025-02-08 08:00:26,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:00:26" (1/1) ... [2025-02-08 08:00:26,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:00:27,038 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-08 08:00:27,059 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-08 08:00:27,065 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-08 08:00:27,070 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-08 08:00:27,076 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-08 08:00:27,102 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-08 08:00:27,103 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-08 08:00:27,104 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-08 08:00:27,105 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-08 08:00:27,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:00:27,122 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:00:27,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:00:27,313 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:00:27,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27 WrapperNode [2025-02-08 08:00:27,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:00:27,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:00:27,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:00:27,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:00:27,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,466 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3254 [2025-02-08 08:00:27,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:00:27,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:00:27,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:00:27,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:00:27,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,574 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 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, 42, 4]. [2025-02-08 08:00:27,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,640 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:00:27,698 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:00:27,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:00:27,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:00:27,699 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (1/1) ... [2025-02-08 08:00:27,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:00:27,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:00:27,735 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-08 08:00:27,742 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-08 08:00:27,761 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 08:00:27,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 08:00:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:00:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:00:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:00:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 08:00:27,765 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 08:00:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:00:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:00:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:00:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 08:00:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 08:00:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 08:00:27,765 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 08:00:27,765 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 08:00:27,765 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 08:00:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:00:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:00:27,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:00:27,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:00:27,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:00:27,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:00:27,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:00:27,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:00:27,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:00:27,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:00:27,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:00:27,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:00:27,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:00:27,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:00:27,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:00:27,983 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:00:27,985 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:00:31,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: 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-08 08:00:31,410 INFO L? ?]: Removed 1536 outVars from TransFormulas that were not future-live. [2025-02-08 08:00:31,410 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:00:31,523 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:00:31,524 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 08:00:31,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:00:31 BoogieIcfgContainer [2025-02-08 08:00:31,525 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:00:31,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:00:31,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:00:31,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:00:31,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:00:26" (1/3) ... [2025-02-08 08:00:31,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed0db18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:00:31, skipping insertion in model container [2025-02-08 08:00:31,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:00:27" (2/3) ... [2025-02-08 08:00:31,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed0db18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:00:31, skipping insertion in model container [2025-02-08 08:00:31,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:00:31" (3/3) ... [2025-02-08 08:00:31,536 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-1.i [2025-02-08 08:00:31,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:00:31,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test9-1.i that has 6 procedures, 2083 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2025-02-08 08:00:31,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:00:31,643 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;@380372d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:00:31,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-02-08 08:00:31,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 2073 states, 1142 states have (on average 1.998248686514886) internal successors, (2282), 2065 states have internal predecessors, (2282), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-02-08 08:00:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 08:00:31,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:31,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 08:00:31,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:31,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash 139679, now seen corresponding path program 1 times [2025-02-08 08:00:31,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:31,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770129664] [2025-02-08 08:00:31,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:31,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:31,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:00:31,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:00:31,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:31,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:31,872 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-08 08:00:31,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:31,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770129664] [2025-02-08 08:00:31,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770129664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:31,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:31,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:00:31,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094956200] [2025-02-08 08:00:31,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:00:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:31,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:00:31,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:00:31,913 INFO L87 Difference]: Start difference. First operand has 2073 states, 1142 states have (on average 1.998248686514886) internal successors, (2282), 2065 states have internal predecessors, (2282), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:33,233 INFO L93 Difference]: Finished difference Result 2059 states and 3222 transitions. [2025-02-08 08:00:33,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:00:33,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 08:00:33,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:33,259 INFO L225 Difference]: With dead ends: 2059 [2025-02-08 08:00:33,259 INFO L226 Difference]: Without dead ends: 2054 [2025-02-08 08:00:33,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:00:33,264 INFO L435 NwaCegarLoop]: 2792 mSDtfsCounter, 2098 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2601 SdHoareTripleChecker+Valid, 2844 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:33,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2601 Valid, 2844 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 08:00:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2025-02-08 08:00:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2025-02-08 08:00:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 1143 states have (on average 1.9335083114610674) internal successors, (2210), 2047 states have internal predecessors, (2210), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2718 transitions. [2025-02-08 08:00:33,395 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2718 transitions. Word has length 2 [2025-02-08 08:00:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:33,395 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2718 transitions. [2025-02-08 08:00:33,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2718 transitions. [2025-02-08 08:00:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 08:00:33,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:33,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 08:00:33,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:00:33,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:33,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash 139680, now seen corresponding path program 1 times [2025-02-08 08:00:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:33,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8750320] [2025-02-08 08:00:33,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:33,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:33,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:00:33,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:00:33,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:33,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:00:33,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:33,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8750320] [2025-02-08 08:00:33,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8750320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:33,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:33,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:00:33,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735604135] [2025-02-08 08:00:33,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:33,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:00:33,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:33,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:00:33,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:00:33,495 INFO L87 Difference]: Start difference. First operand 2054 states and 2718 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:34,730 INFO L93 Difference]: Finished difference Result 2140 states and 2809 transitions. [2025-02-08 08:00:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:00:34,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 08:00:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:34,739 INFO L225 Difference]: With dead ends: 2140 [2025-02-08 08:00:34,739 INFO L226 Difference]: Without dead ends: 2140 [2025-02-08 08:00:34,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:00:34,740 INFO L435 NwaCegarLoop]: 2425 mSDtfsCounter, 1838 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:34,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 2654 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 08:00:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-02-08 08:00:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2092. [2025-02-08 08:00:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1191 states have (on average 1.9252728799328296) internal successors, (2293), 2085 states have internal predecessors, (2293), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2801 transitions. [2025-02-08 08:00:34,801 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2801 transitions. Word has length 2 [2025-02-08 08:00:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:34,801 INFO L471 AbstractCegarLoop]: Abstraction has 2092 states and 2801 transitions. [2025-02-08 08:00:34,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:34,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2801 transitions. [2025-02-08 08:00:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:00:34,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:34,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:34,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:00:34,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:34,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash 85080681, now seen corresponding path program 1 times [2025-02-08 08:00:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:34,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404480236] [2025-02-08 08:00:34,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:34,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:00:34,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:00:34,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:34,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:35,033 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-08 08:00:35,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:35,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404480236] [2025-02-08 08:00:35,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404480236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:35,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:35,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:00:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089280440] [2025-02-08 08:00:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:35,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:00:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:35,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:00:35,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:00:35,034 INFO L87 Difference]: Start difference. First operand 2092 states and 2801 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:37,376 INFO L93 Difference]: Finished difference Result 3403 states and 4689 transitions. [2025-02-08 08:00:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:00:37,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:00:37,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:37,390 INFO L225 Difference]: With dead ends: 3403 [2025-02-08 08:00:37,390 INFO L226 Difference]: Without dead ends: 3403 [2025-02-08 08:00:37,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:00:37,393 INFO L435 NwaCegarLoop]: 3791 mSDtfsCounter, 6355 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6355 SdHoareTripleChecker+Valid, 6068 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:37,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6355 Valid, 6068 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 08:00:37,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2025-02-08 08:00:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 2042. [2025-02-08 08:00:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1143 states have (on average 1.9221347331583551) internal successors, (2197), 2035 states have internal predecessors, (2197), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2705 transitions. [2025-02-08 08:00:37,450 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2705 transitions. Word has length 7 [2025-02-08 08:00:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:37,450 INFO L471 AbstractCegarLoop]: Abstraction has 2042 states and 2705 transitions. [2025-02-08 08:00:37,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2705 transitions. [2025-02-08 08:00:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:00:37,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:37,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:37,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:00:37,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:37,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:37,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1657461931, now seen corresponding path program 1 times [2025-02-08 08:00:37,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:37,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542416496] [2025-02-08 08:00:37,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:37,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:37,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:00:37,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:00:37,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:37,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:37,530 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-08 08:00:37,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:37,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542416496] [2025-02-08 08:00:37,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542416496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:37,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:37,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:00:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996911392] [2025-02-08 08:00:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:37,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:00:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:37,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:00:37,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:00:37,532 INFO L87 Difference]: Start difference. First operand 2042 states and 2705 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:38,688 INFO L93 Difference]: Finished difference Result 3308 states and 4549 transitions. [2025-02-08 08:00:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:00:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 08:00:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:38,701 INFO L225 Difference]: With dead ends: 3308 [2025-02-08 08:00:38,701 INFO L226 Difference]: Without dead ends: 3308 [2025-02-08 08:00:38,702 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-08 08:00:38,702 INFO L435 NwaCegarLoop]: 4074 mSDtfsCounter, 2072 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 5861 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:38,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 5861 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 08:00:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2025-02-08 08:00:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 1995. [2025-02-08 08:00:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1143 states have (on average 1.8810148731408574) internal successors, (2150), 1988 states have internal predecessors, (2150), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2658 transitions. [2025-02-08 08:00:38,748 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2658 transitions. Word has length 8 [2025-02-08 08:00:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:38,749 INFO L471 AbstractCegarLoop]: Abstraction has 1995 states and 2658 transitions. [2025-02-08 08:00:38,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2658 transitions. [2025-02-08 08:00:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:00:38,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:38,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:38,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:00:38,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:38,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:38,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1657461930, now seen corresponding path program 1 times [2025-02-08 08:00:38,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:38,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369777060] [2025-02-08 08:00:38,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:38,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:38,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:00:38,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:00:38,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:38,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:38,839 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-08 08:00:38,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:38,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369777060] [2025-02-08 08:00:38,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369777060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:38,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:38,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:00:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451165315] [2025-02-08 08:00:38,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:38,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:00:38,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:38,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:00:38,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:00:38,843 INFO L87 Difference]: Start difference. First operand 1995 states and 2658 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:39,860 INFO L93 Difference]: Finished difference Result 3288 states and 4528 transitions. [2025-02-08 08:00:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:00:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 08:00:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:39,870 INFO L225 Difference]: With dead ends: 3288 [2025-02-08 08:00:39,870 INFO L226 Difference]: Without dead ends: 3288 [2025-02-08 08:00:39,870 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-08 08:00:39,873 INFO L435 NwaCegarLoop]: 4208 mSDtfsCounter, 1863 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 SdHoareTripleChecker+Valid, 6110 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:39,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1865 Valid, 6110 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 08:00:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2025-02-08 08:00:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 1970. [2025-02-08 08:00:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1143 states have (on average 1.8591426071741033) internal successors, (2125), 1963 states have internal predecessors, (2125), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2633 transitions. [2025-02-08 08:00:39,916 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2633 transitions. Word has length 8 [2025-02-08 08:00:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:39,916 INFO L471 AbstractCegarLoop]: Abstraction has 1970 states and 2633 transitions. [2025-02-08 08:00:39,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2633 transitions. [2025-02-08 08:00:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:00:39,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:39,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:39,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:00:39,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:39,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:39,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1148446148, now seen corresponding path program 1 times [2025-02-08 08:00:39,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:39,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126195331] [2025-02-08 08:00:39,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:39,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:00:39,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:00:39,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:39,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:39,987 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-08 08:00:39,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:39,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126195331] [2025-02-08 08:00:39,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126195331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:39,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:39,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:00:39,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084703361] [2025-02-08 08:00:39,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:39,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:00:39,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:39,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:00:39,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:00:39,989 INFO L87 Difference]: Start difference. First operand 1970 states and 2633 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 08:00:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:40,685 INFO L93 Difference]: Finished difference Result 3921 states and 5249 transitions. [2025-02-08 08:00:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:00:40,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-02-08 08:00:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:40,696 INFO L225 Difference]: With dead ends: 3921 [2025-02-08 08:00:40,696 INFO L226 Difference]: Without dead ends: 3921 [2025-02-08 08:00:40,696 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-08 08:00:40,697 INFO L435 NwaCegarLoop]: 2546 mSDtfsCounter, 2096 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 7130 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:40,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2099 Valid, 7130 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:00:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2025-02-08 08:00:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 1973. [2025-02-08 08:00:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1146 states have (on average 1.8568935427574171) internal successors, (2128), 1966 states have internal predecessors, (2128), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 2636 transitions. [2025-02-08 08:00:40,744 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 2636 transitions. Word has length 11 [2025-02-08 08:00:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:40,744 INFO L471 AbstractCegarLoop]: Abstraction has 1973 states and 2636 transitions. [2025-02-08 08:00:40,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 08:00:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2636 transitions. [2025-02-08 08:00:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 08:00:40,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:40,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:40,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:00:40,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:40,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash 982767464, now seen corresponding path program 1 times [2025-02-08 08:00:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:40,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843489552] [2025-02-08 08:00:40,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:40,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:00:40,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:00:40,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:40,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:40,838 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-08 08:00:40,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:40,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843489552] [2025-02-08 08:00:40,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843489552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:40,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:40,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:00:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039303085] [2025-02-08 08:00:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:40,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:00:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:40,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:00:40,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:00:40,840 INFO L87 Difference]: Start difference. First operand 1973 states and 2636 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:42,063 INFO L93 Difference]: Finished difference Result 1999 states and 2689 transitions. [2025-02-08 08:00:42,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:00:42,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 08:00:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:42,067 INFO L225 Difference]: With dead ends: 1999 [2025-02-08 08:00:42,068 INFO L226 Difference]: Without dead ends: 1999 [2025-02-08 08:00:42,068 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-08 08:00:42,068 INFO L435 NwaCegarLoop]: 2181 mSDtfsCounter, 2336 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:42,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2339 Valid, 3744 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 08:00:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2025-02-08 08:00:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1950. [2025-02-08 08:00:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1146 states have (on average 1.8368237347294938) internal successors, (2105), 1943 states have internal predecessors, (2105), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2613 transitions. [2025-02-08 08:00:42,107 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2613 transitions. Word has length 18 [2025-02-08 08:00:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:42,108 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 2613 transitions. [2025-02-08 08:00:42,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2613 transitions. [2025-02-08 08:00:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 08:00:42,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:42,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:42,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:00:42,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:42,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash 982767465, now seen corresponding path program 1 times [2025-02-08 08:00:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:42,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230276810] [2025-02-08 08:00:42,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:42,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:42,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:00:42,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:00:42,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:42,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:42,190 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-08 08:00:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230276810] [2025-02-08 08:00:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230276810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:42,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:00:42,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466975433] [2025-02-08 08:00:42,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:42,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:00:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:42,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:00:42,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:00:42,191 INFO L87 Difference]: Start difference. First operand 1950 states and 2613 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:42,278 INFO L93 Difference]: Finished difference Result 1875 states and 2510 transitions. [2025-02-08 08:00:42,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:00:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 08:00:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:42,285 INFO L225 Difference]: With dead ends: 1875 [2025-02-08 08:00:42,285 INFO L226 Difference]: Without dead ends: 1875 [2025-02-08 08:00:42,285 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-08 08:00:42,286 INFO L435 NwaCegarLoop]: 2456 mSDtfsCounter, 60 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4859 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:42,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 4859 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:00:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2025-02-08 08:00:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2025-02-08 08:00:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1083 states have (on average 1.8485687903970451) internal successors, (2002), 1868 states have internal predecessors, (2002), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2510 transitions. [2025-02-08 08:00:42,314 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2510 transitions. Word has length 18 [2025-02-08 08:00:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:42,315 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2510 transitions. [2025-02-08 08:00:42,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2510 transitions. [2025-02-08 08:00:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:00:42,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:42,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:42,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:00:42,316 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:42,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash 400899488, now seen corresponding path program 1 times [2025-02-08 08:00:42,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:42,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260872651] [2025-02-08 08:00:42,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:42,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:00:42,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:00:42,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:42,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:42,388 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-08 08:00:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:42,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260872651] [2025-02-08 08:00:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260872651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:42,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:42,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:00:42,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027899299] [2025-02-08 08:00:42,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:42,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:00:42,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:42,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:00:42,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:00:42,389 INFO L87 Difference]: Start difference. First operand 1875 states and 2510 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:42,506 INFO L93 Difference]: Finished difference Result 1857 states and 2485 transitions. [2025-02-08 08:00:42,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:00:42,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 08:00:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:42,513 INFO L225 Difference]: With dead ends: 1857 [2025-02-08 08:00:42,513 INFO L226 Difference]: Without dead ends: 1857 [2025-02-08 08:00:42,513 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-08 08:00:42,514 INFO L435 NwaCegarLoop]: 2421 mSDtfsCounter, 41 mSDsluCounter, 4814 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 7235 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-08 08:00:42,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 7235 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:00:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2025-02-08 08:00:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1854. [2025-02-08 08:00:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1069 states have (on average 1.8465855940130964) internal successors, (1974), 1847 states have internal predecessors, (1974), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2482 transitions. [2025-02-08 08:00:42,543 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2482 transitions. Word has length 19 [2025-02-08 08:00:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:42,544 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2482 transitions. [2025-02-08 08:00:42,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2482 transitions. [2025-02-08 08:00:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 08:00:42,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:42,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:42,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:00:42,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:42,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash -216991242, now seen corresponding path program 1 times [2025-02-08 08:00:42,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:42,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484087144] [2025-02-08 08:00:42,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:42,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:00:42,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:00:42,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:42,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:42,755 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-08 08:00:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:42,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484087144] [2025-02-08 08:00:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484087144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:42,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:42,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:00:42,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102576821] [2025-02-08 08:00:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:42,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:00:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:42,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:00:42,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:00:42,757 INFO L87 Difference]: Start difference. First operand 1854 states and 2482 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:44,028 INFO L93 Difference]: Finished difference Result 3217 states and 4449 transitions. [2025-02-08 08:00:44,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:00:44,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-08 08:00:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:44,038 INFO L225 Difference]: With dead ends: 3217 [2025-02-08 08:00:44,038 INFO L226 Difference]: Without dead ends: 3217 [2025-02-08 08:00:44,039 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-08 08:00:44,039 INFO L435 NwaCegarLoop]: 2231 mSDtfsCounter, 1864 mSDsluCounter, 2961 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 5192 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:44,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 5192 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 08:00:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2025-02-08 08:00:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 1850. [2025-02-08 08:00:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1069 states have (on average 1.842843779232928) internal successors, (1970), 1843 states have internal predecessors, (1970), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2478 transitions. [2025-02-08 08:00:44,079 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2478 transitions. Word has length 33 [2025-02-08 08:00:44,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:44,082 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2478 transitions. [2025-02-08 08:00:44,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2478 transitions. [2025-02-08 08:00:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 08:00:44,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:44,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:44,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:00:44,084 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:44,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:44,084 INFO L85 PathProgramCache]: Analyzing trace with hash -912220857, now seen corresponding path program 1 times [2025-02-08 08:00:44,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:44,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725118051] [2025-02-08 08:00:44,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:44,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:44,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 08:00:44,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 08:00:44,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:44,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:00:44,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:44,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725118051] [2025-02-08 08:00:44,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725118051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:44,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:44,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:00:44,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531944888] [2025-02-08 08:00:44,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:44,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:00:44,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:44,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:00:44,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:00:44,236 INFO L87 Difference]: Start difference. First operand 1850 states and 2478 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:44,349 INFO L93 Difference]: Finished difference Result 1850 states and 2474 transitions. [2025-02-08 08:00:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:00:44,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-08 08:00:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:44,356 INFO L225 Difference]: With dead ends: 1850 [2025-02-08 08:00:44,360 INFO L226 Difference]: Without dead ends: 1850 [2025-02-08 08:00:44,360 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-08 08:00:44,361 INFO L435 NwaCegarLoop]: 2416 mSDtfsCounter, 21 mSDsluCounter, 4801 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7217 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:44,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7217 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:00:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-02-08 08:00:44,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1850. [2025-02-08 08:00:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1069 states have (on average 1.8391019644527595) internal successors, (1966), 1843 states have internal predecessors, (1966), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2474 transitions. [2025-02-08 08:00:44,393 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2474 transitions. Word has length 68 [2025-02-08 08:00:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:44,396 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2474 transitions. [2025-02-08 08:00:44,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2474 transitions. [2025-02-08 08:00:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 08:00:44,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:44,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:44,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:00:44,398 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:44,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash -553459969, now seen corresponding path program 1 times [2025-02-08 08:00:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:44,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223078053] [2025-02-08 08:00:44,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:44,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 08:00:44,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 08:00:44,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:44,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:44,584 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-08 08:00:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223078053] [2025-02-08 08:00:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223078053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:44,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:00:44,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694130026] [2025-02-08 08:00:44,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:44,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:00:44,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:44,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:00:44,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:00:44,588 INFO L87 Difference]: Start difference. First operand 1850 states and 2474 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:44,740 INFO L93 Difference]: Finished difference Result 3177 states and 4395 transitions. [2025-02-08 08:00:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:00:44,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-08 08:00:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:44,749 INFO L225 Difference]: With dead ends: 3177 [2025-02-08 08:00:44,749 INFO L226 Difference]: Without dead ends: 3177 [2025-02-08 08:00:44,749 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-08 08:00:44,750 INFO L435 NwaCegarLoop]: 2692 mSDtfsCounter, 1349 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 5077 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:44,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 5077 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:00:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2025-02-08 08:00:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2623. [2025-02-08 08:00:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 1842 states have (on average 1.8371335504885993) internal successors, (3384), 2616 states have internal predecessors, (3384), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 3892 transitions. [2025-02-08 08:00:44,800 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 3892 transitions. Word has length 76 [2025-02-08 08:00:44,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:44,801 INFO L471 AbstractCegarLoop]: Abstraction has 2623 states and 3892 transitions. [2025-02-08 08:00:44,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3892 transitions. [2025-02-08 08:00:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 08:00:44,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:44,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:44,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:00:44,805 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:44,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1694433930, now seen corresponding path program 1 times [2025-02-08 08:00:44,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:44,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468895930] [2025-02-08 08:00:44,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:44,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 08:00:44,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 08:00:44,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:44,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:45,161 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-08 08:00:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468895930] [2025-02-08 08:00:45,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468895930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:45,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:45,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:00:45,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810888805] [2025-02-08 08:00:45,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:45,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:00:45,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:45,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:00:45,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:00:45,163 INFO L87 Difference]: Start difference. First operand 2623 states and 3892 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:45,799 INFO L93 Difference]: Finished difference Result 2622 states and 3891 transitions. [2025-02-08 08:00:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:00:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 08:00:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:45,805 INFO L225 Difference]: With dead ends: 2622 [2025-02-08 08:00:45,805 INFO L226 Difference]: Without dead ends: 2622 [2025-02-08 08:00:45,805 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-08 08:00:45,805 INFO L435 NwaCegarLoop]: 2426 mSDtfsCounter, 2 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8716 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:45,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8716 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:00:45,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2025-02-08 08:00:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2622. [2025-02-08 08:00:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 1842 states have (on average 1.8365906623235613) internal successors, (3383), 2615 states have internal predecessors, (3383), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3891 transitions. [2025-02-08 08:00:45,844 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 3891 transitions. Word has length 84 [2025-02-08 08:00:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:45,846 INFO L471 AbstractCegarLoop]: Abstraction has 2622 states and 3891 transitions. [2025-02-08 08:00:45,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3891 transitions. [2025-02-08 08:00:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 08:00:45,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:45,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:45,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:00:45,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:45,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1694433931, now seen corresponding path program 1 times [2025-02-08 08:00:45,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:45,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018963621] [2025-02-08 08:00:45,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:45,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:45,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 08:00:45,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 08:00:45,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:45,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:46,315 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-08 08:00:46,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:46,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018963621] [2025-02-08 08:00:46,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018963621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:46,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:46,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:00:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519787974] [2025-02-08 08:00:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:46,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:00:46,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:46,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:00:46,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:00:46,317 INFO L87 Difference]: Start difference. First operand 2622 states and 3891 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:46,977 INFO L93 Difference]: Finished difference Result 2621 states and 3890 transitions. [2025-02-08 08:00:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:00:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 08:00:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:46,982 INFO L225 Difference]: With dead ends: 2621 [2025-02-08 08:00:46,982 INFO L226 Difference]: Without dead ends: 2621 [2025-02-08 08:00:46,982 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-08 08:00:46,983 INFO L435 NwaCegarLoop]: 2426 mSDtfsCounter, 1 mSDsluCounter, 6261 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8687 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:46,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8687 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:00:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2025-02-08 08:00:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2621. [2025-02-08 08:00:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 1841 states have (on average 1.8370450841933732) internal successors, (3382), 2614 states have internal predecessors, (3382), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:00:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 3890 transitions. [2025-02-08 08:00:47,014 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 3890 transitions. Word has length 84 [2025-02-08 08:00:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:47,014 INFO L471 AbstractCegarLoop]: Abstraction has 2621 states and 3890 transitions. [2025-02-08 08:00:47,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:00:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 3890 transitions. [2025-02-08 08:00:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-08 08:00:47,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:47,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:47,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:00:47,015 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:47,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:47,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2105894937, now seen corresponding path program 1 times [2025-02-08 08:00:47,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:47,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677227531] [2025-02-08 08:00:47,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:47,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 08:00:47,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 08:00:47,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:47,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:47,267 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-08 08:00:47,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:47,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677227531] [2025-02-08 08:00:47,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677227531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:47,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:47,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:00:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605035576] [2025-02-08 08:00:47,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:47,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:00:47,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:47,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:00:47,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:00:47,269 INFO L87 Difference]: Start difference. First operand 2621 states and 3890 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:00:48,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:48,778 INFO L93 Difference]: Finished difference Result 2633 states and 3905 transitions. [2025-02-08 08:00:48,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:00:48,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2025-02-08 08:00:48,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:48,789 INFO L225 Difference]: With dead ends: 2633 [2025-02-08 08:00:48,789 INFO L226 Difference]: Without dead ends: 2633 [2025-02-08 08:00:48,790 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-08 08:00:48,790 INFO L435 NwaCegarLoop]: 2413 mSDtfsCounter, 11 mSDsluCounter, 8249 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10662 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:48,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10662 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 08:00:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-02-08 08:00:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2627. [2025-02-08 08:00:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 1846 states have (on average 1.8358613217768147) internal successors, (3389), 2619 states have internal predecessors, (3389), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:00:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3900 transitions. [2025-02-08 08:00:48,834 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3900 transitions. Word has length 92 [2025-02-08 08:00:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:48,834 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 3900 transitions. [2025-02-08 08:00:48,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:00:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3900 transitions. [2025-02-08 08:00:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-08 08:00:48,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:48,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:48,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:00:48,836 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:48,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:48,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2105894936, now seen corresponding path program 1 times [2025-02-08 08:00:48,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:48,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544684331] [2025-02-08 08:00:48,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:48,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:48,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 08:00:48,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 08:00:48,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:48,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:49,342 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-08 08:00:49,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:49,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544684331] [2025-02-08 08:00:49,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544684331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:00:49,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:00:49,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:00:49,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994417209] [2025-02-08 08:00:49,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:00:49,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:00:49,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:49,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:00:49,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:00:49,345 INFO L87 Difference]: Start difference. First operand 2627 states and 3900 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:00:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:50,588 INFO L93 Difference]: Finished difference Result 2627 states and 3899 transitions. [2025-02-08 08:00:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:00:50,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2025-02-08 08:00:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:50,595 INFO L225 Difference]: With dead ends: 2627 [2025-02-08 08:00:50,596 INFO L226 Difference]: Without dead ends: 2627 [2025-02-08 08:00:50,596 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-08 08:00:50,597 INFO L435 NwaCegarLoop]: 2417 mSDtfsCounter, 6 mSDsluCounter, 8046 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10463 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:50,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10463 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 08:00:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2025-02-08 08:00:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2627. [2025-02-08 08:00:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 1846 states have (on average 1.8353196099674973) internal successors, (3388), 2619 states have internal predecessors, (3388), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:00:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3899 transitions. [2025-02-08 08:00:50,635 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3899 transitions. Word has length 92 [2025-02-08 08:00:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:50,635 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 3899 transitions. [2025-02-08 08:00:50,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:00:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3899 transitions. [2025-02-08 08:00:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 08:00:50,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:50,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:50,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:00:50,636 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:50,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:50,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1869256120, now seen corresponding path program 1 times [2025-02-08 08:00:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:50,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323125585] [2025-02-08 08:00:50,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:50,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:00:50,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:00:50,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:50,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:51,129 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-08 08:00:51,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:51,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323125585] [2025-02-08 08:00:51,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323125585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:00:51,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599237472] [2025-02-08 08:00:51,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:51,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:00:51,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:00:51,132 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-08 08:00:51,134 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-08 08:00:51,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:00:51,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:00:51,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:51,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:51,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:00:51,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:00:51,572 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:00:51,573 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-08 08:00:51,606 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-08 08:00:51,696 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-08 08:00:51,893 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:00:51,893 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-08 08:00:51,960 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-08 08:00:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:00:51,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:00:52,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_595 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 08:00:52,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599237472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:00:52,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:00:52,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-02-08 08:00:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800653703] [2025-02-08 08:00:52,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:00:52,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 08:00:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:52,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 08:00:52,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-02-08 08:00:52,039 INFO L87 Difference]: Start difference. First operand 2627 states and 3899 transitions. Second operand has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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-08 08:00:56,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:00:56,267 INFO L93 Difference]: Finished difference Result 2634 states and 3906 transitions. [2025-02-08 08:00:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:00:56,268 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2025-02-08 08:00:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:00:56,273 INFO L225 Difference]: With dead ends: 2634 [2025-02-08 08:00:56,273 INFO L226 Difference]: Without dead ends: 2634 [2025-02-08 08:00:56,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-02-08 08:00:56,274 INFO L435 NwaCegarLoop]: 2081 mSDtfsCounter, 1874 mSDsluCounter, 19236 mSDsCounter, 0 mSdLazyCounter, 8191 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 21317 SdHoareTripleChecker+Invalid, 8709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 8191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:00:56,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 21317 Invalid, 8709 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [518 Valid, 8191 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 08:00:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-02-08 08:00:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2631. [2025-02-08 08:00:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 1850 states have (on average 1.8335135135135134) internal successors, (3392), 2622 states have internal predecessors, (3392), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:00:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3901 transitions. [2025-02-08 08:00:56,330 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3901 transitions. Word has length 93 [2025-02-08 08:00:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:00:56,330 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 3901 transitions. [2025-02-08 08:00:56,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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-08 08:00:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3901 transitions. [2025-02-08 08:00:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 08:00:56,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:00:56,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:00:56,341 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-08 08:00:56,532 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,SelfDestructingSolverStorable16 [2025-02-08 08:00:56,532 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:00:56,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:00:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1869256121, now seen corresponding path program 1 times [2025-02-08 08:00:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:00:56,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545701450] [2025-02-08 08:00:56,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:00:56,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:00:56,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:00:56,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:56,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:57,213 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-08 08:00:57,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:00:57,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545701450] [2025-02-08 08:00:57,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545701450] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:00:57,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439423381] [2025-02-08 08:00:57,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:00:57,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:00:57,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:00:57,218 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-08 08:00:57,220 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-08 08:00:57,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:00:57,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:00:57,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:00:57,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:00:57,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 08:00:57,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:00:57,541 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-08 08:00:57,549 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:00:57,550 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-08 08:00:57,579 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-08 08:00:57,582 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-08 08:00:57,671 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-08 08:00:57,676 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-08 08:00:57,782 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:00:57,783 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-08 08:00:57,788 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-08 08:00:57,826 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-08 08:00:57,833 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-08 08:00:57,851 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-08 08:00:57,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:00:57,946 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_737 (Array Int Int)) (v_ArrVal_738 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_737 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 08:00:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439423381] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:00:57,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:00:57,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-02-08 08:00:57,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514759985] [2025-02-08 08:00:57,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:00:57,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:00:57,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:00:57,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:00:57,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-02-08 08:00:57,951 INFO L87 Difference]: Start difference. First operand 2631 states and 3901 transitions. Second operand has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 18 states have internal predecessors, (118), 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-08 08:01:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:01,543 INFO L93 Difference]: Finished difference Result 2633 states and 3905 transitions. [2025-02-08 08:01:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:01:01,543 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 18 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2025-02-08 08:01:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:01,548 INFO L225 Difference]: With dead ends: 2633 [2025-02-08 08:01:01,548 INFO L226 Difference]: Without dead ends: 2633 [2025-02-08 08:01:01,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 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-08 08:01:01,549 INFO L435 NwaCegarLoop]: 2084 mSDtfsCounter, 1896 mSDsluCounter, 18319 mSDsCounter, 0 mSdLazyCounter, 6609 mSolverCounterSat, 1024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 20403 SdHoareTripleChecker+Invalid, 7633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 6609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:01,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1900 Valid, 20403 Invalid, 7633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 6609 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-08 08:01:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-02-08 08:01:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2624. [2025-02-08 08:01:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 1845 states have (on average 1.834688346883469) internal successors, (3385), 2616 states have internal predecessors, (3385), 505 states have call successors, (505), 4 states have call predecessors, (505), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:01,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3893 transitions. [2025-02-08 08:01:01,583 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3893 transitions. Word has length 93 [2025-02-08 08:01:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:01,584 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 3893 transitions. [2025-02-08 08:01:01,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 18 states have internal predecessors, (118), 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-08 08:01:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3893 transitions. [2025-02-08 08:01:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 08:01:01,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:01,584 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-08 08:01:01,594 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-08 08:01:01,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 08:01:01,789 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:01:01,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:01,791 INFO L85 PathProgramCache]: Analyzing trace with hash -124918782, now seen corresponding path program 1 times [2025-02-08 08:01:01,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:01,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183876969] [2025-02-08 08:01:01,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:01,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:01,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 08:01:01,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 08:01:01,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:01,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:02,288 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-08 08:01:02,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:02,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183876969] [2025-02-08 08:01:02,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183876969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:02,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:02,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 08:01:02,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717345563] [2025-02-08 08:01:02,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:02,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:01:02,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:02,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:01:02,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:01:02,291 INFO L87 Difference]: Start difference. First operand 2624 states and 3893 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:01:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:04,612 INFO L93 Difference]: Finished difference Result 2637 states and 3909 transitions. [2025-02-08 08:01:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:01:04,612 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-02-08 08:01:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:04,618 INFO L225 Difference]: With dead ends: 2637 [2025-02-08 08:01:04,618 INFO L226 Difference]: Without dead ends: 2637 [2025-02-08 08:01:04,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-08 08:01:04,618 INFO L435 NwaCegarLoop]: 2081 mSDtfsCounter, 1884 mSDsluCounter, 12989 mSDsCounter, 0 mSdLazyCounter, 5139 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 15070 SdHoareTripleChecker+Invalid, 5653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 5139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:04,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1888 Valid, 15070 Invalid, 5653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 5139 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 08:01:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2025-02-08 08:01:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2633. [2025-02-08 08:01:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 1853 states have (on average 1.832164058283864) internal successors, (3395), 2624 states have internal predecessors, (3395), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3904 transitions. [2025-02-08 08:01:04,653 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3904 transitions. Word has length 95 [2025-02-08 08:01:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:04,653 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3904 transitions. [2025-02-08 08:01:04,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:01:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3904 transitions. [2025-02-08 08:01:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 08:01:04,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:04,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-08 08:01:04,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:01:04,654 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:01:04,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash -124918781, now seen corresponding path program 1 times [2025-02-08 08:01:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166585915] [2025-02-08 08:01:04,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:04,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:04,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 08:01:04,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 08:01:04,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:04,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:05,248 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-08 08:01:05,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166585915] [2025-02-08 08:01:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166585915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:05,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:05,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:01:05,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454298246] [2025-02-08 08:01:05,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:05,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:01:05,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:05,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:01:05,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:01:05,250 INFO L87 Difference]: Start difference. First operand 2633 states and 3904 transitions. Second operand has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:01:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:07,225 INFO L93 Difference]: Finished difference Result 2636 states and 3908 transitions. [2025-02-08 08:01:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:01:07,225 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-02-08 08:01:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:07,230 INFO L225 Difference]: With dead ends: 2636 [2025-02-08 08:01:07,230 INFO L226 Difference]: Without dead ends: 2636 [2025-02-08 08:01:07,230 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-08 08:01:07,231 INFO L435 NwaCegarLoop]: 2085 mSDtfsCounter, 1894 mSDsluCounter, 11430 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 13515 SdHoareTripleChecker+Invalid, 4230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:07,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 13515 Invalid, 4230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 08:01:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-02-08 08:01:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2633. [2025-02-08 08:01:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 1853 states have (on average 1.8316243928764167) internal successors, (3394), 2624 states have internal predecessors, (3394), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3903 transitions. [2025-02-08 08:01:07,263 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3903 transitions. Word has length 95 [2025-02-08 08:01:07,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:07,264 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3903 transitions. [2025-02-08 08:01:07,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:01:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3903 transitions. [2025-02-08 08:01:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 08:01:07,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:07,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:07,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:01:07,265 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:01:07,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1533032303, now seen corresponding path program 1 times [2025-02-08 08:01:07,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:07,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947801311] [2025-02-08 08:01:07,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:07,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:07,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 08:01:07,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 08:01:07,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:07,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:07,892 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-08 08:01:07,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:07,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947801311] [2025-02-08 08:01:07,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947801311] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:07,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483793868] [2025-02-08 08:01:07,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:07,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:07,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:07,895 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-08 08:01:07,898 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-08 08:01:08,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 08:01:08,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 08:01:08,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:08,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:08,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 08:01:08,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:08,137 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-08 08:01:08,242 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:01:08,243 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-08 08:01:08,266 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-08 08:01:08,332 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-08 08:01:08,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:08,452 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-08 08:01:08,536 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:08,537 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-08 08:01:08,547 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-08 08:01:08,571 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-08 08:01:08,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:08,615 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-08 08:01:08,637 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1022 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1022))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1019)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 08:01:08,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483793868] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:08,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:08,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-02-08 08:01:08,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798294223] [2025-02-08 08:01:08,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:08,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 08:01:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:08,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 08:01:08,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=424, Unknown=12, NotChecked=86, Total=600 [2025-02-08 08:01:08,641 INFO L87 Difference]: Start difference. First operand 2633 states and 3903 transitions. Second operand has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:01:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:13,380 INFO L93 Difference]: Finished difference Result 2635 states and 3907 transitions. [2025-02-08 08:01:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:01:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2025-02-08 08:01:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:13,384 INFO L225 Difference]: With dead ends: 2635 [2025-02-08 08:01:13,384 INFO L226 Difference]: Without dead ends: 2635 [2025-02-08 08:01:13,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=547, Unknown=12, NotChecked=98, Total=756 [2025-02-08 08:01:13,385 INFO L435 NwaCegarLoop]: 2080 mSDtfsCounter, 1863 mSDsluCounter, 20294 mSDsCounter, 0 mSdLazyCounter, 9593 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1867 SdHoareTripleChecker+Valid, 22374 SdHoareTripleChecker+Invalid, 10109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 9593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:13,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1867 Valid, 22374 Invalid, 10109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 9593 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-08 08:01:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-02-08 08:01:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2632. [2025-02-08 08:01:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 1853 states have (on average 1.8310847274689692) internal successors, (3393), 2623 states have internal predecessors, (3393), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 3902 transitions. [2025-02-08 08:01:13,412 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 3902 transitions. Word has length 96 [2025-02-08 08:01:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:13,412 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 3902 transitions. [2025-02-08 08:01:13,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:01:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3902 transitions. [2025-02-08 08:01:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 08:01:13,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:13,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:13,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:01:13,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:13,618 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:01:13,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:13,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1533032302, now seen corresponding path program 1 times [2025-02-08 08:01:13,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:13,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857859904] [2025-02-08 08:01:13,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:13,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:13,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 08:01:13,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 08:01:13,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:13,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:14,279 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-08 08:01:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857859904] [2025-02-08 08:01:14,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857859904] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817965887] [2025-02-08 08:01:14,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:14,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:14,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:14,282 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-08 08:01:14,284 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-08 08:01:14,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 08:01:14,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 08:01:14,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:14,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:14,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 08:01:14,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:14,508 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-08 08:01:14,610 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-08 08:01:14,618 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:01:14,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:01:14,646 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-08 08:01:14,651 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-08 08:01:14,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 08:01:14,732 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-08 08:01:14,823 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:14,823 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-08 08:01:14,827 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-08 08:01:14,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:14,897 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-08 08:01:14,905 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-08 08:01:14,919 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-08 08:01:14,922 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-08 08:01:14,940 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-08 08:01:14,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:15,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 08:01:15,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-02-08 08:01:15,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1180) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1179))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1180) .cse1 v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 08:01:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817965887] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:15,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:15,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-08 08:01:15,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363540130] [2025-02-08 08:01:15,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:15,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:01:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:15,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:01:15,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2025-02-08 08:01:15,063 INFO L87 Difference]: Start difference. First operand 2632 states and 3902 transitions. Second operand has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 20 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:01:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:17,719 INFO L93 Difference]: Finished difference Result 2634 states and 3906 transitions. [2025-02-08 08:01:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:01:17,719 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 20 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2025-02-08 08:01:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:17,724 INFO L225 Difference]: With dead ends: 2634 [2025-02-08 08:01:17,724 INFO L226 Difference]: Without dead ends: 2634 [2025-02-08 08:01:17,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2025-02-08 08:01:17,727 INFO L435 NwaCegarLoop]: 2083 mSDtfsCounter, 1869 mSDsluCounter, 13384 mSDsCounter, 0 mSdLazyCounter, 4744 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 15467 SdHoareTripleChecker+Invalid, 5766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 4744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:17,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 15467 Invalid, 5766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1022 Valid, 4744 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-08 08:01:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-02-08 08:01:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2622. [2025-02-08 08:01:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 1845 states have (on average 1.8336043360433605) internal successors, (3383), 2614 states have internal predecessors, (3383), 505 states have call successors, (505), 4 states have call predecessors, (505), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3891 transitions. [2025-02-08 08:01:17,757 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 3891 transitions. Word has length 96 [2025-02-08 08:01:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:17,757 INFO L471 AbstractCegarLoop]: Abstraction has 2622 states and 3891 transitions. [2025-02-08 08:01:17,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 20 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:01:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3891 transitions. [2025-02-08 08:01:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 08:01:17,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:17,758 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-08 08:01:17,769 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-08 08:01:17,962 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,SelfDestructingSolverStorable21 [2025-02-08 08:01:17,963 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:01:17,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2009906464, now seen corresponding path program 1 times [2025-02-08 08:01:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:17,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219269606] [2025-02-08 08:01:17,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:17,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:17,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 08:01:18,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 08:01:18,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:18,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:18,361 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-08 08:01:18,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219269606] [2025-02-08 08:01:18,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219269606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:18,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:18,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:01:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193256956] [2025-02-08 08:01:18,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:18,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:01:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:18,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:01:18,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:01:18,363 INFO L87 Difference]: Start difference. First operand 2622 states and 3891 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:01:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:21,088 INFO L93 Difference]: Finished difference Result 2638 states and 3910 transitions. [2025-02-08 08:01:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:01:21,088 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-02-08 08:01:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:21,092 INFO L225 Difference]: With dead ends: 2638 [2025-02-08 08:01:21,092 INFO L226 Difference]: Without dead ends: 2638 [2025-02-08 08:01:21,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-08 08:01:21,093 INFO L435 NwaCegarLoop]: 2083 mSDtfsCounter, 1880 mSDsluCounter, 16604 mSDsCounter, 0 mSdLazyCounter, 5883 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 18687 SdHoareTripleChecker+Invalid, 6395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 5883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:21,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 18687 Invalid, 6395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 5883 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-08 08:01:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2025-02-08 08:01:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2634. [2025-02-08 08:01:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 1856 states have (on average 1.8297413793103448) internal successors, (3396), 2625 states have internal predecessors, (3396), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3905 transitions. [2025-02-08 08:01:21,125 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3905 transitions. Word has length 98 [2025-02-08 08:01:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:21,125 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 3905 transitions. [2025-02-08 08:01:21,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:01:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3905 transitions. [2025-02-08 08:01:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 08:01:21,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:21,126 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-08 08:01:21,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 08:01:21,127 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:01:21,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2009906463, now seen corresponding path program 1 times [2025-02-08 08:01:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:21,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578842191] [2025-02-08 08:01:21,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:21,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:21,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 08:01:21,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 08:01:21,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:21,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:21,799 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-08 08:01:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578842191] [2025-02-08 08:01:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578842191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:21,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:21,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:01:21,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394337136] [2025-02-08 08:01:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:21,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:01:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:21,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:01:21,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:01:21,801 INFO L87 Difference]: Start difference. First operand 2634 states and 3905 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:01:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:24,290 INFO L93 Difference]: Finished difference Result 2637 states and 3909 transitions. [2025-02-08 08:01:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:01:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-02-08 08:01:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:24,293 INFO L225 Difference]: With dead ends: 2637 [2025-02-08 08:01:24,293 INFO L226 Difference]: Without dead ends: 2637 [2025-02-08 08:01:24,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-08 08:01:24,294 INFO L435 NwaCegarLoop]: 2084 mSDtfsCounter, 1894 mSDsluCounter, 15325 mSDsCounter, 0 mSdLazyCounter, 4725 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 17409 SdHoareTripleChecker+Invalid, 5237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 4725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:24,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 17409 Invalid, 5237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 4725 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 08:01:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2025-02-08 08:01:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2634. [2025-02-08 08:01:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 1856 states have (on average 1.8292025862068966) internal successors, (3395), 2625 states have internal predecessors, (3395), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3904 transitions. [2025-02-08 08:01:24,321 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3904 transitions. Word has length 98 [2025-02-08 08:01:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:24,322 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 3904 transitions. [2025-02-08 08:01:24,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:01:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3904 transitions. [2025-02-08 08:01:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 08:01:24,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:24,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:24,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 08:01:24,323 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:01:24,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2120736753, now seen corresponding path program 1 times [2025-02-08 08:01:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251297521] [2025-02-08 08:01:24,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:24,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 08:01:24,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 08:01:24,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:24,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:24,863 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-08 08:01:24,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:24,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251297521] [2025-02-08 08:01:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251297521] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:24,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970484900] [2025-02-08 08:01:24,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:24,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:24,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:24,867 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-08 08:01:24,869 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-08 08:01:25,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 08:01:25,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 08:01:25,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:25,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:25,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 08:01:25,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:25,108 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-08 08:01:25,219 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:01:25,219 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-08 08:01:25,254 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-08 08:01:25,333 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-08 08:01:25,468 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:25,468 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-08 08:01:25,557 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:25,558 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-08 08:01:25,617 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:25,617 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-08 08:01:25,632 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-08 08:01:25,674 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-08 08:01:25,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:25,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1485 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1485))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1486)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 08:01:25,803 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1485 (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$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1489))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1485)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1486)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 08:01:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970484900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:25,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-02-08 08:01:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674739606] [2025-02-08 08:01:25,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:25,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 08:01:25,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:25,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 08:01:25,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=580, Unknown=23, NotChecked=102, Total=812 [2025-02-08 08:01:25,806 INFO L87 Difference]: Start difference. First operand 2634 states and 3904 transitions. Second operand has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:01:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:30,570 INFO L93 Difference]: Finished difference Result 2636 states and 3908 transitions. [2025-02-08 08:01:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:01:30,571 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2025-02-08 08:01:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:30,574 INFO L225 Difference]: With dead ends: 2636 [2025-02-08 08:01:30,574 INFO L226 Difference]: Without dead ends: 2636 [2025-02-08 08:01:30,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=725, Unknown=23, NotChecked=114, Total=992 [2025-02-08 08:01:30,575 INFO L435 NwaCegarLoop]: 2079 mSDtfsCounter, 1852 mSDsluCounter, 20815 mSDsCounter, 0 mSdLazyCounter, 9076 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 22894 SdHoareTripleChecker+Invalid, 9591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 9076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:30,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 22894 Invalid, 9591 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 9076 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-08 08:01:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-02-08 08:01:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2633. [2025-02-08 08:01:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 1856 states have (on average 1.8286637931034482) internal successors, (3394), 2624 states have internal predecessors, (3394), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3903 transitions. [2025-02-08 08:01:30,605 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3903 transitions. Word has length 99 [2025-02-08 08:01:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:30,605 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3903 transitions. [2025-02-08 08:01:30,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:01:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3903 transitions. [2025-02-08 08:01:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 08:01:30,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:30,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:30,616 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-08 08:01:30,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 08:01:30,807 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:01:30,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:30,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2120736754, now seen corresponding path program 1 times [2025-02-08 08:01:30,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:30,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504907298] [2025-02-08 08:01:30,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:30,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:30,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 08:01:30,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 08:01:30,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:30,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:31,568 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-08 08:01:31,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:31,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504907298] [2025-02-08 08:01:31,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504907298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:31,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139751621] [2025-02-08 08:01:31,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:31,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:31,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:31,572 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-08 08:01:31,574 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-08 08:01:31,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 08:01:31,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 08:01:31,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:31,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:31,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 08:01:31,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:31,824 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-08 08:01:31,920 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-08 08:01:31,927 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:01:31,927 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-08 08:01:31,955 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-08 08:01:31,963 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-08 08:01:32,045 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-08 08:01:32,049 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-08 08:01:32,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:32,138 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-08 08:01:32,144 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-08 08:01:32,217 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:32,217 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-08 08:01:32,222 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-08 08:01:32,280 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:32,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 08:01:32,285 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-08 08:01:32,301 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-08 08:01:32,305 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-08 08:01:32,327 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-08 08:01:32,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:32,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1655 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 08:01:32,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1655 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 08:01:32,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1652) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1653))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1652) .cse1 v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 08:01:32,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1652) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1653) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1653))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1652) .cse2 v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-02-08 08:01:32,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1661 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1660))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1653))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1661) .cse0 v_ArrVal_1652) .cse1 v_ArrVal_1655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1661 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1660))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1661) .cse5 v_ArrVal_1652) (select (select (store .cse6 .cse5 v_ArrVal_1653) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1655))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-02-08 08:01:32,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139751621] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:32,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:32,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-02-08 08:01:32,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007675408] [2025-02-08 08:01:32,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:32,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 08:01:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:32,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 08:01:32,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=480, Unknown=5, NotChecked=240, Total=812 [2025-02-08 08:01:32,479 INFO L87 Difference]: Start difference. First operand 2633 states and 3903 transitions. Second operand has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 22 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:01:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:36,634 INFO L93 Difference]: Finished difference Result 2635 states and 3907 transitions. [2025-02-08 08:01:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:01:36,634 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 22 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2025-02-08 08:01:36,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:36,637 INFO L225 Difference]: With dead ends: 2635 [2025-02-08 08:01:36,637 INFO L226 Difference]: Without dead ends: 2635 [2025-02-08 08:01:36,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=745, Unknown=5, NotChecked=300, Total=1190 [2025-02-08 08:01:36,638 INFO L435 NwaCegarLoop]: 2082 mSDtfsCounter, 1866 mSDsluCounter, 26596 mSDsCounter, 0 mSdLazyCounter, 8084 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1870 SdHoareTripleChecker+Valid, 28678 SdHoareTripleChecker+Invalid, 9106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 8084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:36,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1870 Valid, 28678 Invalid, 9106 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1022 Valid, 8084 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-08 08:01:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-02-08 08:01:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2620. [2025-02-08 08:01:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 1845 states have (on average 1.832520325203252) internal successors, (3381), 2612 states have internal predecessors, (3381), 505 states have call successors, (505), 4 states have call predecessors, (505), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 3889 transitions. [2025-02-08 08:01:36,665 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 3889 transitions. Word has length 99 [2025-02-08 08:01:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:36,666 INFO L471 AbstractCegarLoop]: Abstraction has 2620 states and 3889 transitions. [2025-02-08 08:01:36,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 22 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:01:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 3889 transitions. [2025-02-08 08:01:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 08:01:36,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:36,667 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-08 08:01:36,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:01:36,871 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,SelfDestructingSolverStorable25 [2025-02-08 08:01:36,871 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 08:01:36,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash -980552677, now seen corresponding path program 1 times [2025-02-08 08:01:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:36,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849138861] [2025-02-08 08:01:36,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:36,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:36,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 08:01:36,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 08:01:36,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:36,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:37,305 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-08 08:01:37,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:37,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849138861] [2025-02-08 08:01:37,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849138861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:37,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:37,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 08:01:37,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727851338] [2025-02-08 08:01:37,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:37,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:01:37,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:37,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:01:37,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:01:37,307 INFO L87 Difference]: Start difference. First operand 2620 states and 3889 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)